US 5,421,024 AGrant

Detection of a Relative Location of a Network Device Using a Multicast Packet Processed Only by Hubs

Issue Date:1995-05-30

•2 Claims

•18 Drawing Sheets

Abstract

Within a network, which includes hubs and bridges, the relative location of a first device with respect to a subset of hubs on the network is determined. In response to an instruction, the first device broadcasts a multicast packet. The multicast packet crosses bridges and is processed only by hubs. When a hub receives the multicast packet from the first device, the hub records a first port of the hub over which the second device received the multicast packet. The subset of hubs may then be interrogated to determine over which port of each of the subset of hubs the multicast packet was received.

Metadata

Assignee

Hewlett-Packard Company

Inventors

Robert L. Faulk, Jr.
Chuck A. Black

Application Information

Application Number:US 1141163

Filing Date:1993-08-30

Priority Date:1991-04-30

Art Unit:232

Classifications

IPC:

G06F 1300

Field of Search:

395370200;80085.12;85.13;85.15

Patent Drawings (18 sheets)

Description

Background of the Invention

This invention relates generally to computer networks, and more particularly to different stations in a network interconnected through bridges and hubs.

For simple computer networks such as a LAN (local area network) located on a small office suite on a single floor of a building, it has been relatively simple to determine the actual network layout by inspection. However, networks now include many stations through the use of 12-port and 48-port repeaters called hubs, and different networks are often joined together by bridges so that data packets are sent across different networks to computer devices located in many different buildings and locations. It is not unusual to remove stations from a network and add other stations without telling the network administrator. Accordingly, a need has arisen for automatically collecting detailed accurate information about the layout and topology of computer networks.

Brief Description of the Invention

It is an object of the invention to provide a method for determining the arrival port of message packets received by an interconnect device such as a hub, obtaining from the message packet an identification of the sender, and then storing for easy accesibility a list of each port on the hub and its associated computer device. A related object is to obtain this arrival port information accurately, without acquiring false information based on spurious pulses and without interfering with any management functions which occur at the hub.

Another object of the invention is to provide a method for selectively listening at many different hubs for the arrival of message packets from a particular sender, and for periodically initiating a change to allow selective listening for the arrival of message packets from another particular sender.

Another object of the invention is to provide a method for instigating a particular station to send out an announcement packet to all multiple port repeaters such as hubs, and to bridges, with only minimal processing and distribution, and to enable individual hubs and/or bridges to identify which one of their ports is connected to that particular station.

Another object of the invention is to provide a method of processing the localized port arrival information for individual hubs and bridges in an extended network so as to determine and display the physical topology of the various network segments.

These and other objects will become apparent to those skilled in the art in view of the drawings and related written description of a presently preferred embodiment of the invention as set forth below.

Brief Description of the Drawings

FIG. 1 shows a typical computer network layout having multiport repeaters (hubs) connected directly together as well as interconnected through a bridge;

FIG. 1A shows a typical LAN hub of FIG. 1A having individual devices connected through twisted wire pairs to specific ports on the hub;

FIG. 2A is a schematic representation of the interconnect panel for a 48-port managed hub which incorporates the present invention;

FIG. 2B shows a preferred wiring pattern for interconnecting 8-wire twisted pair cabling with the 48-port managed hub of FIG. 2A;

FIG. 3 shows a LAN layout having 12-port and 48-port managed hubs which incorporates the present invention;

FIG. 4 shows a schematic diagram for the managed hubs of FIG. 3;

FIG. 5 is a timing diagram for a managed hub showing the difficulty of matching the correct port identification with its corresponding packet;

FIG. 6 is a block diagram for a 48-port managed hub featuring a preferred embodiment of the invention;

FIGS. 7A-7C are flow charts for the managed hub of FIG. 6 showing how port arrival identification is achieved for computer network packets received by the managed hub of FIG. 6;

FIG. 8 is an exemplary port arrival matrix for a 12-port managed hub;

FIG. 9 is an exemplary port arrival matrix for a 48-port managed hub;

FIGS. 10A and 10B show two embodiments of a mapping address search flow chart for multiport repeaters such as the 12-port and 48-port hubs of FIG. 3;

FIG. 11 shows the mapping address objects for the hubs of FIG. 3 which are programmed to listen for packets originating from a network device identified by its address X;

FIG. 12A shows a computer network layout having at least one differently designed hub, with a managed hub and a managed bridge both incorporating the present invention;

FIG. 12B shows how the network topology of FIG. 12A appears to the mapping application;

