LDAP Replication Priority Queuing Mechanism

• US 20120215741A1
• Filed: 05/02/2012
• Published: 08/23/2012
• Est. Priority Date: 12/06/2006
• Status: Abandoned Application

• Current Assignee: Cingular Wireless II LLC (AT&T, Inc.)
• Original Assignee: Cingular Wireless II LLC (AT&T, Inc.)
• Inventors: Poole, Jack, Culver, Timothy
• Application Number:
  US13/462,220
• Publication Number:
  US 20120215741A1
• Time in Patent Office: Days
• US Class Current: 707/634
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/55 Push-based network services
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements

Abstract

A replication priority queuing system prioritizes replication requests in accordance with a predetermined scheme. An exemplary system includes a Replication Priority Queue Manager that receives update requests and assigns a priority based upon business rules and stores the requests in associated storage means. A Replication Decision Engine retrieves the requests from storage and determines a destination for the update based upon predetermined replication rules, and sends the update to the destination.

Claims

1. A method, comprising:

receiving, at a replication management system, a plurality of update requests for replicating data;

assigning, at the replication management system, a first priority level to each update request based upon an age of the update request;

monitoring, at the replication management system, a status of each update request to determine whether the age of the update request has exceeded a predetermined time threshold; and

assigning, at the replication management system, a second, higher priority level to each update request for which it is determined that the age of the update request has exceeded the predetermined time threshold.

2. The method of claim 1, further comprising:

storing, at the replication management system, each update request in one of a plurality of assigned storage locations, wherein the storage locations are assigned to each update request in accordance with a priority level last assigned to the update request.

3. The method of claim 2, wherein if an update request is assigned the second, higher priority level, storing the update request includes moving the update request from a first storage location of the plurality of ordered storage locations to a second storage location.

4. The method of claim 3, wherein the first storage location corresponds to the first priority level, and the second storage location corresponds to the second priority level.

5. The method of claim 2, further comprising processing, at the replication management system, each update request in order based upon the assigned storage locations of the update requests.

6. The method of claim 2, further comprising replicating data according to each of the update requests in order based upon the assigned storage locations of the update requests.

7. The method of claim 2, further comprising determining a destination server among a plurality of servers in a server network that corresponds to each update request.

8. The method of claim 7, further comprising replicating data according to each update request from a master server to the destination server corresponding to the update request.

9. The method of claim 8, wherein the data according to each of the update requests is replicated to the destination servers corresponding to each of the update requests in order based upon the assigned storage locations of the update requests.

10. An apparatus, comprising:

a processor; and

a memory storing instructions which, when executed by the processor, cause the processor to perform a method, comprising;

receiving a plurality of update requests for replicating data;

assigning, to each update request, a first priority level based upon an age of the update request;

monitoring a status of each update request to determine whether the age of the update request has exceeded a predetermined time threshold; and

assigning a second, higher priority level to each update request for which it is determined that the age of the update request has exceeded the predetermined time threshold.

11. The apparatus of claim 10, wherein the instructions further cause the processor to store each update request in one of a plurality of assigned storage locations in accordance with a priority level last assigned to the update request.

12. The apparatus of claim 11, wherein if an update request is assigned the second, higher priority level, the instructions further cause the processor to move the update request from a first storage location of the plurality of assigned storage locations to a second storage location.

13. The apparatus of claim 12, wherein the first storage location corresponds to the first priority level, and the second storage location corresponds to the second, higher priority level.

14. The apparatus of claim 11, wherein data according to each of the update requests is replicated in order based upon the assigned storage locations of the update requests.

15. The apparatus of claim 14, wherein the data according to each of the update requests is replicated to destination servers corresponding to each of the update requests in order based on the assigned storage locations of the update requests.

16. A non-transitory computer readable medium comprising instructions which, when executed by a processor, cause the processor to perform a method comprising:

receiving a plurality of update requests for replicating data;

assigning, to each update request, a first priority level based upon an age of the update request;

monitoring a status of each update request to determine whether the age of the update request has exceeded a predetermined time threshold; and

assigning a second, higher priority level to each update request for which it is determined that the age of the update request has exceeded the predetermined time threshold.

17. The non-transitory computer readable medium of claim 16, wherein the instructions further cause the processor to store each update request in one of a plurality of assigned storage locations in accordance with a priority level last assigned to the update request.

18. The non-transitory computer readable medium of claim 17, wherein if an update request is assigned the second, higher priority level, the instructions further cause the processor to move the update request from a first storage location of the plurality of assigned storage locations to a second storage location.

19. The non-transitory computer readable medium of claim 18, wherein the first storage location corresponds to the first priority level, and the second storage location corresponds to the second, higher priority level.

20. The non-transitory computer readable medium of claim 17, wherein the data according to each of the update requests is replicated to destination servers corresponding to each of the update requests in order based on the assigned storage locations of the update requests.