Method for determining topology of a network

• US 5,684,959 A
• Filed: 04/19/1995
• Issued: 11/04/1997
• Est. Priority Date: 04/19/1995
• Status: Expired due to Fees

• Current Assignee: Agilent Technologies, Inc.
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: McKee, Neil, Bhat, Sunil
• Primary Examiner(s): Coleman, Eric
• Application Number:
  US08/425,940
• Time in Patent Office: 930 Days
• Field of Search: 395/800, 395/200.11, 395/200.1
• US Class Current: 709/224
• CPC Class Codes: H04L 12/433 with asynchronous transmission, e.g. token ring, register insertion
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies

Abstract

A system that monitors neighbor information frames (NIFs) sent by each station within a Fiber Distributed Data Interface (FDDI) network to determine the logical map of the network. After monitoring the NIFs for a period of time sufficient for all stations to have sent a NIF, the invention builds and displays a data structure containing the logical connections. If the system finds a missing connection within the network, it builds a gap structure within the data structure to display the missing connection. The system also sends a request to all stations on the network for station management information. After receiving this information from each station, the system builds and displays a data structure containing the physical connections between each of the stations within the network.

Claims

1. A method for constructing and displaying a map of the connections between stations of a token ring type of computer network, said method comprising the steps of:

(a) receiving neighbor information management information data frames from each active station within said network;

(b) defining a data structure for each active station on said network, wherein said data structure identifies the station immediately upstream of a station for which the data structure is defined;

(c) building a station list within a memory of a computer system that receives said data frames, wherein said station list links said stations in an order that each receives a token passed between stations of said network, comprising the steps of

(c1) selecting one of said active stations for said station list, wherein said active station has not been previously selected,

(c2) if said active station selected in step (c1) has identified an upstream station immediately upstream of said station and said upstream station is an active station, and said upstream station is not the upstream station of any other station, placing said upstream station on said station list, otherwise placing a gap structure on said station list, wherein said gap structure defines an unknown upstream station, and

(c3) repeating steps (c1) through (c2) for each station that has sent neighbor information;

(d) transmitting a request to all stations of said network to request station management information;

(e) receiving station management information data frames from each active station within said network;

(f) building a port connection data structure within a memory of a computer system that receives said data frames, wherein said port connection data structure contains connections between each of said stations of said network; and

(g) displaying said station list and said port connection data structure on a display device connected to said computer system.

2. The method of claim 1 wherein step (f) further comprises the step of:

(f1) constructing said port connection data structure as a plurality of station data structures, one station data structure for each active station on said network, wherein each of said station data structures provides a plurality of port data structures, one port data structure for each connection port within a station, and further constructing connection elements between said port data structures, wherein said connection elements represent physical connections between ports of said stations.

3. The method of claim 1 further comprising the steps of:

(h) establishing a timer having a value entered by a user of said method; and

(i) repeating steps (a) through (h) when a time value in said timer is exceeded.

4. The method of claim 1 wherein step (e) further comprises the step of:

(e1) waiting a predetermined amount of time for said station information management data frames to be received from all active stations on said network before proceeding with step (f).

5. The method of claim 1 wherein step (c2) further comprises the steps of:

(c2a) after inserting a gap structure on said station list, searching the active stations for connected sequences of stations, and inserting these sequences into the station list.

6. The method of claim 1 wherein said network comprises a fiber distributed data interface network.

7. A method for constructing and displaying a map of the logical connections between stations of a token ring type of computer network, said method comprising the steps of:

(a) receiving neighbor information management information data frames from each active station within said network;

(b) defining a data structure for each active station on said network, wherein said data structure identifies the station immediately upstream of a station for which the data structure is defined;

(c) building a station list within a memory of a computer system that receives said data frames, wherein said station list links said stations in an order that each receives a token passed between stations of said network, said building comprising the steps of

(c1) selecting one of said active stations for said station list, wherein said active station has not been previously selected,

(c2) if said active station selected in step (c1) has identified an upstream station immediately upstream of said station and said upstream station is an active station, and said upstream station is not the upstream station of any other station, placing said upstream station on said station list, otherwise placing a gap structure on said station list, wherein said gap structure defines an unknown upstream station, and

(c3) repeating steps (c1) through (c2) for each station that has sent neighbor information; and

(d) displaying said station list on a display device connected to said computer system.

8. The method of claim 7 wherein step (c2) further comprises the steps of:

(c2a) after inserting a gap structure on said station list, searching the active stations for connected sequences of stations, and inserting these sequences into the station list.

9. The method of claim 7 wherein said network comprises a fiber distributed data interface network.