US5909217A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Large scale system status map
Assignee: International Business Machines Corp
•
Filing: 1997-09-30
•
Granted: 1999-06-01
•
Expires: 2017-09-30
Abstract
Abstract A large scale system status map is displayed. The map is available to the user at the three different levels of detail. At the top level, the map shows a network of nodes displayed individually as contiguous pixels which are grouped into variable size regions. The regions are in turn grouped into clusters. The clusters are preferably displayed as geographically distinct shapes separated by white space. Each cluster will typically correspond to groups of networks within different buildings. Each cluster contains one or more regions indicated by the line-delimited squares of varying size; the regions will typically correspond to distinct groups of nodes such as node belonging to the same network or subnet.
Inventors
- 👤 Thomas William Bereiter
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 11:48
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/22; G; G06; G06F; G06F3/00; G06F3/01; G06F3/048; G06F3/0487; G06F3/0489; H04L43/00; Y; Y10; Y10S; Y10S715/00; Y10S715/961; Y10S715/965; Y10S715/969
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
106 words
A method for displaying status for a very large computer network, comprising the steps of: collecting status data for a plurality of nodes in the network for a first network parameter; presenting the status data on a computer display in a top level window, wherein each node is represented in the display by a respective pixel and a color chosen for each respective pixel is indicative of the status data for the network parameter for the respective node, and wherein each respective pixel is grouped into a group of contiguous pixels of a plurality of similar groups according to a hierarchy to which the nodes belong.
Claim 2
Independent Claim
106 words
A method for displaying status for a very large computer network, comprising the steps of: collecting status data for a plurality of nodes in the network for a first network parameter; presenting the status data on a computer display in a top level window, wherein each node is represented in the display by a respective pixel and a color chosen for each respective pixel is indicative of the status data for the network parameter for the respective node, and wherein each respective pixel is grouped into a group of contiguous pixels of a plurality of similar groups according to a hierarchy to which the nodes belong.
Claim 3
Dependent Claim
35 words
The method as recited in claim 1 wherein each group within the plurality of groups represents a network and a shape and a size of the group indicates a number of nodes in the network.
Claim 4
Dependent Claim
31 words
The method as recited in claim 2 wherein the plurality of groups are connected into a plurality of clusters, each cluster representing a set of networks which share a network characteristic.
Claim 5
Dependent Claim
14 words
The method as recited in claim 3 wherein the network criteria is geographic location.
Claim 6
Dependent Claim
44 words
The method as recited in claim 1 further comprising the steps of: monitoring the network for changes in the status information for the plurality of nodes; and changing the colors used for respective pixels to indicate changes in the status data for respective nodes.
Claim 7
Dependent Claim
55 words
The method as recited in claim 5, wherein one set of similar colors is used to display values of the network parameter in a first range, and wherein at least one color different from the set of similar colors is used to display a value of the network parameter which is outside the first range.
Claim 8
Dependent Claim
73 words
The method as recited in claim 2 further comprising the steps of: monitoring the network for changes in the status information in the plurality of nodes; determining whether all the nodes in a respective group have reached a predetermined status for the network parameter; and displaying all of the pixels assigned to nodes in the group in a new color, indicating that all the nodes in the group have reached the predetermined status.
Claim 9
Dependent Claim
59 words
The method as recited in claim 7 further comprising the steps of: determining whether all the groups in a respective cluster have reached the predetermined status for the network parameter; and displaying all of the pixels assigned to nodes in the cluster in a new color, indicating that all the nodes in the cluster have reached the predetermined status.
Claim 10
Dependent Claim
32 words
The method as recited in claim 8 further comprising the step of responsive to the selection of a cluster, presenting a mid level window containing an enlarged view of the selected cluster.
Claim 11
Dependent Claim
59 words
The method as recited in claim 9 further comparing the step of responsive to the selection of a group within the selected cluster, presenting a lower level window for the selected group wherein individual nodes are represented by icons whose colors are identical to the status colors of the top level and the mid level windows of corresponding pixels.
Claim 12
Independent Claim
161 words
A method for displaying status for a very large network comprising the steps of: presenting a first view of the network representing groupings of nodes, wherein a cluster of nodes which share a common value for a first characteristic are displayed in a first area of the display and groups of nodes within the cluster of nodes which share a respective common value for a second characteristic are displayed in respective areas within the first area and individual nodes are represented within respective areas by respective pixels each colored according to a status value for the node; responsive to a selection of a cluster of nodes, presenting an enlarged view of the selected cluster of nodes; and responsive to a selection of a group of nodes within the selected cluster of nodes, presenting an icon view of the selected group of nodes where each individual node is represented by a colored icon colored according to the status value for the node.
Claim 13
Independent Claim
161 words
A method for displaying status for a very large network comprising the steps of: presenting a first view of the network representing groupings of nodes, wherein a cluster of nodes which share a common value for a first characteristic are displayed in a first area of the display and groups of nodes within the cluster of nodes which share a respective common value for a second characteristic are displayed in respective areas within the first area and individual nodes are represented within respective areas by respective pixels each colored according to a status value for the node; responsive to a selection of a cluster of nodes, presenting an enlarged view of the selected cluster of nodes; and responsive to a selection of a group of nodes within the selected cluster of nodes, presenting an icon view of the selected group of nodes where each individual node is represented by a colored icon colored according to the status value for the node.
Claim 14
Independent Claim
107 words
A method for displaying status for a very large network comprising the steps of: collecting network grouping data which organizes nodes into groups and groups into clusters according to shared characteristics of members of the respective groups and clusters; selecting a shape for each group indicating how many nodes are members of the respective group; forming a cluster shape from the group shapes for each cluster according to the groups which are members of the respective cluster; collecting network status information for the nodes in the network; selecting a color for each pixel for each node according to the collected network status; presenting a network status map.
Claim 15
Independent Claim
107 words
A method for displaying status for a very large network comprising the steps of: collecting network grouping data which organizes nodes into groups and groups into clusters according to shared characteristics of members of the respective groups and clusters; selecting a shape for each group indicating how many nodes are members of the respective group; forming a cluster shape from the group shapes for each cluster according to the groups which are members of the respective cluster; collecting network status information for the nodes in the network; selecting a color for each pixel for each node according to the collected network status; presenting a network status map.
Claim 16
Dependent Claim
24 words
The method as recited in claim 12 further comprising the step of arranging the cluster shapes on the display according to a cluster rule.
Claim 17
Dependent Claim
25 words
The method as recited in claim 13 further comprising the step of arranging the group shapes in the cluster shape according to a grouping rule.
Claim 18
Dependent Claim
34 words
The method as recited in claim 12 further comprising the steps of: monitoring the network status; detecting changes in network status; and updating the colors of respective pixels according to changes in network status.
Claim 19
Independent Claim
104 words
A system for displaying status for a very large network, including processor, memory, input devices and display, comprising: means for collecting network status information for a plurality of nodes in the network; means for selecting a color for each pixel for each node according to the collected network status; and means for presenting the status data on the display in a top level map, wherein each node is represented in the display by a respective pixel, and wherein each respective pixel is grouped into a group of contiguous pixels of a plurality of similar groups according to a hierarchy to which the nodes belong.
Claim 20
Independent Claim
104 words
A system for displaying status for a very large network, including processor, memory, input devices and display, comprising: means for collecting network status information for a plurality of nodes in the network; means for selecting a color for each pixel for each node according to the collected network status; and means for presenting the status data on the display in a top level map, wherein each node is represented in the display by a respective pixel, and wherein each respective pixel is grouped into a group of contiguous pixels of a plurality of similar groups according to a hierarchy to which the nodes belong.
Claim 21
Dependent Claim
90 words
The system as recited in claim 16 further comprising: means for collecting network grouping data which organizes nodes into groups and groups into clusters according to shared characteristics of members of the respective groups and clusters; means for selecting a shape for each group indicating how many nodes are members of the respective group; means for forming a cluster shape from the group shapes for each cluster according to the groups which are members of the respective cluster; and means for arranging the cluster shapes into the top level map.
Claim 22
Dependent Claim
21 words
The system as recited in claim 17 wherein the cluster shapes are arranged on the display according to a cluster rule.
Claim 23
Dependent Claim
22 words
The system as recited in claim 17 wherein the group shapes are arranged in the cluster shape according to a grouping rule.
Claim 24
Dependent Claim
37 words
The system as recited in claim 17 further comprising: means for monitoring the network status; means for detecting changes in network status; and means for updating the colors of respective pixels according to changes in network status.
Claim 25
Dependent Claim
115 words
A computer program product in a computer readable medium for displaying status for a very large network, comprising: means for collecting network status information on a first network parameter for a plurality of nodes in the network; means for selecting a color from a first set of colors for each pixel for each node according to the collected network status; and means for presenting the status data on the display in a top level map, wherein each node is represented in the display by a respective pixel, and wherein each respective pixel is grouped into a group of contiguous pixels of a plurality of similar groups according to a hierarchy to which the nodes belong.
Claim 26
Dependent Claim
115 words
A computer program product in a computer readable medium for displaying status for a very large network, comprising: means for collecting network status information on a first network parameter for a plurality of nodes in the network; means for selecting a color from a first set of colors for each pixel for each node according to the collected network status; and means for presenting the status data on the display in a top level map, wherein each node is represented in the display by a respective pixel, and wherein each respective pixel is grouped into a group of contiguous pixels of a plurality of similar groups according to a hierarchy to which the nodes belong.
Claim 27
Dependent Claim
86 words
The product as recited in claim 21 further comprising: means for collecting network status information on a second network parameter for a plurality of nodes in the network; means for selecting a color from a second set of colors for each group of nodes according to the collected network status for the second network parameter; and means for presenting the status data on the display in the top level map, wherein the selected color for each group is blended into the selected color for each node.
Claim 28
Dependent Claim
40 words
The product as recited in claim 21 wherein the nodes in each group within the plurality of groups share a first network characteristic and a shape and a size of the group indicates a number of nodes in the group.
Claim 29
Dependent Claim
32 words
The product as recited in claim 23 wherein the plurality of groups are connected into a plurality of clusters, each cluster representing a set of networks which share a second network characteristic.
References Cited (Backward Citations)
US5623590A
Cited
US5136690A
Cited
US5353399A
Cited
US5276789A
Cited
US5226120A
Cited
US5270919A
Cited
US5295244A
Cited
US5504921A
Cited
US5261044A
Cited
US5394522A
Cited
US5471399A
Cited
US5479598A
Cited
US5737553A
Cited
US5751965A
Cited
US5790121A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-05-31 | 2002-11-30 | 2003-06-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-05-31 | 2006-11-30 | 2007-06-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-05-31 | 2010-11-30 | 2011-06-01 | $7700.00 | Window Closed / Lapsed |