Balancing flow table occupancy and link utilization in software-defined networks

被引:36
作者
Guo, Zehua [1 ]
Xu, Yang [2 ]
Liu, Ruoyan [3 ]
Gushchin, Andrey [4 ]
Chen, Kuan-yin [5 ]
Walid, Anwar [6 ]
Chao, H. Jonathan [2 ]
机构
[1] Univ Minnesota Twin Cities, Minneapolis, MN 55455 USA
[2] NYU, New York, NY 11201 USA
[3] Amazon, Seattle, WA 98109 USA
[4] Mode, San Francisco, CA 94134 USA
[5] Fortinet, Sunnyvale, CA 94086 USA
[6] Nokia Bell Labs, Murray Hill, NJ 07974 USA
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2018年 / 89卷
关键词
Software-defined networking; OpenFlow; Flow-table overflow; Max-min fairness; Routing; MANAGEMENT; SDN;
D O I
10.1016/j.future.2018.06.011
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Software-Defined Networking (SDN) employs a centralized control with a global network view and provides great opportunities to improve network performance. However, due to the limitation of flow table space at the switches and unbalanced traffic allocation on links, an SDN may suffer from flow table overflow and inefficient bandwidth allocation among flows, increasing the controller's burden and degrading network performance. In this paper, we present a dynamic routing scheme named DIFF that differentiates flows based on their impact on network resource and adaptively selects routing paths for them to mitigate the problems of flow-table overflow and inefficient bandwidth allocation. DIFF pre-generates a set of paths for each pair of source-destination edge switches and intelligently selects the paths from the pre-generated path-sets for new flows with an objective to balance flow-table utilizations. It adaptively reroutes some elephant flows to achieve maximum throughput under the rule of max-min fair bandwidth allocation. Simulation results show that DIFF simultaneously balances the flow table and link utilizations, reduces the controller's workload and packet delay, while increasing network throughput, compared with baseline schemes. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:213 / 223
页数:11
相关论文
共 32 条
[1]  
Agarwal S, 2013, IEEE INFOCOM SER, P2211
[2]  
Al-Fares M., 2010, Hedera: dynamic flow scheduling for data center networks, P19
[3]  
[Anonymous], 2016, 2016 IEEEACM 24 INT
[4]  
[Anonymous], 2000, ANAL EQUAL COST MULT
[5]   Programming Protocol-Independent Packet Processors [J].
Bosshart, Pat ;
Daly, Dan ;
Gibb, Glen ;
Izzard, Martin ;
McKeown, Nick ;
Rexford, Jennifer ;
Schlesinger, Cole ;
Talayco, Dan ;
Vahdat, Amin ;
Varghese, George ;
Walker, David .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (03) :87-95
[6]   Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN [J].
Bosshart, Pat ;
Gibb, Glen ;
Kim, Hun-Seok ;
Varghese, George ;
McKeown, Nick ;
Izzard, Martin ;
Mujica, Fernando ;
Horowitz, Mark .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :99-110
[7]  
Cohen R, 2014, IEEE INFOCOM SER, P1734, DOI 10.1109/INFOCOM.2014.6848111
[8]   DevoFlow: Scaling Flow Management for High-Performance Networks [J].
Curtis, Andrew R. ;
Mogul, Jeffrey C. ;
Tourrilhes, Jean ;
Yalagandula, Praveen ;
Sharma, Puneet ;
Banerjee, Sujata .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (04) :254-265
[9]  
Curtis AR, 2011, IEEE INFOCOM SER, P1629, DOI 10.1109/INFCOM.2011.5934956
[10]  
Dejun Yang, 2010, 2010 18th IEEE International Conference on Network Protocols (ICNP 2010), P1, DOI 10.1109/ICNP.2010.5762749