Production of statistically-based network maps

• US 5,845,277 A
• Filed: 12/19/1996
• Issued: 12/01/1998
• Est. Priority Date: 12/19/1996
• Status: Expired due to Term

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: MCI Communications Corporation (Verizon Communications Inc.)
• Inventors: Mennenga, Kenneth A., Pfeil, John M.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Mizrahi, Diane D.
• Application Number:
  US08/770,096
• Time in Patent Office: 712 Days
• Field of Search: 395/200.53, 395/200.54, 395/183.19, 395/680, 395/709, 707/104, 707/10, 707/3, 711/205, 436/140, 364/512, 359/111, 359/182.02, 370/408, 1/1
• US Class Current: 1/1
• CPC Class Codes: H04L 41/22 comprising specially adapted graphical user interfaces [GUI]
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 715/969 Network layout and operation interface

Abstract

A system and method for representing a network according to a hierarchy of views of varying detail. The system models networks as a plurality of interconnected nodes. The display is made more simple by combining network elements (i.e., nodes and connections) in two ways. Nearby nodes within a user-selectable proximity are displayed as a single "supernode." Similarly, connections between all the nodes represented by two supernodes are displayed as a single connection between the supemodes. The system adjusts the relative size of each supernode in proportion to the number of nodes each supernode represents. Similarly, the thickness of each inter-supernode connection is adjusted in proportion to the number of inter-node connections it represents. The system allows a user to conveniently "zoom-in" or "zoom-out," and to adjust the level of detail depicted in the display.

Claims

1. A network display system comprising:

a node database;

a connectivity database;

a processor, coupled to said node database and to said connectivity database;

a network map generator for generating a network map display, coupled to said processor, to said node database, and to said connectivity database, said network map generator including;

means for representing a network as a plurality of nodes selectively interconnected by a plurality of inter-node connections,

first means for selectively combining said plurality of nodes into a plurality of supernodes, and

second means for selectively combining said plurality of inter-node connections into a plurality of inter-supernode connections; and

a user interface, coupled to receive said network map display, for displaying said network map display to a user.

2. The system according to claim 1, wherein said network map generator receives a grid size, a set of region boundaries, and a connectivity threshold from said user via said user interface, and wherein said network map generator further comprises:

means for creating a grid of squares overlaying the area defined by said set of region boundaries, wherein said squares have a dimension equal to said grid size.

3. The system according to claim 2, wherein said first means comprises:

means for calculating the coordinates of said plurality of supernodes, wherein said coordinates for each supernode are equal to the statistical mean of the coordinates of said nodes located within each of said squares; and

means for displaying said plurality of supernodes, one supernode for each of said squares containing at least one of said nodes, said supernode located at said coordinates within each of said squares.

4. The system according to claim 3, wherein said second means comprises:

means for calculating the total weight of said plurality of inter-supernode connections, wherein said total weight for each inter-supernode connection is equal to the sum of the weights of said inter-node connections connecting said nodes represented by the particular supernodes connected by said inter-supernode connection; and

means for displaying those of said plurality of inter-supernode connections whose total weight is greater than or equal to said connectivity threshold.

5. The system according to claim 2, wherein said user provides said set of region boundaries via said user interface by selecting a pre-defined region.

6. The system according to claim 2, wherein said user provides said set of region boundaries via said user interface by selecting one of said plurality of supernodes.

7. The system according to claim 2, wherein said user provides said set of region boundaries via said user interface by executing a point-and-drag operation using a mouse.

8. The system according to claim 1, wherein said plurality of supernodes are proportional in size to the number of said plurality of nodes that each of said supernodes represents.

9. The system according to claim 8, wherein said plurality of inter-supernode connections are proportional in thickness to the number of said inter-node connections that each of said inter-supernode connections represents.

10. The system according to claim 1, wherein said user interface comprises:

a local processor, coupled to said network map generator;

a display, coupled to said local processor, operating under the control of a graphical user interface (GUI);

a mouse, coupled to said local processor; and

a keyboard, coupled to said local processor.

11. The system according to claim 1, wherein said node database and said connectivity database are stored in common computer memory.

12. The system according to claim 1, wherein said network management system relates to a telecommunications network.

13. The system according to claim 12, wherein said plurality of nodes comprises either a switching terminal, digital repeater site, or a DS-3 pass-through terminal, and wherein said plurality of inter-node connections comprises either a DS-3 circuit or an OC-12 circuit.

14. The system according to claim 12, wherein said first means combines said plurality of nodes into a plurality of supernodes based on the geographical proximity of said plurality of nodes.

15. The system according to claim 1, wherein said network management system relates to a local area network (LAN).

16. The system according to claim 1, wherein said network management system relates to a wide area network (WAN).

17. The system according to claim 1, wherein said network management system relates to a neural network.

18. A computer program product for displaying a network map display on the user interface, the computer program product comprising:

a computer usable medium having a computer readable program code means embodied in said medium for enabling the computer system to provide a network map display, said computer readable program code means comprising;

computer readable first program code means for enabling the computer system to represent a network as a plurality of nodes selectively interconnected by a plurality of inter-node connections;

computer readable second program code means for selectively combining said plurality of nodes into a plurality of supernodes; and

computer readable third program code means for selectively combining said plurality of inter-node connections into a plurality of inter-supernode connections.

19. A method for displaying a network on a computer display comprising the steps of:

(1) receiving input from a user;

(2) creating a network map display based on said input, including the steps of;

(a) representing a network as a plurality of nodes selectively interconnected by a plurality of inter-node connections,

(b) selectively combining said plurality of nodes into a plurality of supernodes, and

(c) selectively combining said plurality of inter-node connections into a plurality of inter-supernode connections; and

(3) displaying said network map display.

20. The method according to claim 19, wherein said input comprises a grid size, a set of region boundaries, and a connectivity threshold, and wherein step (2) further comprises the step of:

creating a grid of squares overlaying the area defined by said set of region boundaries, wherein said squares have a dimension equal to said grid size.

21. The method according to claim 20, wherein step (2)(b) comprises the steps of:

calculating the coordinates of said plurality of supernodes, wherein said coordinates for each supernode are equal to the statistical mean of the coordinates of said nodes located within each of said squares; and

displaying said plurality of supernodes, one supernode for each of said squares containing at least one of said nodes, said supernode located at said coordinates.

22. The method according to claim 21, wherein step (2)(c) comprises the steps of:

calculating the total weight of said plurality of inter-supernode connections, wherein said total weight for each inter-supernode connection is equal to the sum of the weights of said inter-node connections connecting said nodes represented by the particular supernodes connected by said inter-supernode connection; and

displaying each of said plurality of inter-supernode connections whose total weight is greater than or equal to said connectivity threshold.

23. The method according to claim 19, wherein said plurality of supernodes are proportional in size to the number of said plurality of nodes that each of said supernodes represents.

24. The method according to claim 19, wherein said plurality of inter-supernode connections are proportional in thickness to the number of said inter-node connections that each of said inter-supernode connections represents.

25. The method according to claim 19, wherein said network comprises a telecommunications network.

26. The method according to claim 25, wherein said plurality of nodes comprises either a switching terminal, digital repeater site, or a DS-3 pass-through terminal, and wherein said plurality of inter-node connections comprises either a DS-3 circuit or an OC-12 circuit.

27. The method according to claim 25, wherein said step (2)(b) combines said plurality of nodes into a plurality of supernodes based on the geographical proximity of said plurality of nodes.