Method for modeling and documenting a network

• US 20070220451A1
• Filed: 03/16/2006
• Published: 09/20/2007
• Est. Priority Date: 03/16/2006
• Status: Abandoned Application

• Current Assignee: Arizona Public Service Company (Pinnacle West Capital Corporation)
• Original Assignee: Arizona Public Service Company (Pinnacle West Capital Corporation)
• Inventors: Fleming, William, Rael, Christopher, Arnone, Joseph
• Application Number:
  US11/378,441
• Publication Number:
  US 20070220451A1
• Time in Patent Office: Days
• US Class Current: 716/100
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies

Abstract

A network documentation system computer program (302) for documenting a network (100) receives a configuration of elements (205) within the network (100). Methodology (320) of the program represents the elements (205) by nodes (336) in a model of the network (100). Each of the nodes (336) is defined by one of a plurality of nodes types (402), and each of the node types (402) governs structure rules (504) for child nodes (808) and connectivity rules (508) for defining links (338) between nodes (336). The nodes (336) are presented in a network graph (312) in accordance with the structure rules (504) to document the network (100), with the child nodes (808) associated with their respective parent nodes (806). The links (338) are depicted between the nodes (336) in the network graph (312) in accordance with the connectivity rules (508), and represent connections between pairs of elements (205) in the network (100).

Claims

1. A computer-based method for documenting a network comprising:

receiving a configuration of elements within said network;

representing said elements by nodes in a model of said network, each of said nodes being defined by one of a plurality of node types, each of said node types governing structure rules for descendable ones of said nodes; and

presenting said nodes in a network graph in accordance with said structure rules to document said network.

2. A computer-based method as-claimed in claim 1 wherein:

said representing operation comprises;

obtaining a range of said node types descendable from a first one of said nodes in response to said structure rules associated with said first node, said first node representing a first one of said elements in said network; and

creating a child node defined by a first node type within said range of said node types, said child node representing a second one of said elements in said network, said second element being descendent from said first element; and

said presenting operation comprises portraying said child node in said network graph in association with said first node.

3. A computer-based method as claimed in claim 2 wherein said structure rules include a list entry for a node structure list, said node structure list containing said range of said node types, and said obtaining operation comprises accessing said node structure list utilizing said list entry to obtain said range of said node types.

4. A computer-based method as claimed in claim 2 wherein:

said representing operation further comprises creating a second child node defined by said first node type, said second child node representing a third one of said elements in said network, said third element being descendent from said first element; and

said presenting operation further comprises portraying said second child node in said network graph in association with said first node.

5. A computer-based method as claimed in claim 2 wherein:

said representing operation further comprises creating a second child node defined by a second node type within said range of said node types, said second child node representing a third one of said elements in said network, said third element being descendent from said first element; and

said presenting operation further comprises portraying said second child node in said network graph in association with said first node.

6. A computer-based method as claimed in claim 2 further comprising repeating said obtaining, creating, and portraying operations for others of said nodes.

7. A computer-based method as claimed in claim 1 wherein:

a first one of said nodes represents a first one of said elements;

said structure rules for said first node include a unit limit of said descendable ones of said nodes; and

said representing operation comprises creating multiple ones of a child node, a total of said multiple ones of said child node being limited to said unit limit, and said multiple ones of said child node representing multiple elements in said network that are descendent from said first element.

8. A computer-based method as claimed in claim 1 further comprising:

assigning a unique node identifier to said each of said nodes in said network graph; and

correlating said unique node identifier to one of said elements within said network.

9. A computer-based method as claimed in claim 1 wherein said each of said node types further governs connectivity rules for defining links between said nodes, and said method further comprises depicting said links between said nodes in said network graph in accordance with said connectivity rules, each of said links representing connections between two of said elements in said network.

10. A computer-based method as claimed in claim 9 wherein said connectivity rules includes a link entry referencing one of a plurality of link types, each of said link types specifying a type of connection required by said each of said node types, and said depicting operation depicts one of said links between a pair of said nodes when said connectivity rules for said pair of said nodes indicates a common one of said link types.

11. A computer-based method as claimed in claim 9 further comprising:

establishing circuits from said links, said circuits representing continuous paths through said network; and

associating said circuits with ones of said nodes in said network graph.

12. A computer-based method as claimed in claim 11 further comprising:

assigning a unique circuit identifier to each of said circuits in said network graph; and

correlating said unique circuit identifier to a data path within said network.

13. A computer-based method as claimed in claim 1 further comprising:

utilizing a node type template to construct a library of said node types each of which conforms to said node type template, said node type template including a structure rule field for entry of said structure rules; and

