research-article

Modelling of OpenFlow‐based software‐defined networks: : the multiple node case

Authors:

Kashif Mahmood,

Ameen Chilwan,

Olav Østerbø,

Michael JarschelAuthors Info & Claims

IET Networks, Volume 4, Issue 5

Pages 278 - 284

https://doi.org/10.1049/iet-net.2014.0091

Published: 01 September 2015 Publication History

Abstract

OpenFlow (OF) is one of the most widely used protocols for controller‐to‐switch communication in a software defined network (SDN). Performance analysis of OF‐based SDN using analytical models is both highly desirable and challenging. There already exists a very elegant analytical model based on M/M/1 queues to estimate the packet sojourn time and probability of lost packets for the case in which a controller is responsible for only a single node in the data plane. However the literature falls short when it comes to the multiple node case, i.e. when there is more than one node in the data plane. In this work we propose a model to address this challenge by approximating the data plane as an open Jackson network with the controller also modeled as an M/M/1 queue. The model is then used to evaluate the system in the light of some of the metrics, such as; how much time a packet spends on average in an OF‐based network and how much data we can pump into the network given the average delay requirements. Finally the PDF and the CDF of the time spent by the packet in an OF‐based SDN for a given path is derived.

6 References

[1]

Jarschel, M., Oechsner, S., Schlosser, D. et al: ‘Modeling and performance evaluation of an OpenFlow architecture’. Proc. of the 23rd Int. Teletraffic Congress (ITC), San Francisco, CA, USA, September 2011, pp. 1–7

Google Scholar

[2]

