Flexible Traffic Splitting in OpenFlow Networks

被引:19
作者
Tuncer, Daphne [1 ]
Charalambides, Marinos [1 ]
Clayman, Stuart [1 ]
Pavlou, George [1 ]
机构
[1] UCL, Dept Elect & Elect Engn, London WC1E 7JE, England
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2016年 / 13卷 / 03期
基金
英国工程与自然科学研究理事会;
关键词
Software defined networking; OpenFlow; resource management; DYNAMICS;
D O I
10.1109/TNSM.2016.2580666
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Traffic engineering (TE) functionality aims to control and fine-tune the routing configuration and bandwidth allocation in order to optimize the use of network resources and avoid the build-up of congestion. The performance of a given TE scheme is, however, strongly influenced by the degree of flexibility offered in distributing the traffic load. Multipath routing coupled with arbitrary traffic splitting are two essential ingredients for achieving the desired flexibility. Current proposals for multipath routing in OpenFlow have mostly focused on equal splitting solutions, which impose limitations in terms of the level of control that can be achieved. In this paper, we investigate a new approach, which exploits the properties of bit-masking operations to enable flexible TE in OpenFlow networks. The proposed solution relies on the matching entry feature and the multiple table pipeline capability of OpenFlow, and as such, is in line with the current standard. Based on empirical evaluation, we illustrate the influence of the considered masking parameters and how these can be configured to achieve the desired traffic splitting ratios. The results demonstrate that our solution can achieve a similar level of splitting accuracy as the one obtained with a hash-based approach. However, in contrast to current proposals, it does not require complex extensions to the OpenFlow protocol and can be easily implemented in an OpenFlow environment.
引用
收藏
页码:407 / 420
页数:14
相关论文
共 31 条
[1]  
Agarwal S, 2013, IEEE INFOCOM SER, P2211
[2]   A roadmap for traffic engineering in SDN-OpenFlow networks [J].
Akyildiz, Ian F. ;
Lee, Ahyoung ;
Wang, Pu ;
Luo, Min ;
Chou, Wu .
COMPUTER NETWORKS, 2014, 71 :1-30
[3]  
[Anonymous], 2011, Hot-ICE
[4]   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
[5]   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
[6]  
Charalambides M, 2013, 2013 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2013), P369
[7]  
Das S., 2012, THESIS
[8]  
Elwalid A, 2001, IEEE INFOCOM SER, P1300, DOI 10.1109/INFCOM.2001.916625
[9]  
Fischer Simon., 2006, Proc. ACM CoNEXT, P1
[10]  
Gadkari K, 2011, LECT NOTES COMPUT SC, V6579, P11, DOI 10.1007/978-3-642-19260-9_2