Modelling of OpenFlow-based software-defined networks: the multiple node case
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/...
Gespeichert in:
| Veröffentlicht in: | IET networks 2015-09, Vol.4 (5), p.278-284 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 284 |
|---|---|
| container_issue | 5 |
| container_start_page | 278 |
| container_title | IET networks |
| container_volume | 4 |
| creator | Mahmood, Kashif Chilwan, Ameen Østerbø, Olav Jarschel, Michael |
| description | 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. |
| doi_str_mv | 10.1049/iet-net.2014.0091 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_24P</sourceid><recordid>TN_cdi_proquest_miscellaneous_1835632151</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_f50b2832674e455ba37e30a6982b05a4</doaj_id><sourcerecordid>1835632151</sourcerecordid><originalsourceid>FETCH-LOGICAL-c4674-5dcd687f15b973c1ecd7af396a93536ffa66df25b49cfa025046cbb9afe684c73</originalsourceid><addsrcrecordid>eNqFUctO3DAUjVCRQJQPYJclXWTqd2J2LWLakXhsBrG0HPsaPM3EqZ3RiL_HaSrYILBk2bo6j6tziuIMowVGTH73MFY9jAuCMFsgJPFBcUwQqysmBfny-ufsqDhNaYPyEQ3jmBwXNzfBQtf5_rEMrrwboF92YV-1OoEtU3DjXkeoLDjf50E22Yf4J12U4xOU2103-qGDss8apcmUr8Wh012C0__vSXG_vFpf_q6u736tLn9cV4aJmlXcGiua2mHeypoaDMbW2lEptKScCue0ENYR3jJpnEaEIyZM20rtIO9tanpSrGZdG_RGDdFvdXxWQXv1bxDio9Jx9KYD5ThqSUNJ9gXGeatpDRRpIRvSIq5Z1jqftYYY_u4gjWrrk8mZ6B7CLincUC4owRxnKJ6hJoaUIrhXa4zU1ITKTagckpqaUFMTmXMxc_a-g-fPCep2_UB-LnNFctqtmskTbBN2sc-pfmj27R386mqtbvN98xisoy_aCatD</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1835632151</pqid></control><display><type>article</type><title>Modelling of OpenFlow-based software-defined networks: the multiple node case</title><source>Wiley Online Library (Open Access Collection)</source><creator>Mahmood, Kashif ; Chilwan, Ameen ; Østerbø, Olav ; Jarschel, Michael</creator><creatorcontrib>Mahmood, Kashif ; Chilwan, Ameen ; Østerbø, Olav ; Jarschel, Michael</creatorcontrib><description>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.</description><identifier>ISSN: 2047-4954</identifier><identifier>ISSN: 2047-4962</identifier><identifier>EISSN: 2047-4962</identifier><identifier>DOI: 10.1049/iet-net.2014.0091</identifier><language>eng</language><publisher>The Institution of Engineering and Technology</publisher><subject>analytical model ; Approximation ; Controllers ; controller‐to‐switch communication ; cumulative density function ; data plane approximation ; Delay ; lost packet probability estimation ; M/M/1 queue ; Mathematical analysis ; Networks ; OF‐based network ; OF‐based SDN ; open Jackson network ; OpenFlow‐based software defined network ; packet sojourn time estimation ; Packets (communication) ; Planes ; probability ; probability density function ; protocols ; queueing theory ; Queues ; software defined networking ; Special Issue: Software Defined Networking ; switching networks</subject><ispartof>IET networks, 2015-09, Vol.4 (5), p.278-284</ispartof><rights>The Institution of Engineering and Technology</rights><rights>2015 The Institution of Engineering and Technology</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c4674-5dcd687f15b973c1ecd7af396a93536ffa66df25b49cfa025046cbb9afe684c73</citedby><cites>FETCH-LOGICAL-c4674-5dcd687f15b973c1ecd7af396a93536ffa66df25b49cfa025046cbb9afe684c73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1049%2Fiet-net.2014.0091$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1049%2Fiet-net.2014.0091$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,11562,27924,27925,45574,45575,46052,46476</link.rule.ids><linktorsrc>$$Uhttps://onlinelibrary.wiley.com/doi/abs/10.1049%2Fiet-net.2014.0091$$EView_record_in_Wiley-Blackwell$$FView_record_in_$$GWiley-Blackwell</linktorsrc></links><search><creatorcontrib>Mahmood, Kashif</creatorcontrib><creatorcontrib>Chilwan, Ameen</creatorcontrib><creatorcontrib>Østerbø, Olav</creatorcontrib><creatorcontrib>Jarschel, Michael</creatorcontrib><title>Modelling of OpenFlow-based software-defined networks: the multiple node case</title><title>IET networks</title><description>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.</description><subject>analytical model</subject><subject>Approximation</subject><subject>Controllers</subject><subject>controller‐to‐switch communication</subject><subject>cumulative density function</subject><subject>data plane approximation</subject><subject>Delay</subject><subject>lost packet probability estimation</subject><subject>M/M/1 queue</subject><subject>Mathematical analysis</subject><subject>Networks</subject><subject>OF‐based network</subject><subject>OF‐based SDN</subject><subject>open Jackson network</subject><subject>OpenFlow‐based software defined network</subject><subject>packet sojourn time estimation</subject><subject>Packets (communication)</subject><subject>Planes</subject><subject>probability</subject><subject>probability density function</subject><subject>protocols</subject><subject>queueing theory</subject><subject>Queues</subject><subject>software defined networking</subject><subject>Special Issue: Software Defined Networking</subject><subject>switching networks</subject><issn>2047-4954</issn><issn>2047-4962</issn><issn>2047-4962</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNqFUctO3DAUjVCRQJQPYJclXWTqd2J2LWLakXhsBrG0HPsaPM3EqZ3RiL_HaSrYILBk2bo6j6tziuIMowVGTH73MFY9jAuCMFsgJPFBcUwQqysmBfny-ufsqDhNaYPyEQ3jmBwXNzfBQtf5_rEMrrwboF92YV-1OoEtU3DjXkeoLDjf50E22Yf4J12U4xOU2103-qGDss8apcmUr8Wh012C0__vSXG_vFpf_q6u736tLn9cV4aJmlXcGiua2mHeypoaDMbW2lEptKScCue0ENYR3jJpnEaEIyZM20rtIO9tanpSrGZdG_RGDdFvdXxWQXv1bxDio9Jx9KYD5ThqSUNJ9gXGeatpDRRpIRvSIq5Z1jqftYYY_u4gjWrrk8mZ6B7CLincUC4owRxnKJ6hJoaUIrhXa4zU1ITKTagckpqaUFMTmXMxc_a-g-fPCep2_UB-LnNFctqtmskTbBN2sc-pfmj27R386mqtbvN98xisoy_aCatD</recordid><startdate>201509</startdate><enddate>201509</enddate><creator>Mahmood, Kashif</creator><creator>Chilwan, Ameen</creator><creator>Østerbø, Olav</creator><creator>Jarschel, Michael</creator><general>The Institution of Engineering and Technology</general><general>Wiley</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope></search><sort><creationdate>201509</creationdate><title>Modelling of OpenFlow-based software-defined networks: the multiple node case</title><author>Mahmood, Kashif ; Chilwan, Ameen ; Østerbø, Olav ; Jarschel, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c4674-5dcd687f15b973c1ecd7af396a93536ffa66df25b49cfa025046cbb9afe684c73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>analytical model</topic><topic>Approximation</topic><topic>Controllers</topic><topic>controller‐to‐switch communication</topic><topic>cumulative density function</topic><topic>data plane approximation</topic><topic>Delay</topic><topic>lost packet probability estimation</topic><topic>M/M/1 queue</topic><topic>Mathematical analysis</topic><topic>Networks</topic><topic>OF‐based network</topic><topic>OF‐based SDN</topic><topic>open Jackson network</topic><topic>OpenFlow‐based software defined network</topic><topic>packet sojourn time estimation</topic><topic>Packets (communication)</topic><topic>Planes</topic><topic>probability</topic><topic>probability density function</topic><topic>protocols</topic><topic>queueing theory</topic><topic>Queues</topic><topic>software defined networking</topic><topic>Special Issue: Software Defined Networking</topic><topic>switching networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mahmood, Kashif</creatorcontrib><creatorcontrib>Chilwan, Ameen</creatorcontrib><creatorcontrib>Østerbø, Olav</creatorcontrib><creatorcontrib>Jarschel, Michael</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IET networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mahmood, Kashif</au><au>Chilwan, Ameen</au><au>Østerbø, Olav</au><au>Jarschel, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Modelling of OpenFlow-based software-defined networks: the multiple node case</atitle><jtitle>IET networks</jtitle><date>2015-09</date><risdate>2015</risdate><volume>4</volume><issue>5</issue><spage>278</spage><epage>284</epage><pages>278-284</pages><issn>2047-4954</issn><issn>2047-4962</issn><eissn>2047-4962</eissn><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.</abstract><pub>The Institution of Engineering and Technology</pub><doi>10.1049/iet-net.2014.0091</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2047-4954 |
| ispartof | IET networks, 2015-09, Vol.4 (5), p.278-284 |
| issn | 2047-4954 2047-4962 2047-4962 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1835632151 |
| source | Wiley Online Library (Open Access Collection) |
| subjects | analytical model Approximation Controllers controller‐to‐switch communication cumulative density function data plane approximation Delay lost packet probability estimation M/M/1 queue Mathematical analysis Networks OF‐based network OF‐based SDN open Jackson network OpenFlow‐based software defined network packet sojourn time estimation Packets (communication) Planes probability probability density function protocols queueing theory Queues software defined networking Special Issue: Software Defined Networking switching networks |
| title | Modelling of OpenFlow-based software-defined networks: the multiple node case |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T11%3A04%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_24P&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Modelling%20of%20OpenFlow-based%20software-defined%20networks:%20the%20multiple%20node%20case&rft.jtitle=IET%20networks&rft.au=Mahmood,%20Kashif&rft.date=2015-09&rft.volume=4&rft.issue=5&rft.spage=278&rft.epage=284&rft.pages=278-284&rft.issn=2047-4954&rft.eissn=2047-4962&rft_id=info:doi/10.1049/iet-net.2014.0091&rft_dat=%3Cproquest_24P%3E1835632151%3C/proquest_24P%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1835632151&rft_id=info:pmid/&rft_doaj_id=oai_doaj_org_article_f50b2832674e455ba37e30a6982b05a4&rfr_iscdi=true |