Sonum: Software-Defined Synergetic Sampling Approach and Optimal Network Utilization Mechanism for Long Flow in a Data Center Network
Source abstract
Abstract
Long flow detection and load balancing are crucial techniques for data center running and management. However, both of them have been independently studied in previous studies. In this paper, we propose a complete solution called Sonum, which can complete long flow detection and scheduling at the same time. Sonum consists of a software-defined synergetic sampling approach and an optimal network utilization mechanism. Sonum detects long flows through consolidating and processing sampling information from multiple switches. Compared with the existing prime solution, the missed detection rate of Sonum is reduced by 2.3%–5.1%. After obtaining the long flow information, Sonum minimizes the potential packet loss rate as the optimization target and then translates load balancing into an optimization problem of arranging a minimum packet loss path for long flows. This paper also introduces a heuristic algorithm for solving this optimization problem. The experimental results show that Sonum outperforms ECMP and Hedera in terms of network throughput and flow completion time.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cloud Computing and Resource Management · Software-Defined Networks and 5G · Software System Performance and Reliability
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
National Engineering Laboratory of Next Generation Internet Interconnection Devices, Beijing Jiaotong University, Beijing 100044, China
College of Computer and Communication Engineering, China University of Petroleum, Qingdao 266580, China
School of Information Engineering, SouthWest University of Science and Technology, Mianyang 621010, China
School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
Funding
National Key R&D Program of China · National Natural Science Foundation of China · Fundamental Research Funds for the Central Universities of China · CERNET Innovation Project · Jingmen Science and Technology Research and 493 Development Plan Project
References (43)
Show source-provided references
1. Ahmed, H., and Arshad, M.J. (2019). Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks. Symmetry, 11.10.3390/sym11050646 ↗
2. Bandwidth-aware energy efficient flow scheduling with SDN in data center networks10.1016/j.future.2016.08.024 ↗
3. Efficient coflow scheduling without prior knowledge10.1145/2829988.2787480 ↗
4. Guo, Z., Hui, S., Xu, Y., and Chao, H.J. (2016, January 20–21). Dynamic flow scheduling for power-efficient data center networks. Proceedings of the 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS), Beijing, China.
5. Tan, L.Z., Su, W., Gao, S., and Cheng, P. (2018, January 12–15). L4S: Low-Speed Software Synergetic Sampling and Detecting Long Flow for Data Center Network. Proceedings of the 2018 International Conference on Networking and Network Applications (NaNA), Xi’an, China.10.1109/NANA.2018.8648748 ↗
6. Sreekumari, P. (2018). Multiple Congestion Points and Congestion Reaction Mechanisms for Improving DCTCP Performance in Data Center Networks. Information, 9.10.3390/info9060139 ↗
7. Benson, T., Akella, A., and Maltz, D.A. (2010, January 1–3). Network Traffic Characteristics of Data Centers in the Wild. Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, New York, NY, USA.10.1145/1879141.1879175 ↗
8. Joint flow routing-scheduling for energy efficient software defined data center networks: A prototype of energy-aware network management platform10.1016/j.jnca.2015.10.017 ↗
9. Towards practical and near-optimal coflow scheduling for data center networks10.1109/TPDS.2016.2525767 ↗
10. Joint static and dynamic traffic scheduling in data center networks10.1109/TNET.2015.2434879 ↗
11. Presto: Edge-based load balancing for fast datacenter networks10.1145/2829988.2787507 ↗
12. Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., and Vahdat, A. (2010, January 28–30). Hedera: Dynamic Flow Scheduling for Data Center Networks. Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, San Jose, CA, USA.
13. A survey on software-defined network and openflow: From concept to implementation10.1109/COMST.2014.2326417 ↗
14. Guaranteeing deadlines for inter-data center transfers10.1109/TNET.2016.2594235 ↗
15. Zhang, J., Ren, F., Tang, L., and Lin, C. (2013, January 7–10). Taming TCP incast throughput collapse in data center networks. Proceedings of the 2013 21st IEEE International Conference on Network Protocols (ICNP), Goettingen, Germany.
16. Analysis for TCP in data center networks: Outcast and incast10.1016/j.jnca.2016.04.014 ↗
17. FavorQueue: A parameterless active queue management to improve TCP traffic performance10.1016/j.bjp.2013.11.008 ↗
18. Understanding Data Center Traffic Characteristics10.1145/1672308.1672325 ↗
19. Kandula, S., Sengupta, S., Greenberg, A., Patel, P., and Chaiken, R. (2009, January 4–6). The Nature of Data Center Traffic: Measurements & Analysis. Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement, Chicago, IL, USA.10.1145/1644893.1644918 ↗
20. Alizadeh, M., Greenberg, A., Maltz, D.A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., and Sridharan, M. (September, January 30). Data Center TCP (DCTCP). Proceedings of the ACM SIGCOMM 2010 Conference, New Delhi, India.10.1145/1851182.1851192 ↗
21. Li, Y., Miao, R., Kim, C., and Yu, M. (2016, January 12–15). Lossradar: Fast detection of lost packets in data center networks. Proceedings of the 12th International on Conference on Emerging Networking Experiments and Technologies, Irvine, CA, USA.10.1145/2999572.2999609 ↗
22. Optical interconnect networks for data communications10.1109/JLT.2013.2279203 ↗
23. Lin, C.Y., Chen, C., Chang, J.W., and Chu, Y.H. (2014, January 8–12). Elephant flow detection in datacenters using OpenFlow-based Hierarchical Statistics Pulling. Proceedings of the 2014 IEEE Global Communications Conference, Austin, TX, USA.10.1109/GLOCOM.2014.7037145 ↗
24. Curtis, A.R., Mogul, J.C., Tourrilhes, J., Yalagandula, P., Sharma, P., and Banerjee, S. (2011, January 15–19). DevoFlow: Scaling Flow Management for High-performance Networks. Proceedings of the ACM SIGCOMM 2011 Conference, Toronto, ON, Canada.10.1145/2018436.2018466 ↗
25. Bi, C., Luo, X., Ye, T., and Jin, Y. (2013, January 9–13). On precision and scalability of elephant flow detection in data center with SDN. Proceedings of the 2013 IEEE Globecom Workshops (GC Wkshps), Atlanta, GA, USA.
26. Sample and fetch-based large flow detection mechanism in software defined networks10.1109/LCOMM.2016.2585480 ↗
27. Xu, H., and Li, B. (2014, January 21–23). TinyFlow: Breaking elephants down into mice in data center networks. Proceedings of the 2014 IEEE 20th International Workshop on Local & Metropolitan Area Networks (LANMAN), Reno, NV, USA.10.1109/LANMAN.2014.7028620 ↗
28. Kabbani, A., Vamanan, B., Hasan, J., and Duchene, F. (2014, January 2–5). Flowbender: Flow-level adaptive routing for improved latency and throughput in datacenter networks. Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, Sydney, Australia.10.1145/2674005.2674985 ↗
29. Chakraborty, S., and Chen, C. (2016, January 14–17). A low-latency multipath routing without elephant flow detection for data centers. Proceedings of the 2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR), Yokohama, Japan.10.1109/HPSR.2016.7525638 ↗
30. Carpio, F., Engelmann, A., and Jukan, A. (2016, January 4–8). DiffFlow: Differentiating short and long flows for load balancing in data center networks. Proceedings of the 2016 IEEE Global Communications Conference (GLOBECOM), Washington, DC, USA.10.1109/GLOCOM.2016.7841733 ↗
31. Benson, T., Anand, A., Akella, A., and Zhang, M. (2011, January 6–9). MicroTE: Fine grained traffic engineering for data centers. Proceedings of the Seventh COnference on Emerging Networking EXperiments and Technologies, Tokyo, Japan.10.1145/2079296.2079304 ↗
32. Suh, J., Kwon, T.T., Dixon, C., Felter, W., and Carter, J. (July, January 30). OpenSample: A low-latency, sampling-based measurement platform for commodity SDN. Proceedings of the 2014 IEEE 34th International Conference on Distributed Computing Systems (ICDCS), Madrid, Spain.10.1109/ICDCS.2014.31 ↗
33. Detecting heavy flows in the SDN match and action model10.1016/j.comnet.2018.02.018 ↗
34. Adaptive path isolation for elephant and mice flows by exploiting path diversity in datacenters10.1109/TNSM.2016.2517087 ↗
35. Bai, W., Chen, L., Chen, K., Han, D., Tian, C., and Sun, W. (2014, January 27–28). PIAS: Practical information-agnostic flow scheduling for data center networks. Proceedings of the 13th ACM Workshop on Hot Topics in Networks, Los Angeles, CA, USA.10.1145/2670518.2673871 ↗
36. Tan, L., Su, W., Gao, S., Miao, J., Cheng, Y., and Cheng, P. (2019). Path-flow matching: Two-sided matching and multiobjective evolutionary algorithm for traffic scheduling in cloud date center network. Trans. Emerg. Telecommun. Technol., e3809.10.1002/ett.3809 ↗
37. Sharing bandwidth by allocating switch buffer in data center networks10.1109/JSAC.2014.140105 ↗
38. A stable matching based elephant flow scheduling algorithm in data center networks10.1016/j.comnet.2017.04.018 ↗
39. Curtis, A.R., Kim, W., and Yalagandula, P. (2011, January 10–15). Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection. Proceedings of the International Conference on Computer Communications, Shanghai, China.10.1109/INFCOM.2011.5934956 ↗
40. Chen, L., Lingys, J., Chen, K., and Liu, F. (2018, January 20–25). Auto: Scaling deep reinforcement learning for datacenter-scale automatic traffic optimization. Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, Budapest, Hungary.10.1145/3230543.3230551 ↗
41. Exponentially weighted moving average control schemes: Properties and enhancements10.1080/00401706.1990.10484583 ↗
42. Optimizing Elephant Flow Sch3yuefen eduling for SDN-Based Data Center Network
43. Tan, L.Z., Tan, Y.Y., Yun, G.X., and Zhang, C. (2016, January 18–20). An improved genetic algorithm based on k-means clustering for solving traveling salesman problem. Proceedings of the 2016 International Conference on Computer Science, Technology and Application (CSTA2016), Changsha, China.10.1142/9789813200449_0042 ↗