Astuto, B.N., Mendonça, M., Nguyen, X.N. et al: ‘A survey of software‐defined networking: past, present, and future of programmable networks’, IEEE Commun. Surv. Tutor., 2014, 16, (3), pp. 1617–1634 (https://doi.org/10.1109/SURV.2014.012214.00180)

Google Scholar

[3]

Hoelzle, U.: ‘Opening Address: 2012 Open Network Summit’. Available at http://www.opennetsummit.org/archives/apr12/hoelzle‐tue‐openflow.pdf, accessed March 2014

Google Scholar

[4]

McKeown, N., Anderson, T., Balakrishnan, H. et al: ‘OpenFlow: enabling innovation in campus networks’, SIGCOMM Computer Commun. Rev., 2008, 38, (2), pp. 69–74 (https://doi.org/10.1145/1355734.1355746)

Google Scholar

[5]

‘Open Networking Foundation’. Available at https://www.opennetworking.org, accessed March 2014

Google Scholar

[6]

Bozakov, Z., Rizk, A.: ‘Taming SDN controllers in heterogeneous hardware environments’. Second IEEE European Workshop on Software‐Defined Networks (EWSDN), Berlin, Germany, October 2013, pp. 50–55

Google Scholar

[7]

Azodolmolky, S., Nejabati, R., Pazouki, M. et al: ‘An analytical model for software defined networking: a network calculus‐based approach’. IEEE Globecom, Atlanta, Georgia, USA, December 2013, pp. 1397–1402

Google Scholar

[8]

Ciucu, F., Schmitt, J.: ‘Perspectives on network calculus: no free lunch, but still good value’, SIGCOMM Comput. Commun. Rev., 2012, 42, (4), pp. 311–322 (https://doi.org/10.1145/2377677.2377747)

Google Scholar

[9]

Naous, J., Erickson, D., Covington, G.A. et al: ‘Implementing an OpenFlow switch on the NetFPGA platform’. Proc. of the Fourth ACM/IEEE Symp. on Architectures for Networking and Communications Systems (ANCS), San Jose, CA, USA, November 2008, pp. 1–9

Google Scholar

[10]

Bianco, A., Birke, R., Giraudo, L. et al: ‘OpenFlow switching: data plane performance’. IEEE Int. Conf. on Communications (ICC), Cape Town, South Africa, May 2010, pp. 1–5

Google Scholar

[11]

Khan, A., Dave, N.: ‘Enabling hardware exploration in software‐defined networking: a flexible, portable OpenFlow switch’. IEEE 21st Annual Int. Symp. on Field‐Programmable Custom Computing Machines (FCCM), Seattle, WA, USA, April 2013, pp. 145–148

Google Scholar

[12]

‘NetFPGA’. Available at http://www.netfpga.org, accessed November 2014

Google Scholar

[13]

Jackson, J.R.: ‘Networks of waiting lines’, Oper. Res., 1957, 5, (4), pp. 518–521 (https://doi.org/10.1287/opre.5.4.518)

Google Scholar

[14]

Kleinrock, L.: ‘Queueing systems: theory’ (Wiley Interscience, 1975), vol. 1

Google Scholar

Cited By

View all

Sharma SLai YGumaste ALin Y(2025)P4+NFVComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110907257:COnline publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1016/j.comnet.2024.110907
Kröger NHarkous HMehmeti FKellerer W(2024)Performance Modeling and Analysis of P4 Programmable Devices With General Service TimesIEEE Transactions on Network and Service Management10.1109/TNSM.2024.340481321:4(4543-4562)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3404813
Neha FLai YHossain MLin Y(2024)Prioritization and offloading in P4 switch integrated with NFVTelecommunications Systems10.1007/s11235-024-01129-286:3(571-584)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s11235-024-01129-2
Show More Cited By

Recommendations

The distribution of delays of dispersed messages in an M/M/1 queue
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1

We analyze the distribution of the delay of messages in an infinite capacity M/M/1 queue. A message is composed of n packets, and the arrival of the packets to the queue is Poisson. Our calculations are based on recursive schemes. We obtain explicit ...
Diffusion approximations for open Jackson networks with reneging

We consider generalized Jackson networks with reneging in which the customer patience times follow a general distribution that unifies the patience time without scaling adopted by Ward and Glynn (Queueing Syst 50:371---400, 2005) and the patience time ...
Slowdown in the M/M/1 discriminatory processor-sharing queue

We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IET Networks Volume 4, Issue 5

September 2015

38 pages

EISSN:2047-4962

DOI:10.1049/ntw2.v4.5

Issue’s Table of Contents

Publisher

John Wiley & Sons, Inc.

United States

Publication History

Published: 01 September 2015

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sharma SLai YGumaste ALin Y(2025)P4+NFVComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110907257:COnline publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1016/j.comnet.2024.110907
Kröger NHarkous HMehmeti FKellerer W(2024)Performance Modeling and Analysis of P4 Programmable Devices With General Service TimesIEEE Transactions on Network and Service Management10.1109/TNSM.2024.340481321:4(4543-4562)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3404813
Neha FLai YHossain MLin Y(2024)Prioritization and offloading in P4 switch integrated with NFVTelecommunications Systems10.1007/s11235-024-01129-286:3(571-584)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s11235-024-01129-2
Kröger NMehmeti FHarkous HKellerer W(2023)Performance analysis of general P4 forwarding devices with controller feedbackComputer Communications10.1016/j.comcom.2023.07.003209:C(102-119)Online publication date: 18-Oct-2023
https://dl.acm.org/doi/10.1016/j.comcom.2023.07.003
Kröger NMehmeti FHarkous HKellerer WBoukerche AGiannelli CSun Z(2022)Performance Analysis of General P4 Forwarding Devices with Controller FeedbackProceedings of the 25th International ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems10.1145/3551659.3559045(55-64)Online publication date: 24-Oct-2022
https://dl.acm.org/doi/10.1145/3551659.3559045
Shen GLi QShi WJiang YZhang PGu LXu M(2022)Modeling and optimization of the data plane in the SDN-based DCN by queuing theoryJournal of Network and Computer Applications10.1016/j.jnca.2022.103481207:COnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.jnca.2022.103481
Guo JYang LLiu XChen QFan CLi X(2021)Performance Modelling and Evaluation of In-Band Control Mode in Software-Defined Satellite Networks Based on Queuing TheoryProceedings of the 2021 2nd International Conference on Computing, Networks and Internet of Things10.1145/3468691.3468697(1-6)Online publication date: 20-May-2021
https://dl.acm.org/doi/10.1145/3468691.3468697
Mokrov EPoluektov DMachnev EShorgin SKhakimov AHosek J(2020)Analytical Model for Software Defined Network Considering Memory Node for Routing RulesInternet of Things, Smart Spaces, and Next Generation Networks and Systems10.1007/978-3-030-65729-1_4(39-55)Online publication date: 26-Aug-2020
https://dl.acm.org/doi/10.1007/978-3-030-65729-1_4
Bauer SRaumer DEmmerich PCarle G(2018)Behind the scenesProceedings of the 2018 Applied Networking Research Workshop10.1145/3232755.3232776(58-65)Online publication date: 16-Jul-2018
https://dl.acm.org/doi/10.1145/3232755.3232776

Abstract

6 References

Cited By

Recommendations

The distribution of delays of dispersed messages in an M/M/1 queue

Diffusion approximations for open Jackson networks with reneging

Slowdown in the M/M/1 discriminatory processor-sharing queue

Comments

Information

Published In

Publisher

Publication History

Author Tags

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations