Radia Perlman
Abstract
A protocol and algorithm are given in which bridges in an extended Local Area Network of arbitrary topology compute, in a distributed fashion, an acyclic spanning subset of the network.
The algorithm converges in time proportional to the diameter of the extended LAN, and requires a very small amount of memory per bridge, and communications bandwidth per LAN, independent of the total number of bridges or the total number of links in the network.
Algorhyme
I think that I shall never see A graph more lovely than a tree.
A tree whose crucial property Is loop-free connectivity.
A tree which must be sure to span So packets can reach every LAN.
First the Root must be selected By ID it is elected.
Least cost paths from Root are traced. In the tree these paths are placed.
A mesh is made by folks like me Then bridges find a spanning tree.
- 1 Boggs, Shoch, Taft, and Metcalfe, "PUP: An Internetwork Architecture," IEEE Transactions on Communications, April 1980.Google Scholar
- 2 C. Sunshine, D. Kaufman, G. Ennis, and K. Biba, "Interconnection of Broadband Local Area Networks", Eighth Data Communications Symposium, Massachusetts, 1983. Google ScholarDigital Library
- 3 Norman Strole, "A Local Communications Network Based on Interconnected Token-Access Rings: A Tutorial" iBM J Res Develop, Vol 27, No 5, Sept., 1983.Google Scholar
- 4 Kian-Bon Sy, Daniel A. Pitt, Robert A. Donnan, "An Architecture for interconnecting LAN Segments", IBM Corporation Technical submission to IEEE 802 LAN standards committee, July 13, 1984Google Scholar
- 5 Radia Perlman, "Incorporation of Multiaccess Links Into a Routing Protocol" Eighth Data Communications Symposium, Massachusetts, 1983. Google ScholarDigital Library
- 6 Bill Hawe, Alan Kirby, Anthony Lauck, "An Architecture for Transparently Interconnecting IEEE 802 Local Area Networks" Paper presented at the IEEE 802 meeting in San Diego, CA on October 1984Google Scholar
- 7 Bill Hawe, Alan Kirby, Bob Stewart, "Transparent Interconnection of Local Networks with Bridges", Journal of Telecommunication Networks, June 1984.Google Scholar
- 8 George Varghese and Bill Hawe, "Extended Local Area Network Management Principles," Paper presented at the IEEE 802 meeting in San Diego, CA on October 1984Google Scholar
- 9 Yogen Dalal and Robert Printis, "48-bit Absolute Internet and Ethernet Host Numbers" Seventh Data Communications Symposium, 1981. Google ScholarDigital Library
Index Terms
- An algorithm for distributed computation of a spanningtree in an extended LAN
Recommendations
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85: Proceedings of the ninth symposium on Data communicationsA protocol and algorithm are given in which bridges in an extended Local Area Network of arbitrary topology compute, in a distributed fashion, an acyclic spanning subset of the network.
The algorithm converges in time proportional to the diameter of the ...
Hot-spot spanning tree algorithm for a bridged LAN/MAN
A bridged local area network (BLAN) is an internetwork where a lot of LANs and MANs are interconnected via bridges. The active spanning tree topology of a BLAN is to ensure that one and only one active routing path exists between each pair of end ...
Distributed Fair Scheduling in a Wireless LAN
Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows sharing the channel. This paper presents a fully distributed algorithm for ...
Comments