Performance evaluation of OpenFlow-based software-defined networks based on queueing model

被引:93
作者
Xiong, Bing [1 ]
Yang, Kun [2 ]
Zhao, Jinyuan [3 ]
Li, Wei [1 ]
Li, Keqin [4 ]
机构
[1] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha 410114, Hunan, Peoples R China
[2] NE Normal Univ, Sch Software, Changchun 130024, Peoples R China
[3] Cent South Univ, Sch Software, Changsha 410075, Hunan, Peoples R China
[4] SUNY Coll New Paltz, Dept Comp Sci, New Paltz, NY 12561 USA
基金
中国国家自然科学基金;
关键词
Software-defined networking; Performance evaluation; Queueing model; SDN controllers; OpenFlow switches; PACKET-TRAIN; SYSTEM;
D O I
10.1016/j.comnet.2016.03.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
OpenFlow is one of the most famous protocols for controller-to-switch communications in software-defined networking (SDN), commonly seen as a promising way towards future Internet. Understanding the performance and limitation of OpenFlow-based SDN is a prerequisite of its deployments. To achieve this aim, this paper proposes a novel analytical performance model of OpenFlow networks based on queueing theory. After depicting a typical network scenario of OpenFlow deployments, we model the packet forwarding of its OpenFlow switches and the packet-in message processing of its SDN controller respectively as the queueing systems M-x/M/1 and M/G/1. Subsequently, we build a queueing model of OpenFlow networks in terms of packet forwarding performance, and solve its closed-form expression of average packet sojourn time and the corresponding probability density function. Finally, the numerical analysis is carried out to evaluate our proposed performance model with different parameter values. Furthermore, our controller model is contrasted with the classical one by utilizing the popular benchmark Cbench. Experimental results indicate that our controller model provides a more accurate approximation of SON controller performance. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:172 / 185
页数:14
相关论文
共 43 条
[31]   Markovian Arrival Process Parameter Estimation With Group Data [J].
Okamura, Hiroyuki ;
Dohi, Tadashi ;
Trivedi, Kishor S. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (04) :1326-1339
[32]  
Osgouei AG, 2015, IRAN CONF ELECTR ENG, P770, DOI 10.1109/IranianCEE.2015.7146317
[33]   A Survey of the Research on Future Internet Architectures [J].
Pan, Jianli ;
Paul, Subharthi ;
Jain, Raj .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (07) :26-36
[34]   WIDE AREA TRAFFIC - THE FAILURE OF POISSON MODELING [J].
PAXSON, V ;
FLOYD, S .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (03) :226-244
[35]  
Rowshanrad S., 2014, Journal of Advanced Computer Science Technology, V3, P232, DOI [10.14419/jacst.v3i2.3754, DOI 10.14419/JACST.V3I2.3754]
[36]  
Shah SA, 2013, IEEE ICC, P3504, DOI 10.1109/ICC.2013.6655093
[37]  
Shalimov A., 2013, Proceedings of the 9th Central Eastern European Software Engineering Conference in Russia, P1
[38]  
Tootoonchian Amin., 2012, P 2 USENIX C HOT TOP, P10
[39]   Internet traffic measurement [J].
Williamson, C .
IEEE INTERNET COMPUTING, 2001, 5 (06) :70-74
[40]  
Yang J, 2015, IEEE WCNC, P801, DOI 10.1109/WCNC.2015.7127572