Identity assignment for software components

• US 7,877,515 B2
• Filed: 05/21/2008
• Issued: 01/25/2011
• Est. Priority Date: 05/21/2008
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Maloy, Jon Paul, Andersson, Per, Krishnan, Suresh
• Primary Examiner(s): Chan; Wing F
• Assistant Examiner(s): Zong; Ruolei
• Application Number:
  US12/124,633
• Publication Number:
  US 20090292712A1
• Time in Patent Office: 979 Days
• Field of Search: 709/245, 709/217, 709/203, 714/4, 714/5, 717120-123
• US Class Current: 709/245
• CPC Class Codes: G06F 2209/463 Naming
• CPC Class Codes: G06F 9/5088 involving task migration

Abstract

Devices, systems, methods and software are described which provide identity assignment and redistribution capabilities for software components of a distributed application. Identity value ranges can be fixed or variable. Identity assignment schemes according to exemplary embodiments facilitate the continuation of traffic between the components and clients during redistribution of the identities.

Claims

1. A method for assigning identities to N components of a software application, said method comprising:

a) distributing a plurality of identities R_Ib,i in a plurality of equal-sized containers R_c, according to a formula;

2. The method of claim 1, wherein N<

=R_c<

=4N.

3. The method of claim 1, wherein 2^M=R_i/R_c.

4. The method of claim 1, wherein said step of assigning further comprises:

assigning said equal size containers based upon a workload to be performed by each respective component.

5. The method of claim 1, further comprising the step of:

consolidating, after redistributing said identities, multiple containers associated with a single component into a single container.

6. The method of claim 1, further comprising the step of:

advertising a mapping of said redistributed identities to said plurality of components.

7. The method of claim 6, further comprising the steps of:

storing said mapping of said redistributed identities to said plurality of components in a table which is accessible by said one or more clients;

calculating a target identity for delivery of a message by one of said one or more clients; and

selecting, by said one of said one or more clients, a component for delivery of a message using said calculated target identity and said stored mapping.

8. The method of claim 7, wherein said step of calculating further comprises:

performing a hashing function on a character string; and

said step of selecting further comprises;

using an output of said hashing function to index said table and determine an address of said component for delivery of said message.

9. The method of claim 8, wherein said step of using an output of said hashing function further comprises:

reducing a value of said output of said hashing function to be within a range of said plurality of identities by performing a modulo operation on said value of said output.

10. The method of claim 7, further comprising the step of:

sending said message to said selected component including said calculated target identity.

11. A processing node for assigning identities to N components of a software application, said processing node comprising:

at least one processor configured to distribute a plurality of identities R_Ib,i in a plurality of equal-sized containers R_c, according to a formula;

12. The processing node of claim 11, wherein N<

=R_c<

=4N.

13. The processing node of claim 11, wherein 2^M=R_i/R_c.

14. The processing node of claim 13, wherein at least one processor assigns said equal size containers based upon a workload to be performed by each respective component.

15. The processing node of claim 11, wherein said at least one processor consolidates, after redistributing said identities, multiple containers associated with a single component into a single container.

16. The processing node of claim 11, wherein said components advertise their respective redistributed identities to said plurality of components and said one or more clients.

17. The processing node of claim 16, wherein said at least one processor calculates a target identity for delivery of a message by one of said one or more clients, and selects a component for delivery of a message using said calculated target identity and said stored mapping.

18. The processing node of claim 17, wherein said at least one processor performs a hashing function on a character string, and uses an output of said hashing function to index said table and determine an address of said component for delivery of said message.

19. The processing node of claim 18, wherein said at least one processor reduces a value of said output of said hashing function to be within a range of said plurality of identities by performing a modulo operation on said value of said output.

20. The processing node of claim 17, wherein said at least one processor sends said message to said selected component including said calculated target identity.