Skip to main content

Multirate Multicast Switching Networks

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Included in the following conference series:

  • 356 Accesses

Abstract

This paper investigates multirate multicast Clos switching network which is nonblocking in a wide sense, where a compatible multicast request is guaranteed to be routed without disturbing the existing network if all requests have conformed to a given routing scheme. The routing strategy discovers (2.875n − 1) min (k + r 1/k) + 1 middle switches sufficient for any multirate multicast requests, whereas strictly nonblocking multirate switching networks requires infinite number of middle switches if the range of weights can be widely distributed.

This paper also shows that Yang and Masson’s nonblocking multicast Clos network for pure circuit switching is rearrangeable for multirate multicast communication if each weight is chosen from a given finite set of integer multiplicity. Note that a general rearrangeability of multirate Clos network even for point-to-point communications has not been known yet. In our work, the number of middle switches only depends on the configuration of the switch itself but not on the patterns of connection requests, which is critically advisable to construct large scale switching networks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.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. V. E. Benes. Mathematical Theory of Connecting Networks and Telephone Traffice. Academic Press, New York, 1965.

    MATH  Google Scholar 

  2. Shun-Ping Chung and Keith W. Ross. On nonblocking multirate interconnection networks. SIAM J. on Comp., 20(4):726–726, August 1991.

    Article  MathSciNet  Google Scholar 

  3. C. Clos. A study of non-blocking switching networks. Bell Syst. Tech. J., 32:406–424, March 1953.

    Article  Google Scholar 

  4. Biao Gao and Frank K. Hwang. Wide-sense nonblocking for multirate 3-stage Clos networks. to appear in Theoretical Computer Science.

    Google Scholar 

  5. F. K. Hwang. Rearrangeability of multiconnection three-stage networks. Networks, 2:301–306, 1972.

    Article  MathSciNet  Google Scholar 

  6. Riccardo Melen and Jonathan S. Turner. Nonblocking multirate networks. SIAM J. on Comp., 18(2):301–313, April 1989.

    Article  MathSciNet  Google Scholar 

  7. I. Svinnset. Nonblocking ATM switching networks. IEEE Trans. on Comm., 42(2–4):1352–1358, Feb.–Apr. 1994.

    Article  Google Scholar 

  8. Yuanyuan Yang. An analysis model on nonblocking multirate broadcast networks. In International Conference on Supercomputing, pages 256–263, 1994.

    Google Scholar 

  9. Yuanyuan Yang and Gerald M. Masson. Nonblocking broadcast switching networks. IEEE Trans. on Comp., 40(9):1005–1015, September 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, D.S., Du, DZ. (1998). Multirate Multicast Switching Networks. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64824-6

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics