Multiple path trees and lan segments for routing in a network of

Details Multiple path trees and lan segments for routing in a network of Multiple path trees and lan segments for routing in a network of

1995-01-13

1996-10-29

Lim, Krisna

Multiplex communications

Wide area network

Packet switching

370 8513, 364DIG1, H04J 324

Patent

active

055704662

ABSTRACT:
For routing of frames through a system of bridge-connected network segments, a routing table is stored in each bridge, and each frame includes fields for a source segment identifier and a destination segment identifier. The routing tables reflect predetermined paths to each network segment as destination. For routing of a normal transmission frame, only the destination segment identifier included in the frame and a table look-up in each bridge are required. For deriving unknown routing information, a discovery frame is sent from source to destination terminal, initially including empty source and destination segment fields. Using the stored routing tables, bridges insert segment identifiers and forward discovery frames in such a way that only one arrives at the destination, carrying the correct source segment identifier and destination segment identifier which are then returned to the source terminal.

REFERENCES:
patent: 4423414 (1983-12-01), Bryant et al.
patent: 4706080 (1987-11-01), Sincoske
patent: 4740954 (1988-04-01), Cotton et al.
patent: 4922503 (1990-05-01), Leone
patent: 4947390 (1990-08-01), Sheehy
patent: 5018133 (1991-05-01), Tsukakoshi et al.
patent: 5088090 (1992-02-01), Yacoby
patent: 5103444 (1992-04-01), Leung et al.
"Comparinson of two Bridge Routing Approaches", Zhang IEEE Jan 1988, vol. 2, No. 1, p. 44-48.
"Lan Interconnection: A Transparent, Shortest Path Approach" Tai et al, IEEE 1991, pp. 1666-70.
"Brouter: The transparent Bridge with Shortest Path in Interconnected Lans," Lin et al, IEEE 1991, pp. 175-181.
"Load Sharing and Shortest Path Routing in Transparently. . . " Faiman, IEEE 1991, pp. 1135-1144.
"An End to a Bridging Feud", Data Communications International, May, 1990, No. 6, pp. 33-34.

Affiliated with

Also associated with

Rating

Multiple path trees and lan segments for routing in a network of does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multiple path trees and lan segments for routing in a network of, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple path trees and lan segments for routing in a network of will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1791775