selecting one of said node types from said library to define said each of said nodes.

14. A computer-based method as claimed in claim 13 further comprising utilizing a node structure list template to generate a catalog of node structure lists each of which conforms to said node structure list template, said node structure list template including a node type field for entry of said node types for said descendent ones of said node, and said structure rules of said node types referencing said catalog of node structure lists.

15. A computer-based method as claimed in claim 13 wherein said node type template includes a connectivity rule field for entry of connectivity rules specifying a link type for said each node type, and said method further comprises utilizing a link type template to form a list of link types each of which conforms to said link type template and each of which specifies a type of network connection, and said connectivity rules of said node types referencing said list of link types.

16. A computer-based method as claimed in claim 1 wherein said network is a telecommunications network, said nodes in said network graph represent points of interest in said telecommunications network, and said method further comprises utilizing said network graph to manage said telecommunications network.

17. A computer-readable storage medium containing a computer program for documenting a network comprising:

a library of node types constructed in accordance with a node type template, said node type template including a structure rule field for entry of structure rules, said structure rules identifying descendable ones of said node types; and

executable code for instructing a processor to create a network graph, said executable code instructing said processor to perform operations comprising;

receiving a configuration of elements within said network;

representing said elements by nodes in a model of said network, said representing operation comprising;

selecting, a parent node of said nodes, a node type defining said parent node from said library of node types;

obtaining a range of said descendable ones of said node types for said each node in response to said structure rules defining said each node, said each node representing a first one of said elements in said network; and

creating a child node defined by a first node type within said range of said descendable ones of said node types, said child node representing a second one of said elements in said network, said second element being descendent from said first element; and

presenting said child node in association with said each node in a network graph to document said network.

18. A computer-readable storage medium as claimed in claim 17 wherein:

said code further comprises a catalog of node structure lists constructed in accordance with a node structure list template, said node structure list template including a node type field for entry of said node types for said descendable ones of said node types;

said executable code further instructs said processor to reference said catalog of node structure lists in response to said structure rules of said each node type to obtain said range of said descendable node types.

19. A computer-readable storage medium as claimed in claim 17 wherein:

said code further comprises a list of link types constructed in accordance with a link type template, each of said link types specifying a type of network connection;

said node type data structure includes a connectivity rule field for entry of connectivity rules specifying one of said link types for said each node type; and

said executable code further instructs said processor to reference said list in response to said connectivity rules of said each node type to obtain said link type for said node type.

20. A computer-based method for documenting a network comprising:

receiving a configuration of elements within said network;

representing said elements by nodes in a model of said network, each of said nodes being defined by one of a plurality of node types, each of said node types governing structure rules for descendent ones of said nodes and connectivity rules for defining links between said nodes, said representing operation including;

obtaining a range of said node types descendable from a first one of said nodes in response to said structure rules associated with said first node, said first node representing a first one of said elements in said network; and

creating a child node defined by a first node type within said range of said node types, said child node representing a second one of said elements in said network, said second element being descendent from said first element;

presenting said nodes in a network graph in accordance with said structure rules to document said network, said child node being portrayed in association with said first node; and

depicting said links between said nodes in said network graph in accordance with said connectivity rules, each of said links representing connections between two of said elements in said network.

21. A computer-based method as claimed in claim 20 wherein:

said representing operation further comprises creating a second child node defined by said first node type, said second child node representing a third one of said elements in said network, said third element being descendent from said first element; and

said presenting operation further comprises portraying said second child node in said network graph in association with said first node.

22. A computer-based method as claimed in claim 20 wherein:

said representing operation further comprises creating a second child node defined by a second node type within said range of said node types, said second child node representing a third one of said elements in said network, said third element being descendent from said first element; and

said presenting operation further comprises portraying said second child node in said network graph in association with said first node.

23. A computer-based method as claimed in claim 20 wherein said structure rules include a unit limit of said child node defined by said first node type, and said creating operation comprises creating multiple ones of said child node defined by said first node type, a total of said multiple ones of said child node being limited to said unit limit, and said multiple ones of said child node representing multiple elements in said network that are descendent from said first element.

24. A computer-based method as claimed in claim 20 wherein said connectivity rules reference one of a plurality of link types, each of said link types specifying a type of connection required by said each of said node types, and said depicting operation depicts one of said links between a pair of said nodes when said connectivity rules for said pair of said nodes indicates a common one of said link types.

25. A computer-based method as claimed in claim 20 further comprising:

establishing circuits from said links, said circuits representing continuous paths through said network; and

associating said circuits with ones of said nodes in said network graph.