An algorithm for distributed computation of a spanningtree in an extended LAN

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.

REFERENCES

• 1: Boggs, Shoch, Taft, and Metcalfe, "PUP: An Internetwork Architecture," IEEE Transactions on Communications, April 1980.
• 2: C. Sunshine , D. Kaufman , G. Ennis , K. Biba, Interconnection of broadband local area networks, Proceedings of the eighth symposium on Data communications, p.25-32, October 03-06, 1983, North Falmouth, Massachusetts, United States
• 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.
• 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, 1984
• 5: Radia Perlman, Incorporation of multiaccess links into a routing protocol, Proceedings of the eighth symposium on Data communications, p.85-94, October 03-06, 1983, North Falmouth, Massachusetts, United States
• 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 1984
• 7: Bill Hawe, Alan Kirby, Bob Stewart, "Transparent Interconnection of Local Networks with Bridges", Journal of Telecommunication Networks, June 1984.
• 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 1984
• 9: Yogen K. Dalal , Robert S. Printis, 48-bit absolute internet and Ethernet host numbers, Proceedings of the seventh symposium on Data communications, p.240-245, October 27-29, 1981, Mexico City, Mexico

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

General Terms:
Algorithms, Design