An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Interconnection of broadband local area networks
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Incorporation of multiaccess links into a routing protocol
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Vulnerabilities of network control protocols: an example
ACM SIGCOMM Computer Communication Review
Computer
The metrobridge: a backbone network distributed switch
ACM SIGCOMM Computer Communication Review
End-to-end routing behavior in the Internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
End-to-end routing behavior in the internet
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
The bridge algorithm adopted by the IEEE 802.1 committee for interconnecting 802 LANs requires the topology of the Extended LAN to be a Spanning Tree. A distributed algorithm to compute a spanning tree dynamically has already been published [1], and adopted by the IEEE 802.1 committee [2]. In this paper, however, we describe an alternative distributed algorithm to compute a spanning tree. This algorithm, variants of which have been implemented, initially appears simpler than the IEEE 802.1 algorithm; we show, however, that it has subtle failure modes that makes it unattractive in practice.We also show that some failure modes of the Spanning Tree Algorithm introduced in this paper are characteristic of a broader class of distributed graph algorithms. Such algorithms potentially examine all possible path combinations between a source and destination in a graph. Thus, they suffer from exponential message overhead in topologies that have an exponential number of paths between source and destination. Attempts to fix this problem lead to extra complexity (in terms of CPU, bandwidth, memory) when compared to other algorithms. We briefly describe a second example belonging to this class, and propose that designers avoid such algorithms if restricting the topology or scale of the network is unacceptable.