Brouter: the transparent bridge with shortest path in interconnected LANs

Transparency is a popular feature in a distributed system where users can access any local or remote resources just as if they were local. The paper proposes a protocol which combines the features of transparency and shortest path. The result is a bridge which supports self learning and distributed routing computation. Since this bridge has all routing facilities as a router, it is called brouter (i.e. bridge+router). Brouters are compared with current bridge schemes. Also, performance aspects of the protocol are examined.<<ETX>>

[1]  Carl A. Sunshine,et al.  Source routing in computer networks , 1977, CCRV.

[2]  W.M. Seifert Bridges and routers , 1988, IEEE Network.

[3]  C. Cheng,et al.  A protocol to maintain a minimum spanning tree in a dynamic topology , 1988, SIGCOMM.

[4]  J. W. Wong,et al.  Evaluation of a Path-Finding Algorithm for Interconnected Local Area Networks , 1987, IEEE J. Sel. Areas Commun..

[5]  J. Lamont,et al.  LAN interconnection via frame relaying , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

[7]  Radia Perlman,et al.  An algorithm for distributed computation of a spanningtree in an extended LAN , 1985, SIGCOMM '85.