Skip to main content

Analysis of the Spanning Tree and Source Routing LAN Interconnection Schemes

  • Chapter
Local Area Network Interconnection

Abstract

The paper presents an analysis of the performances of local area networks interconnected according to the Spanning Tree and Source Routing techniques proposed in the framework of the IEEE 802 committee. The study is mainly based on simulation models; some approximated analytical results are also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. IEEE Project 802 - Local and Metropolitan Area Network Standards, IEEE Standard 802.3: Carrier Sense Multiple. Access with Collision Detection., New York: IEEE, 1985.

    Google Scholar 

  2. B. Hawe, A. Kirby and B. Steward. “Transparent Interconnection of Local Networks with Bridges,” Advances in Local Area. Networks., K. Kummerle, J.O. Limb and F. Tobagi (Eds.), New York: IEEE Press, pp. 482–495, 1987.

    Google Scholar 

  3. Special issue on internetworking, IEEE Network., Vol. 2, n. 1, Jan. 1988.

    Google Scholar 

  4. R. Perlman, “An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN,” Proc. 9th Data Communication Symposium., Vancouver, Canada, Sept. 1985.

    Google Scholar 

  5. F. Backes, “Transparent Bridges for Interconnection of IEEE 802 LANs,” IEEE Network., Vol. 2, n. 1, pp. 5–9, Jan. 1988.

    Article  Google Scholar 

  6. Tsung-Yuan Tai and M. Gerla, “LAN Interconnection: A Transparent, Shortest Path Approach,” Proc. IEEE ICC ‘81., Denver, CO, June 1991, pp. 1666–1670.

    Google Scholar 

  7. IEEE Project 802 - Local and Metropolitan Area Network Standards, IEEE Standard 802.1 (D): MAC Bridges.,Sep. 1988.

    Google Scholar 

  8. IEEE Project 802 - Local and Metropolitan Area Network Standards, IEEE Standard 802.5: Token Ring Access Method., New York: IEEE, 1985.

    Google Scholar 

  9. D.A. Pitt and J.L. Winkler, “Table-Free Bridging,” IEEE JSAC., Vol. SAC-5, n. 9, pp. 1454–1462, Dec. 1987.

    Google Scholar 

  10. D.A. Pitt, K.K. Sy and R.A. Donnan, “Source Routing for Bridged Local Area Networks,” Advances in Local Area. Networks., K. Kummerle, J.O. Limb and F. Tobagi (Eds.), New York: IEEE Press, pp. 517–530, 1987.

    Google Scholar 

  11. R.C. Dixon and D.A. Pitt, “Addressing, Bridging, and Source Routing,” IEEE Network., Vol. 2, n. 1, pp. 25–32, Jan. 1988.

    Article  Google Scholar 

  12. IEEE Project 802 - Local and Metropolitan Area Network Standards, Draft Addendum to ANSI/IEEE Standard 802.5–1988: Token Ring MAC & PHY Specification Enhancement for Multiple-Ring Networks., Nov. 1988.

    Google Scholar 

  13. M. Soha and R. Perlman, “Comparison of Two LAN Bridge Approches,” IEEE Network., Vol. 2, n. 1, pp. 37–43, Jan. 1988.

    Article  Google Scholar 

  14. L. Zhang, “Comparison of Two Bridge Routing Approches,” IEEE Network., Vol. 2, n. 1, pp. 44–48, Jan. 1988.

    Article  Google Scholar 

  15. L. Kleinrock, Communication Nets., Dover, New York, 1964.

    Google Scholar 

  16. G.M. Birtwistle, O.-J. Dahl, B. Myhrhaug and K. Nygaard, Simula Begin., Studentlitteratur, Lund, Sweden, 1973.

    Google Scholar 

  17. E.G. Ulrich, “Event Manipulation for Discrete Simulations Requiring Large Numbers of Events,” Communications of the ACM., Vol. 21, n. 9, pp. 777–785, Sep. 1978.

    Article  Google Scholar 

  18. G.S. Fishman, Principles of Discrete Event Simulation.,J. Wiley & Sons, New York, 1978.

    Google Scholar 

  19. M.W. Garret and San-Qi Li, “A Study of Slot Reuse in Dual Bus Multiple Access Networks,” Proceedings INFOCOM 90., San Francisco, CA, June 1990.

    Google Scholar 

  20. F. Baskett, K.M. Chandy, R.R. Muntz and F. Palacios, “Open, Closed and Mized Networks of Queues with Different Classes of Customers,” Journal of the ACM., Vol. 22, n. 2, pp. 248–260, Apr. 1975.

    Article  MathSciNet  MATH  Google Scholar 

  21. S.C. Bruell, G. Balbo and P.V. Afshari, “Mean Value Analysis of Mixed, Multiple Class BCMP Networks with Load Dependent Service Stations,” Performance Evaluation., n. 4 (1984), pp. 241–260.

    Article  MathSciNet  Google Scholar 

  22. S.C. Bruell, G. Balbo and S. Ghanta, “A Mean Value Analysis Based Package for the Solution of Product-Form Queueing Network Models,” International Conference on Modeling Techniques and Tools for Performance Analysis., Paris, France, May 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Munafò, M., Neri, F., Cioffari, C.S., Vasco, A. (1993). Analysis of the Spanning Tree and Source Routing LAN Interconnection Schemes. In: Onvural, R.O., Nilsson, A. (eds) Local Area Network Interconnection. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2950-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2950-7_11

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6282-1

  • Online ISBN: 978-1-4615-2950-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics