Efficient path determination in a routed network

Details Efficient path determination in a routed network Efficient path determination in a routed network

1997-10-30

2000-02-08

Harrell, Robert B.

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Least weight routing

G06F 1300

Patent

active

060237333

ABSTRACT:
The topology of a computer network is represented, for each routing device in the network, as a tree structure with the root of the tree designating the particular routing device. Tree nodes represent LANs, while arcs connecting the nodes represent other routing devices. Thus, the number of first-level links to children off the root is equal to the number of LANs connected to the source routing device, and those first-level links point to nodes representing the LANs (or LAN segments) directly connected to the source routing device. As a result of this representation, each routing device can store a representation of the entire network adequate to facilitate routing, but with much less memory utilization than a list of addresses. Furthermore, because the network is represented at a more general level than that of individual station addresses, changes to the topology of the network can be readily introduced without the need for extensive (e.g., address by address) reconfiguration.

REFERENCES:
patent: 5606669 (1997-02-01), Bertin et al.

Affiliated with

Also associated with

Rating

Efficient path determination in a routed network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient path determination in a routed network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient path determination in a routed network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1688788