FIG. 13 shows a typical packet format for extended network mapping announcements sent to devices in an Ethernet-type of computer network;

FIG. 14 is a flow chart for determining the physical topology across repeaters and bridges in an extended computer network;

FIG. 15A is a schematic diagram of an extended network having two LANs;

FIGS. 15B and 15C are exemplary tree diagrams used to implement the flow chart of FIG. 14 with respect to the extended network of FIG. 15A; and

FIG. 16 is a network topology map display that is produced by the flow chart of FIG. 14.

FIG. 17 shows a network topology used to illustrate the present invention.

FIG. 18 shows a network topology used ti illustrated the present invention.

Detailed Description of Preferred Embodiments and Best Mode

Generally speaking, the invention can be implemented in computer networks of various types and configurations, and the particular layouts shown are for purposes of illustration only. In that regard, the network layout of FIG. 1A shows how certain ports 20, 22 of their respective hubs 24, 26 receive packets from multiple senders. In contrast, other ports such as 28, 30 receive packets from one and only one sender (unless there is a configuration change made replacing one device with another or replacing one device with a multiport device such as a hub or bridge). Figure 1B shows a hub with a 12-port modular adapter 32 for connecting individual ports to network devices through twisted-pair cable also known as the IEEE 802.3 10 BaseT standard.

FIG. 2A shows the back interconnect panel for a 48-port hub having in addition an AUI port 34 and a BNC (coax) port 36. The manner of hooking up the four pair twisted wire cable to each port such as 38 is shown in FIG. 2B.

In a hub such as shown in FIG. 2A, it is useful to monitor the traffic on each port and keep track of the station address of the node connected to each port, as well as keep track of other detailed information about the traffic on that port. In some implementations of a hub, an off-the-shelf network interface controller (NIC) chip 40 is used for network management functionality and this controller chip is not integrated with the rest of the repeater hardware of the hub. The repeater 42 may tell the firmware 44 the port number of each packet repeated using a special circuit. Essentially such a hub may be structured as shown in the schematic diagram of FIG. 4.

If the NIC chip 40 is run in promiscuous mode (a mode in which it listens to all packets, instead of only those addressed to it), it is possible to correlate the packets received by the NIC with the port numbers for the repeater to obtain detailed per-port network statistics. This correlation can be accomplished by the routine set forth in the following table:

If the network monitoring is overloading the hub and starts to degrade the response time to requests from a network management application, the hub will temporarily exit promiscuous mode and listen only to the network management packets addressed to it.

The method for correlating the port number with packets received by the NIC is complicated by several factors. For example, it is necessary for the firmware to respond to packet interrupts quickly--otherwise it will be overrun with packets and/or port numbers. Interrupts can be disabled at different times while the firmware is performing other network management related tasks. Further impairing interrupt response time is the relatively low-performance microcontroller which is used to reduce costs.

As an additional example, sometimes the repeater will hear small runt packets which are not heard by the NIC. In other words, there is not always a one-to-one correspondence between packets heard by the NIC and port numbers from the repeater.

Another situation arises with small back-to-back packets and is most common when these packet bursts arrive when interrupts happen to be temporarily disabled. The NIC interrupt occurs slightly after the port number is indicated by the repeater. In the diagram of FIG. 5, the network activity line is high when there is network activity. The NIC Interrupt Service Routine (ISR) line is high when executing the MIC Interrupt Service Routine. In the diagram of FIG. 5, the portion 44 indicates port activity for packet Rx1 and the corresponding portion 46 indicates the dma of the same packet RX1 by the NIC.

At point A in FIG. 5, the port for packet Rx1 is not known since the ISR observed two port numbers from the repeater (i.e., the ISR does not know if the extra port number is for a packet or if it is from a tiny runt heard by the repeater but not by the NIC). At point B, the ISR sees exactly one port number and would normally mis-identify the port of packet Rx2 as the port of packet Rx3. The routine of Table I solves this problem.

FIG. 6 shows a presently preferred embodiment for the invention in a managed hub implementation. A bus is used to interconnect the network management microprocessor, an EEPROM for code storage, a RAM, a network interface controller, and port number registers. The RAM includes space for normal data and packet storage, as well as space for implementing various features of the invention. The port arrival matrix of FIG. 9 is stored at one portion, the mapping address search objects of Table II are stored in another portion, and a third portion is used for the NIC packet receive buffers.

