Online Load Balancing for Network Functions Virtualization
Network Functions Virtualization (NFV) aims to support service providers to deploy various services in a more agile and cost-effective way. However, the softwarization and cloudification of network functions can result in severe congestion and low network performance. In this paper, we propose a sol...
Gespeichert in:
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 | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Pham, Tuan-Minh Nguyen, Thi-Thuy-Lien Fdida, Serge Binh, Huynh Thi Thanh |
description | Network Functions Virtualization (NFV) aims to support service providers to
deploy various services in a more agile and cost-effective way. However, the
softwarization and cloudification of network functions can result in severe
congestion and low network performance. In this paper, we propose a solution to
address this issue. We analyze and solve the online load balancing problem
using multipath routing in NFV to optimize network performance in response to
the dynamic changes of user demands. In particular, we first formulate the
optimization problem of load balancing as a mixed integer linear program for
achieving the optimal solution. We then develop the ORBIT algorithm that solves
the online load balancing problem. The performance guarantee of ORBIT is
analytically proved in comparison with the optimal offline solution. The
experiment results on real-world datasets show that ORBIT performs very well
for distributing traffic of each service demand across multipaths without
knowledge of future demands, especially under high-load conditions. |
doi_str_mv | 10.48550/arxiv.1702.07219 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1702_07219</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1702_07219</sourcerecordid><originalsourceid>FETCH-arxiv_primary_1702_072193</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzNDcw0jMwNzK05GSw8s_LycxLVfDJT0xRcErMScxLzsxLV0jLL1LwSy0pzy_KVnArzUsuyczPK1YIyywqKU3MyaxKBPF5GFjTEnOKU3mhNDeDvJtriLOHLtiW-IKizNzEosp4kG3xYNuMCasAAJB4NLg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Online Load Balancing for Network Functions Virtualization</title><source>arXiv.org</source><creator>Pham, Tuan-Minh ; Nguyen, Thi-Thuy-Lien ; Fdida, Serge ; Binh, Huynh Thi Thanh</creator><creatorcontrib>Pham, Tuan-Minh ; Nguyen, Thi-Thuy-Lien ; Fdida, Serge ; Binh, Huynh Thi Thanh</creatorcontrib><description>Network Functions Virtualization (NFV) aims to support service providers to
deploy various services in a more agile and cost-effective way. However, the
softwarization and cloudification of network functions can result in severe
congestion and low network performance. In this paper, we propose a solution to
address this issue. We analyze and solve the online load balancing problem
using multipath routing in NFV to optimize network performance in response to
the dynamic changes of user demands. In particular, we first formulate the
optimization problem of load balancing as a mixed integer linear program for
achieving the optimal solution. We then develop the ORBIT algorithm that solves
the online load balancing problem. The performance guarantee of ORBIT is
analytically proved in comparison with the optimal offline solution. The
experiment results on real-world datasets show that ORBIT performs very well
for distributing traffic of each service demand across multipaths without
knowledge of future demands, especially under high-load conditions.</description><identifier>DOI: 10.48550/arxiv.1702.07219</identifier><language>eng</language><subject>Computer Science - Networking and Internet Architecture</subject><creationdate>2017-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1702.07219$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1702.07219$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Pham, Tuan-Minh</creatorcontrib><creatorcontrib>Nguyen, Thi-Thuy-Lien</creatorcontrib><creatorcontrib>Fdida, Serge</creatorcontrib><creatorcontrib>Binh, Huynh Thi Thanh</creatorcontrib><title>Online Load Balancing for Network Functions Virtualization</title><description>Network Functions Virtualization (NFV) aims to support service providers to
deploy various services in a more agile and cost-effective way. However, the
softwarization and cloudification of network functions can result in severe
congestion and low network performance. In this paper, we propose a solution to
address this issue. We analyze and solve the online load balancing problem
using multipath routing in NFV to optimize network performance in response to
the dynamic changes of user demands. In particular, we first formulate the
optimization problem of load balancing as a mixed integer linear program for
achieving the optimal solution. We then develop the ORBIT algorithm that solves
the online load balancing problem. The performance guarantee of ORBIT is
analytically proved in comparison with the optimal offline solution. The
experiment results on real-world datasets show that ORBIT performs very well
for distributing traffic of each service demand across multipaths without
knowledge of future demands, especially under high-load conditions.</description><subject>Computer Science - Networking and Internet Architecture</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzNDcw0jMwNzK05GSw8s_LycxLVfDJT0xRcErMScxLzsxLV0jLL1LwSy0pzy_KVnArzUsuyczPK1YIyywqKU3MyaxKBPF5GFjTEnOKU3mhNDeDvJtriLOHLtiW-IKizNzEosp4kG3xYNuMCasAAJB4NLg</recordid><startdate>20170223</startdate><enddate>20170223</enddate><creator>Pham, Tuan-Minh</creator><creator>Nguyen, Thi-Thuy-Lien</creator><creator>Fdida, Serge</creator><creator>Binh, Huynh Thi Thanh</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20170223</creationdate><title>Online Load Balancing for Network Functions Virtualization</title><author>Pham, Tuan-Minh ; Nguyen, Thi-Thuy-Lien ; Fdida, Serge ; Binh, Huynh Thi Thanh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_1702_072193</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Networking and Internet Architecture</topic><toplevel>online_resources</toplevel><creatorcontrib>Pham, Tuan-Minh</creatorcontrib><creatorcontrib>Nguyen, Thi-Thuy-Lien</creatorcontrib><creatorcontrib>Fdida, Serge</creatorcontrib><creatorcontrib>Binh, Huynh Thi Thanh</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pham, Tuan-Minh</au><au>Nguyen, Thi-Thuy-Lien</au><au>Fdida, Serge</au><au>Binh, Huynh Thi Thanh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online Load Balancing for Network Functions Virtualization</atitle><date>2017-02-23</date><risdate>2017</risdate><abstract>Network Functions Virtualization (NFV) aims to support service providers to
deploy various services in a more agile and cost-effective way. However, the
softwarization and cloudification of network functions can result in severe
congestion and low network performance. In this paper, we propose a solution to
address this issue. We analyze and solve the online load balancing problem
using multipath routing in NFV to optimize network performance in response to
the dynamic changes of user demands. In particular, we first formulate the
optimization problem of load balancing as a mixed integer linear program for
achieving the optimal solution. We then develop the ORBIT algorithm that solves
the online load balancing problem. The performance guarantee of ORBIT is
analytically proved in comparison with the optimal offline solution. The
experiment results on real-world datasets show that ORBIT performs very well
for distributing traffic of each service demand across multipaths without
knowledge of future demands, especially under high-load conditions.</abstract><doi>10.48550/arxiv.1702.07219</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1702.07219 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1702_07219 |
source | arXiv.org |
subjects | Computer Science - Networking and Internet Architecture |
title | Online Load Balancing for Network Functions Virtualization |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T03%3A58%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20Load%20Balancing%20for%20Network%20Functions%20Virtualization&rft.au=Pham,%20Tuan-Minh&rft.date=2017-02-23&rft_id=info:doi/10.48550/arxiv.1702.07219&rft_dat=%3Carxiv_GOX%3E1702_07219%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |