Up-tree topology trace for network route tracing

Details Up-tree topology trace for network route tracing Up-tree topology trace for network route tracing

1998-12-21

2004-03-09

Ton, Dang (Department: 2661)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S256000, C709S252000

Reexamination Certificate

active

06704319

ABSTRACT:

FIELD OF THE INVENTION
The present invention is related to computer networks, and more particularly to network route tracing.
BACKGROUND INFORMATION
A computer network consists of communications links that interconnect various components. A communications link is a communications channel or transmission medium. Components of the network include computers (also called hosts) and devices such as routers, hubs, switches, and the like which connect network segments and forward data transmissions.
Bandwidth refers to the amount of data that can be sent through the network. Bandwidth is usually measured in bits per second (bps). A computer network has a finite amount of bandwidth and thus the amount of data being sent through the network depends on the amount of available bandwidth. If computers on a network attempt transmissions requiring too much bandwidth, the network may fail to support one or more of the computers.
To address this problem, previous systems either have allocated bandwidth for the entire network generally, or previous systems have added additional logic for managing bandwidth to the individual components on the network. However, these approaches have disadvantages. Systems that allocate bandwidth for the entire network fail to consider how that bandwidth will be used over individual links of the network. Adding additional logic for managing bandwidth to the individual components on the network requires additional hardware in each component of the network.
For these and other reasons, there is a need for the present invention.
SUMMARY OF THE INVENTION
According to one embodiment of the present invention, a route is traced between two hosts in a network. The network is represented as a logical tree having a plurality of nodes. Each one of the nodes corresponds to a component in the network and each non-root node has a parent node. Two nodes are identified in the logical tree. A first node corresponds to a first host and a second node corresponds to a second host. If one of the two nodes exists at a lower level of the logical tree, then a first path is traced from the first node at the lower level to the parent node at a higher level until the parent node is at a same level of the logical tree as the second node. The first path is further traced up the logical tree from the parent node and a second path is traced up the logical tree from the second node until the first path and the second path meet at a same node.


REFERENCES:
patent: 4464650 (1984-08-01), Eastman et al.
patent: 4987536 (1991-01-01), Humblet
patent: 5428636 (1995-06-01), Meier
patent: 5742760 (1998-04-01), Picazo, Jr. et al.
patent: 5790858 (1998-08-01), Vogel
patent: 5872773 (1999-02-01), Katzela et al.
patent: 5926463 (1999-07-01), Ahearn et al.
patent: 6094682 (2000-07-01), Nagasawa
patent: 6101550 (2000-08-01), Zucker
patent: 6167438 (2000-12-01), Yates et al.
patent: 6229791 (2001-05-01), Nusekabel et al.
patent: 6538997 (2003-03-01), Wang et al.

Affiliated with

Also associated with

Rating

Up-tree topology trace for network route tracing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Up-tree topology trace for network route tracing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Up-tree topology trace for network route tracing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3292219