US 5,276,789 AGranted

Graphic display of network topology

AssigneeHewlett-Packard Company

InventorsLawrence M. Besaw, Jeff C. Wu, Cho Y. Chang, Darren D. Smith, Mark J. Kean

Life of this patent

Estimating the term…

Loading patent…

Abstract

A system for automatically laying out and graphically displaying the topology of a computer network system. The layout system retrieves a list of the nodes within the network and their interconnections from a database which can be manually built by a network administrator or automatically constructed by other software. The system will provide any of three views that can be requested by the user. An internet view is the largest and shows the interconnection of different networks. A network view can be shown for any of the networks described in the internet view. A network is comprised of segments and the system will display a view of the nodes connected to any one of the segments. The system will automatically update the view as new nodes become available in the database. This aspect of the system and allows the system to dynamically update the graph when the list of nodes is being supplied by other software. The system also allows the user to dynamically alter the graph by using a graphical input device to move any of the objects displayed on the graph.

Claims36

Dependent claims

A computer implemented method for displaying, on a graphic output device connected to a computer system, a plurality of graphic objects, wherein each said graphic object has zero, one or a plurality of connecting lines that connect said graphic object to other graphic objects, said method comprising the steps of:

(a) programmatically placing said graphic objects into a graph and assigning each said graphic object to one of a plurality of vertices of said graph;
(b) programmatically placing said connecting lines into said graph and assigning each said connecting line to one of a plurality of edges of said graph, whereby a vertex is said to have an edge if said vertex has one or more connecting lines to other vertices;
(c) programmatically dividing said vertices into clusters comprising the steps of
(c1) temporarily removing one of said edges,
(c2) starting from each of said vertices, programmatically examining each of said edges to programmatically determine if all said vertices are connected through one or more of said edges,
(c3) if one or more vertices is determined by step (c2) to not be connected, collecting said one or more not connected vertices into a separate cluster, and
(c4) repeating steps (c1) through (c3) for said separate cluster;
(d) programmatically arranging each of said vertices within each of said clusters on said graph;
(e) programmatically arranging said clusters on said graph;
(f) displaying said graph on said graphic output device;
and
(g) moving a selected one of said graphic objects in response to each move request entered through a graphical input device.

9 more elements

A computer implemented method of displaying, on a graphic output device attached to a computer system, a view of a computer internetwork comprising the steps of:

(a) programmatically assigning each network within said internetwork to one of a plurality of vertices in a graph stored in said computer system;
(b) programmatically assigning each gateway in said internetwork to one of said plurality of vertices of said graph and programmatically collecting all vertices having zero edges into a cluster and designating said cluster as an orphan cluster;
(c) programmatically assigning each connection between said vertices to one of a plurality of edges in said graph, whereby a vertex is said to have an edge if said vertex has one or more connections to other vertices;
(d) programmatically dividing said vertices into clusters comprising the steps of
(d1) temporarily removing one of said edges,
(d2) starting from each of said vertices, programmatically examining each of said edges to programmatically determine if all said vertices are connected through one or more of said edges,
(d3) if one or more vertices is determined by step (d2) to not be connected, collecting said one or more not connected vertices into a separate cluster, and
(d4) repeating steps (d1) through (d3) for said separate cluster;
(e) programmatically arranging each of said vertices within each of said clusters on said graph;
(f) programmatically arranging said clusters on said graph;
and
(g) displaying said graph on said graphic output device.

9 more elements

A computer implemented method of displaying, on a graphic output device attached to a computer system, a view of a computer network comprising the steps of:

(a) programmatically assigning each segment within said internetwork to one of a plurality of vertices of a graph;
(b) programmatically assigning each connection between said vertices to one of a plurality of edges of said graph, whereby a vertex is said to have an edge if said vertex has one or more connections to other vertices;
(c) programmatically dividing said vertices into clusters comprising the steps of
(c1) temporarily removing one of said edges,
(c2) starting from each of said vertices, programmatically examining each of said edges to programmatically determine if all said vertices are connected through one or more of said edges,
(c3) if one or more vertices is determined by step (c2) to be unconnected, collecting said one or more not connected vertices into a separate cluster, and
(c4) repeating steps (c1) through (c3) for said separate cluster;
(d) programmatically arranging each of said vertices within each of said clusters on said graph;
(e) programmatically arranging said clusters into a row and column format on said graph;
and
(f) displaying said graph on said graphic output device.

8 more elements

Dependencies are inferred from the claim text.

Facts

Application: 07/523,168Filed 14 May 1990
Granted: 4 Jan 1994
Term ends: Not estimatedThe source records don’t support an estimate.

Classification9 codes

G06T 11/26
Drawing from basic elements: drawing of charts or graphs
G06F 30/18
Geometric CAD: network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air…
H04L 41/22
Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks: comprising specially…
G06F 2111/02
Details relating to CAD techniques: cAD in a network environment, e.g. collaborative CAD or distributed simulation