Load sharing and shortest-path routing in transparently interconnected local area networks
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1135-1144 vol.3
- https://doi.org/10.1109/infcom.1991.147631
Abstract
A new transparent bridging scheme, called the source dependent spanning tree (SDS), is presented in which bridges observe broadcast packets from active hosts to create the shortest path trees for these hosts dynamically. Issues related to packet forwarding in the presence of multiple trees are identified and algorithms for addressing these issues are presented. Some important properties of SDS, such as correctness, are described, and it is compared with previously proposed schemes. Under standard traffic assumptions, it is shown that SDS can achieve load sharing and shortest-path routing without incurring excessive storage and communication overheads.Keywords
This publication has 6 references indexed in Scilit:
- Load sharing and shortest-path routing in transparently interconnected local area networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Extended bridge algorithms for large networksIEEE Network, 1988
- Transparent bridges for interconnection of IEEE 802 LANsIEEE Network, 1988
- Extending the IEEE 802.1 MAC Bridge standard to remote bridgesIEEE Network, 1988
- An algorithm for distributed computation of a spanningtree in an extended LANPublished by Association for Computing Machinery (ACM) ,1985
- Construction of centered shortest‐path trees in networksNetworks, 1983