METHOD FOR REPRESENTING NODES IN NETWORK

• US 20100172269A1
• Filed: 01/05/2010
• Published: 07/08/2010
• Est. Priority Date: 01/07/2009
• Status: Active Grant

• Current Assignee: Infosys Limited
• Original Assignee: Infosys Technologies Limited (Infosys Limited)
• Inventors: Hariharan, Trichur Easwaran
• Granted Patent: US 8,477,654 B2
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: H04L 41/0233 Object-oriented techniques, for representation of network management data, e.g. common object request broker architecture [CORBA]
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies

Abstract

A method and computer program product for creating a data structure for representing a plurality of nodes in a network. One or more data fields are created corresponding to the plurality of nodes for storing information related to the nodes. One or more references are also created for each node such that each reference refers to a node adjacent to the corresponding node. The data fields and the references are then stored in a plurality of secondary data structures. Thereafter, each node is associated with a secondary data structure which includes the data fields and the references corresponding to the associated node. Subsequently, the data structure may be created for storing the secondary data structures.

Claims

1. A method for creating a primary data structure for representing a plurality of nodes in a network, the method comprising:

a. creating one or more data fields for storing information related to the plurality of nodes, each of the one or more data fields being created corresponding to a node from the plurality of nodes;

b. creating one or more references corresponding to one or more of the plurality of nodes, each of the one or more references referring to a node adjacent to the corresponding one or more nodes;

c. associating each of the plurality of nodes with at least one secondary data structure from a plurality of secondary data structures, the at least one secondary data structure comprising the one or more data fields and the one or more references corresponding to the associated node; and

d. storing the plurality of secondary data structures, wherein the primary data structure is created using the stored plurality of secondary data structures.

2. The method according to claim 1, wherein each of the one or more references refer to a secondary data structure from the plurality of secondary data structures, the secondary data structure being associated with the node adjacent to the corresponding one or more nodes.

3. The method according to claim 1, wherein references corresponding to each of the one or more nodes are stored in one or more tertiary data structures, the one or more tertiary data structures being stored in one or more secondary data structures corresponding to the one or more nodes.

4. The method according to claim 3, wherein each of the one or more tertiary data structures is a circular linked list.

5. The method according to claim 1, wherein the one or more data fields is at least one of a primitive data type, an array, a list, a tree, a graph or a combination thereof.

6. The method according to claim 1 further comprising traversing the primary data structure by accessing the one or more references corresponding to the one or more nodes.

7. The method according to claim 1 further comprising inserting a new node in the network, wherein inserting the new node comprises:

a. creating a new data structure corresponding to the new node to be inserted, the new data structure comprising a set of data fields for storing information related to the new node;

b. setting one or more references in the new data structure to one or more invalid addresses; and

c. inserting the new data structure in the primary data structure.

8. The method according to claim 7 further comprising:

a. identifying a set of nodes adjacent to the new node to be inserted;

b. creating a set of references corresponding to the set of nodes; and

c. storing the set of references in the new data structure.

9. The method according to claim 8 further comprising storing a reference of the new node in a set of secondary data structures.

10. The method according to claim 1 further comprising deleting at least one node from the network, wherein deleting the at least one node comprises:

a. identifying one or more references referring to the at least one node, the one or more references being identified from the plurality of secondary data structures;

b. de-allocating the one or more references; and

c. deleting one or more secondary data structures corresponding to the at least one node from the plurality of secondary data structures.

11. A computer program product for use with a computer, the computer program product comprising a computer usable medium having a computer readable program code embodied therein for creating a primary data structure for representing a plurality of nodes in a network, the computer readable program code performing:

a. creating one or more data fields for storing information related to the plurality of nodes, each of the one or more data fields being created corresponding to a node from the plurality of nodes;

b. creating one or more references corresponding to one or more of the plurality of nodes, each of the one or more references referring to a node adjacent to the corresponding one or more nodes;

c. associating each of the plurality of nodes with at least one secondary data structure from a plurality of secondary data structures, the at least one secondary data structure comprising the one or more data fields and the one or more references corresponding to the associated node; and

d. storing the plurality of secondary data structures, wherein the primary data structure is created using the stored plurality of secondary data structures.

12. The computer program product according to claim 11, wherein each of the one or more references refer to a secondary data structure from the plurality of secondary data structures, the secondary data structure being associated with the node adjacent to the corresponding one or more nodes.

13. The computer program product according to claim 11, wherein references corresponding to each of the one or more nodes are stored in one or more tertiary data structures, the one or more tertiary data structures being stored in one or more secondary data structures corresponding to the one or more nodes.

14. The computer program product according to claim 13, wherein each of the one or more tertiary data structures is a circular linked list.

15. The computer program product according to claim 11, wherein the one or more data fields is at least one of a primitive data type, an array, a list, a tree, a graph or a combination thereof.

16. The computer program product according to claim 11, wherein the computer readable program code further performs traversing the primary data structure by accessing the one or more references corresponding to the one or more nodes.

17. The computer program product according to claim 11, wherein the computer readable program code further performs inserting a new node in the network, wherein inserting the new node comprises:

a. creating a new data structure corresponding to the new node to be inserted, the new data structure comprising a set of data fields for storing information related to the new node;

b. setting one or more references in the new data structure to one or more invalid addresses; and

c. inserting the new data structure in the primary data structure.

18. The computer program product according to claim 17, wherein the computer readable program code further performs:

a. identifying a set of nodes adjacent to the new node to be inserted;

b. creating a set of references corresponding to the set of nodes; and

c. storing the set of references in the new data structure.

19. The computer program product according to claim 18, wherein the computer readable program code further performs storing a reference of the new node in a set of secondary data structures.

20. The computer program product according to claim 11, wherein the computer readable program code further performs deleting at least one node from the network, wherein deleting the at least one node comprises:

a. identifying one or more references referring to the at least one node, the one or more references being identified from the plurality of secondary data structures;

b. de-allocating the one or more references; and

c. deleting one or more secondary data structures corresponding to the at least one node from the plurality of secondary data structures.