SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR GENERATING CHRONOLOGICALLY ORDERED GLOBALLY UNIQUE IDENTIFIERS

• US 20140215120A1
• Filed: 01/30/2013
• Published: 07/31/2014
• Est. Priority Date: 01/30/2013
• Status: Abandoned Application

• Current Assignee: Carolina Promotions Services, Inc. (Inmar Investment Holdings LLC)
• Original Assignee: Inmar, Inc. (Inmar Investment Holdings LLC)
• Inventors: SAYLOR, David Lee, Fitzgerald, Shawn Page
• Application Number:
  US13/754,115
• Publication Number:
  US 20140215120A1
• Time in Patent Office: Days
• US Class Current: 711/102
• CPC Class Codes: G06F 12/00 Accessing, addressing or allocating within memory systems or architectures digital input from, or digital output to record carriers, e.g. to disk storage units, G06F3/06
• CPC Class Codes: G06F 12/0238 Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: H04L 2101/604 Address structures or formats
• CPC Class Codes: H04L 2101/622 Layer-2 addresses, e.g. medium access control [MAC] addresses
• CPC Class Codes: H04L 9/0662 with particular pseudorandom sequence generator
• CPC Class Codes: H04L 9/0869 involving random numbers or seeds
• CPC Class Codes: H04L 9/0872 using geo-location information, e.g. location data, time, relative position or proximity to other entities

Abstract

A computer-based system, method and computer program product for generating chronologically based globally unique identifiers.

Claims

1. A computer implemented method of generating a plurality of universally unique identifiers (“

UUIDs”

) each of the plurality of UUIDs comprising a plurality of bits arranged in order from a most significant bit to a least significant bit, and for each of the plurality of UUIDs, the method comprises;

generating, via a computer processor, a time value, wherein the time value represents a current time of a computer associated with the computer processor;

setting a plurality of the more significant bits of the UUID to the time value;

setting a plurality of the less significant bits of the UUID to a random number; and

storing the UUID in a memory.

2. The computer implemented method of claim 1, wherein the plurality of bits are arranged in order from left to right with the most significant bit on the far left and the least significant bit on the far right.

4. The computer implemented method of claim 2, wherein the plurality of more significant bits of the UUID that are set to the time value are arranged in order from left to right, with a more significant portion of the time value being on the left within the plurality of more significant bits of the UUID, and a less significant portion of the time value being on the right within the plurality of more significant bits of the UUID.

6. The computer implemented method of claim 1, wherein the plurality of more significant bits of the UUID are the most significant bits of the UUID, and the plurality of less significant bits of the UUID are the least significant bits of the UUID.

7. The computer implemented method of claim 1, further comprising:

generating a metadata value for the UUID, the metadata value identifying a format of the UUID; and

setting bits of the UUID that are between the more significant bits and the less significant bits to the metadata value.

8. The computer implemented method of claim 1, wherein the time value is a UTC time value.

9. The computer implemented method of claim 1, wherein the current time is a current time within a predetermined period.

10. The computer implemented method of claim 1, wherein generating the time value further comprises determining a remainder.

11. The computer implemented method of claim 10, wherein the reminder is a portion of a dividend that is not evenly divisible by a divisor.

12. The computer implemented method of claim 1, wherein generating the time value further comprises determining a remainder of division of the current time of the computer by a modulus.

13. The computer implemented method of claim 12, wherein the method further comprises selecting the modulus from a plurality of predetermined moduli.

14. The computer implemented method of claim 1, wherein

the current time is a current time within a predetermined period;

and

generating the time value further comprises determining a remainder of division of another current time of the computer by a modulus.

15. The computer implemented method of claim 14, wherein the method further comprises synchronizing the another current time of the computer to Coordinated Universal Time.

16. The computer implemented method of claim 14, wherein the another current time of the computer is a system time of the computer.

3. (canceled)

5. (canceled)

17. A computer implemented method of generating a plurality of universally unique identifiers (“

UUIDs”

), each of the plurality of UUIDs comprising a plurality of bits arranged in order from a most significant bit to a least significant bit, and for each of the plurality of UUIDs, the method comprises;

generating, via a computer processor, a time value, wherein the time value represents a current time of a computer associated with the computer processor, and the time value has a faster changing portion and a slower changing portion;

setting a first portion of the bits of the UUID to the slower changing portion of the time value, and setting a second portion of the bits of the UUID to faster changing portion of the time value, wherein the second portion of the more significant bits of the UUID are

proximate the first portion of the bits of the UUID and comprising less significant bits of the UUID than the first portion of the bits of the UUID, and

setting a third portion of the bits of the UUID that are less significant than the second portion of the bits of the UUID to a random number; and

storing the UUID in a memory.

