Skip to main content
Log in

Adaptive flow scheduling for modular datacenter networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Modular data center networks leverage recursive topology to speed up several traffic patterns and increase the network capacity for various data shuffle applications. However, the applications of online social networks and instant messaging may be deployed in the same data center for high cost-effective investment. The large amount of mice flows which produced from these applications may cause partial path congestion, and these congestion in turn can prevent the mice flow access that reduces message loss or delay for online social networks. In this stydy, we define the cost function for different parallel paths and model the path selection process, and propose an adaptive flow scheduling for modular data center networks (AFMD) to search more suitable path for both large flows and mice flows with the greedy algorithm. The experiment shows that AFMD can improve large flow throughput by up to 25.9 % and the mice flow access ratio by up to 16.5 % and AFMD exhibits effective complementarity and compatibility to BCube networks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107–113

    Article  Google Scholar 

  2. Brin S, Page L (2007) The anatomy of a large-scale hypertextual web search engine, 1998. In: Proceedings of the seventh world wide web conference

  3. Shvachko K, Kuang H, Radia S, Chansler R (2010) The hadoop distributed file system. In: 2010 I.E. 26th symposium on mass storage systems and technologies (MSST). IEEE, pp 1–10

  4. Ballani H, Jang K, Karagiannis T, Kim C, Gunawardena D, O’Shea G (2013) Chatty tenants and the cloud network sharing problem. In: NSDI. pp 171–184

  5. Xu T, Chen Y, Jiao L, Zhao BY, Hui P, Fu X (2011) Scaling microblogging services with divergent traffic demands. In: Proceedings of the 12th international middleware conference. International Federation for Information Processing, pp 20–39

  6. Xiao Z, Guo L, Tracey J (2007) Understanding instant messaging traffic characteristics. In: IEEE 27th international conference on distributed computing systems. ICDCS’07. pp 51–51

  7. Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S (2009) BCube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM Comput Commun Rev 39(4):63–74

    Article  Google Scholar 

  8. Al-Fares M, Radhakrishnan S, Raghavan B, Huang N, Vahdat A (2010) Hedera: dynamic flow scheduling for data center networks. In: NSDI. pp 19–19

  9. Benson T, Anand A, Akella A, Zhang M (2011) MicroTE: fine grained traffic engineering for data centers. In: Proceedings of the seventh conference on emerging networking experiments and technologies. ACM, p 8

  10. Lockwood NM, Watson G, Gibb G, Hartke P, Naous J, Raghuraman R, Luo J (2007) NetFPGA–an open platform for gigabit-rate network switching and routing. In: In IEEE international conference on microelectronic systems education

  11. Guo C, Wu H, Tan K, Shi L, Zhang Y, Lu SD (2008) Cell: a scalable and fault-tolerant network structure for data centers. In: SIGCOMM, Seattle, Washington, USA

  12. Greenberg A, Hamilton JR, Jain N, Kandula S, Kim C, Lahiri P, Maltz DA, Patel P, Sengupta S (2009) VL2: a scalable and flexible data center network. In: ACM SIGCOMM computer communication review, vol 4. ACM, pp 51–62

  13. Tso FP, Pezaros DP (2013) Improving data center network utilization using near-optimal traffic engineering. IEEE Trans Parallel Distrib Syst 24(6):1139–1148

    Article  Google Scholar 

  14. Al-Fares M, Loukissas A, Vahdat A (2008) A scalable, commodity data center network architecture. ACM SIGCOMM Comput Commun Rev 38(4):63–74

    Article  Google Scholar 

  15. Chen K, Hu C, Zhang X, Zheng K, Chen Y, Vasilakos AV (2011) Survey on routing in data centers: insights and future directions. IEEE Netw 25(4):6–10

    Article  Google Scholar 

  16. Zats D, Das T, Mohan P, Borthakur D, Katz R (2012) DeTail: reducing the flow completion time tail in datacenter networks. ACM SIGCOMM Comput Commun Rev 42(4):139–150

    Article  Google Scholar 

  17. Benson T, Anand A, Akella A, Zhang M (2009) Understanding data center traffic characteristics. In: WREN

  18. Benson T, Akella A, Maltz DA (2010) Network traffic characteristics of data centers in the wild. In: Proceedings of the 10th ACM SIGCOMM conference on internet measurement, ACM, pp 267–280

  19. Athuraliya S, Low SH, Li VH, Yin Q (2001) REM: active queue management. IEEE Netw 15(3):48–53

    Article  Google Scholar 

  20. Prakash P, Dixit A, Hu YC, Kompella R (2012) The TCP outcast problem: exposing unfairness in data center networks. In: nsdi

  21. Raiciu C, Pluntke C, Barre S, Greenhalgh A, Wischik D, Handley M (2010) Data center networking with multipath TCP. In: Proceedings of the 9th ACM SIGCOMM workshop on hot topics in networks. ACM, p 10

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xingyan Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, X. Adaptive flow scheduling for modular datacenter networks. Peer-to-Peer Netw. Appl. 10, 1142–1151 (2017). https://doi.org/10.1007/s12083-016-0466-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-016-0466-z

Keywords

Navigation