Abstract
Multicast is one of the most dense communication patterns. Any destination node of a k-fold multicast network can be involved in up to k simultaneous multicast connection. The hardware cost of traditional k-fold switching network for wide-sense nonblocking multicast is typically very high. In this paper, we propose a new wide-sense nonblocking k-fold multicast network and multicast routing algorithm. The k-fold design has significantly lower network cost than that of k copies of 1-fold multicast networks. The time complexity of the corresponding routing algorithm is no higher than that of previous works.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Zhang, Z., Yang, Y.: Performance analysis of k-fold multicast networks. IEEE Trans. Commun. 53(2), 308–314 (2005)
Hwang, F.K., Wang, Y., Tan, J.: Strictly nonblocking f-cast networks \( \log_{d} \left( {N,m,p} \right) \). IEEE Trans. Commun. 55(5), 981–986 (2007)
Jiang, X., Pattavina, A., Horiguchi, S.: Strictly nonblocking design of f-cast photonic multi-log2N networks with crosstalk constraints. In: IEEE Workshop High Performance Switching Routing, pp. 1–6, May 2007
Yan, F., et al.: Nonblocking four-stage multicast network for multicast capable optical cross connects. J. Lightwave Technol. 27(17), 3923–3932 (2009)
Ye, T., Lee, T.T., Hu, W.: AWG-based non-blocking Clos networks. IEEE/ACM Trans. Netw. 23(2), 491–504 (2015)
Ge, M., Ye, T., et al.: Multicast routing and wavelength assignment in AWG-based Clos networks. IEEE/ACM Trans. Netw. 99, 1–18 (2017)
Wan, Y.: Nonblocking multicast Clos networks. In: 19th Annual Wireless and Optical Communications Conference, pp. 1–5, May 2010
Clos, C.: A study of non-blocking switch networks. Bell Syst. Tech. J. 32(2), 406–424 (1953)
Benes, V.E.: On rearrangement three-stage connecting networks. Bell Syst. Tech. J. 41(5), 1481–1492 (1962)
Yang, Y., Wang, J.: Wide-sense no blocking Clos networks under packing strategy. IEEE Trans. Computers 48(3), 265–284 (1999)
Masson, G.M., Jordan, B.W.: Generalized multi-stage connection networks. Networks 2, 191–209 (1972)
Hwang, F.K.: The Mathematical Theory of Nonblocking Switching Networks, pp. 99–108. World Scientific, Singapore (2004)
Yang, Y., Masson, G.M.: The necessary condition for Clos-type nonblocking multicast networks. IEEE Trans. Comput. 48, 1214–1227 (1999)
Yang, Y., Masson, G.M.: No blocking broadcast switching networks. IEEE Trans. Comput. 40(9), 1005–1015 (1991)
Yang, Y., Wang, J.: Nonblocking k-fold multicast networks. IEEE Trans. Parallel Distrib. Syst. 14(2), 131–141 (2003)
Yang, Y., Wang, J.: A new design for wide-sense nonblocking multicast switching networks. IEEE Trans. Commun. 53(3), 497–504 (2005)
Wang, J., Yang, Y.: Four-stage multicast switching networks: nonblocking conditions and cost analysis. J. Lightwave Technol. 30(3), 290–297 (2012)
Hasan, M.M.: Fine-tuning of k in a K-fold multicast network with finite queue using markovian model. Int. J. Comput. Netw. Commun. 5(2), 195–204 (2013)
Acknowledgement
The research was jointly supported by project grant from Shenzhen Sci.&Tech.Foundation: JCYJ20150930105133185/JCYJ20150324140036842, and National Natural
Science Foundation of China: NSF/GDU1301252.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd
About this paper
Cite this paper
Liu, G., Luo, Q., Ye, C., Mao, R. (2017). A Cost-Effective Wide-Sense Nonblocking k-Fold Multicast Network. In: Chen, G., Shen, H., Chen, M. (eds) Parallel Architecture, Algorithm and Programming. PAAP 2017. Communications in Computer and Information Science, vol 729. Springer, Singapore. https://doi.org/10.1007/978-981-10-6442-5_27
Download citation
DOI: https://doi.org/10.1007/978-981-10-6442-5_27
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6441-8
Online ISBN: 978-981-10-6442-5
eBook Packages: Computer ScienceComputer Science (R0)