20. The computer implemented method of claim 17, wherein the first portion of the bits of the UUID are the most significant bits of the UUID, and the third portion of the bits of the UUID are the least significant bits of the UUID.

21. The computer implemented method of claim 17, further comprising:

generating a metadata value for the UUID, the metadata value identifying a format of UUID; and

setting bits of the UUID that are between the second portion of the bits of the UUID and the third portion of the bits of the UUID to the metadata value.

22. The computer implemented method of claim 17, wherein the time value is a Coordinated Universal Time time value.

23. The computer implemented method of claim 17, wherein the current time is a current time within a predetermined period.

24. The computer implemented method of claim 17, wherein generating the time value further comprises determining a remainder.

25. The computer implemented method of claim 17, wherein generating the time value further comprises determining a remainder of division of a current time of the computer by a modulus.

26. The computer implemented method of claim 17, wherein

the current time is a current time within a predetermined period;

and

generating the time value further comprises determining a remainder of division of another current time of the computer by a modulus.

18-19. -19. (canceled)

27. A computer program product comprising a non-transitory computer readable medium for generating a plurality of universally unique identifiers (“

UUIDs”

), each of the plurality of UUIDs comprising a plurality of bits arranged in order from left to right, with more significant bits on the left and less significant bits on the right, the computer readable medium comprising program instructions which, when executed by a computer processor, for each of the plurality of UUIDs, will cause the computer processor to

generate a time value, wherein the time value represents a current time of a computer associated with the computer processor;

set a plurality of the more significant bits of the UUID to the time value;

set a plurality of the less significant bits of the UUID to a random number; and

store the UUID in a memory.

28-30. -30. (canceled)

31. A computer program product comprising a non-transitory computer readable medium for generating universally unique identifiers (“

UUIDs”

), each of the UUIDs comprising a plurality of bits arranged in order from left to right, with more significant bits on the left and less significant bits on the right, the computer readable medium comprising program instructions which, when executed by a computer processor, for each of the plurality of UUIDs, will cause the processor to;

generate a time value, wherein the time value represents a current time of a computer associated with the computer processor, and the time value has a faster changing portion and a slower changing portion;

set a first portion of the more significant bits of the UUID to the slower changing portion of the time value, and set a second portion of the more significant bits of the UUID to the faster changing portion of the time value, wherein the second portion of the more significant bits of the UUID are

proximate the first portion of the more significant bits of the UUID, and

between first portion of the more significant bits of the UUID and less significant bits of the UUID;

set a plurality of the less significant bits of the UUID to a random number; and

store the UUID in a memory.

32-33. -33. (canceled)

34. A non-transitory computer readable medium comprising a data structure, which is usable by a program executable on a computer system, for a universally unique identifier (“

UUID”

) comprising;

a plurality of bits arranged from left to right, with more significant bits on the left and less significant bits on the right;

at least some of the more significant bits of the UUID being set to a time value; and

at least some of the less significant bits of the UUID being set to a random number.

35. A non-transitory computer readable medium comprising a data structure, which is usable by a program executable on a computer system, for a universally unique identifier (“

UUID”

) comprising;

a plurality of bits arranged from left to right, with more significant bits on the left and less significant bits on the right;

a first portion of the more significant bits of the UUID being set to a slower changing portion of a time value and a second portion of the more significant bits of the UUID being set to a faster changing portion of the time value, wherein the second portion of the more significant bits of the UUID are

proximate the first portion of the more significant bits of the UUID, and

between the first portion of the more significant bits of the UUID and the less significant bits of the UUID; and

a plurality of the less significant bits of the UUID being set to a random number.

36. A computer implemented method of generating a universally unique identifier (“

UUID”

) that comprises a plurality of bits that are arranged in a plurality of fields, each field including one or more of the plurality of bits, the method comprising;

using a processor to generate a time value that represents a current time;

setting a first field that includes the most significant bits of the UUID to the time value;

setting a second field of the UUID to a random number; and

storing the UUID in a memory.

37. The computer implemented method of claim 36, wherein the bits are arranged from left to right with more significant bits on the left and less significant bits on the right.

38. The computer implemented method of claim 36, wherein the time value represents the current time of a computer associated with the processor expressed as a Coordinated Universal Time value.

39. The computer implemented method of claim 36, wherein the time value represents the current time of a computer associated with the processor expressed as a localtime value.

40. The computer implemented method of claim 36, wherein the time value is an integer representing a number of constant-value time increments that have occurred since a pre-defined epoch.

41. The computer implemented method of claim 36, further comprising setting a third field of the UUID to a value that provides information regarding the format of the UUID.

42. The computer implemented method of claim 37, wherein the more significant portion of the time value is stored in a left portion of the first field and the less significant portion of the time value stored in a right portion of the first field.