LAN traffic comes into a 50 port repeater causing an entry into a port number register having sufficient bits to identify all the input ports, and also causing an activity indication to the network management microprocessor. If in promiscuous mode (see the flow chart of FIGS. 7A, 7B and 7C), then the NIC receives and monitors all incoming packets. Otherwise only the packets addressed to the hub are processed and the other packets are merely resent. The mapping address search objects are used in both hub and bridge implementations (see the flow charts of FIGS. 10A and 10B which depict the map address procedure purely from the device's point of view. Note the differences between the hub (FIG. 10A) and the bridge (FIG. 10B) implementations. The Map Address Objects themselves are shown in the following table:

The various mapping address objects are shown in FIG. 11 wherein each of the devices Q, T and X are programmed to listen for packets coming from the device having an S address.

To solve this problem, the Map Address object has been created. The mapping application simply sets the Map Address on a hub and the hub will listen for packets transmitted by the device specified by Map Address. When the Map Address is heard, the hub will record the port number on which the Map Address is heard and the mapping application will use this information to lay out the network map.

In the network specified in FIG. 17, Hub 2 does not know which LAN segment Hub 1 is attached to, since many nodes are probably on each LAN segment. The mapping application can set the Map Address object on Hub 2 to the address of Hub 1. Later, when Hub 1 transmits a packet, Hub 2 will hear it and identify the port on which Hub 1 is connected.

To map a network of hubs, a mapping application needs to know which devices are connected to each of the hubs ports. The mapping application is able to poll the network and find out the addresses of each hub, but to make a complete map, it must know the ports on which each hub is connected. Some ports may be connected to hundreds of nodes and it is not feasible for each hub to keep a list of node addresses for each port. The Map Address object previously discussed solves much of this problem, but in FIG. 18 above, there is a problem with basic use of the Map Address object in that Hub 1 will never hear packets from Hub 2, since all communication between Hub 2 and the mapping application is filtered by the bridge.

The mapping application could look in the address table maintained by the bridge to find out how the hubs are connected, but this does not always work, since not all bridges have an address table which is readable by the mapping application. Also, using information gathered from the hubs is much simpler than incorporating the address table information gathered from bridges. To enable Hub 1 to hear packets from Hub 2 and identify the port on which it is connected the mapping application must make Hub 2 transmit some sort of announcement packet which can be heard by Hub 1. To do this, there are several alternatives:

A) Have Hub 2 broadcast a packet which goes across the entire network. This alternative will accomplish the mapping objective, but almost every single node on the entire network will need to process the packet and this will cause a significant amount of useless broadcast traffic which does not need to be heard by all nodes.

B) Have Hub 2 transmit a packet addressed directly to Hub 1 This alternative will also accomplish the mapping objective, but on a large network, the mapping application would need to tell the hub to transmit a packet to every other hub on the network, adding a significant amount of overhead to the mapping process.

C) Have Hub 2 transmit a multicast packet heard only by hubs This is the ideal alternative, because the packet will go through the bridge and it will only heard by other hubs which listen for that multicast address. This is the method by which hub network mapping is done.

This invention solves the problem of determining the physical topology (that is, the interconnection of lan segments and interconnecting network devices) of a network. This is done automatically and produces a representation of the network which can be used for fault detection and diagnosis, performance characterization, and security.

Without the automatic determination of the physical topology of the network, the burden of mapping out the topology is on the human manager of the network, and is thus highly prone to error.

This invention uses mapping information available from repeaters and bridges to build a representation of the network. These repeaters and bridges are hereafter referred to as "networking devices". A networking devices connects two or more physical networking segments (coax, broadband, twisted-pair, fiber, etc) through its ports.

A networking device will have two or more ports. Through these ports, the device "hears" others devices and end stations (e.g. personal computers) which are part of the network. A networking device hears other devices and end stations out of one and only one port.

For the following description, assume the following network: ##STR1##

The algorithm first discovers the existence of bridges and repeaters in the network, resulting in a list of these networking devices:

The algorithm then selects a device arbitrarily from the list (although a simple heuristic could easily be applied to choose a device which would enhance the performance of the algorithm). From that device, the process of determining network topology begins. This is accomplished by determining where all of the other devices in the network are with respect to that device, by hearing out of which port that device is located.

For example, if device d2 is connected to a lan cable which is connected to d1's port 1, then d1 hears d2 on port 1.

The resulting network after this first step(from the point of view of arbitrarily chosen device d1) may look as follows. ##STR2##

After this step is accomplished, it is possible to recursively visit each of the resulting "nodes" of this tree, and to eliminate those devices which are not actually directly connected to the calling device. In the above example, we would descend from d1 down to the node which contains d4,d5,d6. The goal here would be to eliminate those devices which are not directly connected to d1.

Looking at the original diagram, one can see that only d4 is directly connected to d1; d5 and d6 are connected to d1 through device d4. Algorithmically, the procedure for eliminating d5 and d6 is as follows;

First, select a device (for this example, we choose d4) and determine the port on which the calling device (d1) is heard. Then, try to eliminate the other nodes by showing that they are heard on a different port than the port on which the calling device is heard.

In the example, and choosing d4 as the "eliminator", if d4 hears d1 on port 1, and then hears d5 on port 2, then d5 is eliminated, because we have proven that d4 stands between d1 and d5 in the topology.

Applying this process recursively, the resulting hierarchy is a representation of the physical topology of the network. In the example, the resulting hierarchy would look as follows: ##STR3##

This representation of the network can then be used to draw a map of the network which looks like the original picture.

The value of automatically deriving the topology, versus manual attempts, can be easily seen.

FIG. 13 shows a typical frame format which has the source address and destination address which are used in practicing this invention. Most packets are about 64 bytes long. FIG. 12 makes it clear that a non-managed hub or a managed hub that is of a different design will not be recognized as a true hub (see FIG. 12B).

FIG. 16 shows a network layout different from the other layouts in the drawings, and indicates the ability to draw a topology based on the information automatically acquired by practicing the unique procedures of the invention. The numbers indicate the Internet Protocol addresses, and H12 is a 12 port hub, H48 is a 48 port hub, HF is a fiber hub and BRM is a remote bridge which B10 is a local 10 MB bridge.

Of course, the invention is not limited to the examples shown, but can be modified and varied, all within the scope of the following claims.

Claims

We claim:

1. Within a network which includes hubs for connecting network stations within local networks and bridges for providing connection between local networks, a method comprising the step of: (a) detecting, by a mapping application within a first network station, a relative location of a first hub with respect to a subset of hubs and bridges on the network, the first network station being included in the network, including the substeps of, (a.1) instructing, by the mapping application within the first network station, each hub and bridge within the subset of hubs and bridges to listen for multicast packets from the first hub, (a.2) instructing, by the mapping application within the first network station, the first hub to broadcast a multicast packet, the multicast packet crossing bridges and being processed only by hubs and bridges, (a.3) when one of the subset of hubs and bridges receives the multicast packet from the first hub, recording, by the one of the subset of hubs and bridges, a first port over which the multicast packet was received, and (a.4) interrogating, by the mapping application within the first network station, the subset of hubs and bridges to determine over which port of each of the subset of hubs and bridges the multicast packet was received.

2. A network comprising: a plurality of interconnected hubs and bridges, the hubs connecting network stations within local networks and the bridges providing connection between local networks, each hub and bridge including means for detecting over what port a packet is received, and recording means for, when a multicast packet is received, recording a first port over which the multicast packet is received; and, a first network station having a mapping application, the mapping application determining relative location of a first hub with respect to a subset of hubs and bridges on the network, the mapping application including means for directing the subset of hubs and bridges to listen for a multicast message from the first hub, means for instructing the first hub to broadcast a multicast packet, wherein the multicast packet is processed only by hubs and the multicast packet goes through the bridges, and interrogating means for interrogating the subset of hubs and bridges to determine over which port of each of the subset of hubs and bridges the multicast packet was received.

Patent Citations (20)

Patent	Date	Inventor
US4641378	1987-02-01	McConnell et al.
US4724520	1988-02-01	Athanas et al.
US4726644	1988-02-01	Mathis
US4809362	1989-02-01	Claus et al.
US4825206	1989-04-01	Brice, Jr. et al.
US4901312	1990-02-01	Hui et al.
US4939724	1990-07-01	Ebersole
US5005167	1991-04-01	Arthurs et al.
US5018137	1991-05-01	Backes et al.
US5041963	1991-08-01	Ebersole et al.
US5048014	1991-09-01	Fischer
US5058108	1991-10-01	Mann et al.
US5079767	1992-01-01	Perlman
US5084870	1992-01-01	Hutchinson et al.
US5088032	1992-02-01	Bosack
US5150464	1992-09-01	Sidhu et al.
US5179554	1993-01-01	Lomicka et al.
US5226120	1993-07-01	Brown et al.
US5276789	1994-01-01	Besaw et al.
US5293635	1994-03-01	Faulk, Jr. et al.

Abstract

Description