Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2018, Article ID 7563170, 12 pages
https://doi.org/10.1155/2018/7563170
Research Article

Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks

College of Electronic and Information Engineering, Southwest University, Chongqing 400715, China

Correspondence should be addressed to Songtao Guo; nc.ude.uqc@oatgnosoug

Received 23 May 2017; Accepted 8 November 2017; Published 11 January 2018

Academic Editor: Dimitri Volchenkov

Copyright © 2018 Guozhi Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Duan and Y. Yang, “Placement and Performance Analysis of Virtual Multicast Networks in Fat-Tree Data Center Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 10, pp. 3013–3028, 2016. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Communications of the ACM, vol. 51, no. 1, pp. 107–113, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Ghemawat, H. Gobioff, and S. Leung, “The google file system,” Acm Sigops Operating Systems Review, vol. 37, no. 5, pp. 29–43, 2003. View at Google Scholar · View at Scopus
  4. O. Fatmi and D. Pan, “Distributed multipath routing for data center networks based on stochastic traffic modeling,” in Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control, ICNSC 2014, pp. 536–541, USA, April 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. Z. Guo, On The Design of High Performance Data Center Networks, Dissertations and Theses - Gradworks, 2014.
  6. H. Yu, S. Ruepp, and M. S. Berger, “Out-of-sequence prevention for multicast input-queuing space-memory-memory clos-network,” IEEE Communications Letters, vol. 15, no. 7, pp. 761–765, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. G. Li, S. Guo, G. Liu, and Y. Yang, “Multicast Scheduling with Markov Chains in Fat-Tree Data Center Networks,” in Proceedings of the 2017 International Conference on Networking, Architecture, and Storage (NAS), pp. 1–7, Shenzhen, China, August 2017. View at Publisher · View at Google Scholar
  8. X. Geng, A. Luo, Z. Sun, and Y. Cheng, “Markov chains based dynamic bandwidth allocation in diffserv network,” IEEE Communications Letters, vol. 16, no. 10, pp. 1711–1714, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Sun, S. Boyd, L. Xiao, and P. Diaconis, “The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem,” SIAM Review, vol. 48, no. 4, pp. 681–699, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. T. G. Hallam, “David G. Luenberger: Introduction to Dynamic Systems, Theory, Models, and Applications. New York: John Wiley & Sons, 1979, 446 pp,” Behavioural Science, vol. 26, no. 4, pp. 397-398, 1981. View at Publisher · View at Google Scholar
  11. K. Hirata and M. Yamamoto, “Data center traffic engineering using Markov approximation,” in Proceedings of the 2017 International Conference on Information Networking (ICOIN), pp. 173–178, Da Nang, Vietnam, January 2017. View at Publisher · View at Google Scholar
  12. D. Li, M. Xu, M.-C. Zhao, C. Guo, Y. Zhang, and M.-Y. Wu, “RDCM: Reliable data center multicast,” in Proceedings of the IEEE INFOCOM 2011, pp. 56–60, China, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Li, H. Cui, Y. Hu, Y. Xia, and X. Wang, “Scalable data center multicast using multi-class bloom filter,” in Proceedings of the 2011 19th IEEE International Conference on Network Protocols, ICNP 2011, pp. 266–275, Canada, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. P. J. Cameron, “Notes on counting: An introduction to enumerative combinatorics,” Urology, vol. 65, no. 5, pp. 898–904, 2012. View at Google Scholar · View at MathSciNet
  15. R. Pastor-Satorras, M. Rubi, and A. Diaz-Guilera, “Statistical mechanics of complex networks,” Review of Modern Physics, vol. 26, no. 1, 2002. View at Google Scholar · View at MathSciNet
  16. A. P. Pynko, “Characterizing Belnap's logic via De Morgan's laws,” Mathematical Logic Quarterly, vol. 41, no. 4, pp. 442–454, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. T. Benson, A. Anand, A. Akella, and M. Zhang, “Understanding data center traffic characteristics,” in Proceedings of the 1st Workshop: Research on Enterprise Networking, WREN 2009, Co-located with the 2009 SIGCOMM Conference, SIGCOMM'09, pp. 65–72, Spain, August 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. C. Fraleigh, S. Moon, B. Lyles et al., “Packet-level traffic measurements from the Sprint IP backbone,” IEEE Network, vol. 17, no. 6, pp. 6–16, 2003. View at Publisher · View at Google Scholar · View at Scopus