Efficient Algorithms for Throughput Maximization in Software-Defined Networks With Consolidated Middleboxes
Today's computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to implementing traditional middleboxes is the consolidated middlebox technique, which implements the middleboxes as software in virtual machi...
Uloženo v:
| Vydáno v: | IEEE eTransactions on network and service management Ročník 14; číslo 3; s. 631 - 645 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.09.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1932-4537, 1932-4537 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Today's computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to implementing traditional middleboxes is the consolidated middlebox technique, which implements the middleboxes as software in virtual machines in software-defined networks (SDNs), offering economical, and simplified management for middleboxes. This however poses a great challenge, that is, how to find a cost-optimal routing path for each user request such that the data traffic of the request will pass through the middleboxes in their orders in the service chain of the request, with the objective to maximize the network throughput, subject to various resource capacity constraints in SDNs. In this paper, we study the network throughput maximization problem in an SDN under two different scenarios: one is the snapshot scenario where a set of requests at one time slot is given, we aim to admit as many requests in the set as possible to maximize the network throughput; another is the online scenario in which requests arrive one by one without the knowledge of future arrivals. Given a finite time horizon consisting of T equal time slots, the system must respond to the arrived requests in the beginning of each time slot, by either admitting or rejecting the requests, depending on the resource availabilities in the network. For the snapshot scenario, we first formulate an integer linear program (ILP) solution, we then devise two heuristics that strive for fine tradeoffs between the quality of a solution and the running time of obtaining the solution. For the online scenario, we show how to extend the proposed algorithms for the snapshot scenario to solve the online scenario. We finally evaluate the performance of the proposed algorithms through experimental simulations, based on both real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms admit more requests than the baseline algorithm and the quality of the solutions delivered by heuristics is comparable to the exact solution by the ILP in most cases. |
|---|---|
| AbstractList | Today’s computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to implementing traditional middleboxes is the consolidated middlebox technique, which implements the middleboxes as software in virtual machines in software-defined networks (SDNs), offering economical, and simplified management for middleboxes. This however poses a great challenge, that is, how to find a cost-optimal routing path for each user request such that the data traffic of the request will pass through the middleboxes in their orders in the service chain of the request, with the objective to maximize the network throughput, subject to various resource capacity constraints in SDNs. In this paper, we study the network throughput maximization problem in an SDN under two different scenarios: one is the snapshot scenario where a set of requests at one time slot is given, we aim to admit as many requests in the set as possible to maximize the network throughput; another is the online scenario in which requests arrive one by one without the knowledge of future arrivals. Given a finite time horizon consisting of [Formula Omitted] equal time slots, the system must respond to the arrived requests in the beginning of each time slot, by either admitting or rejecting the requests, depending on the resource availabilities in the network. For the snapshot scenario, we first formulate an integer linear program (ILP) solution, we then devise two heuristics that strive for fine tradeoffs between the quality of a solution and the running time of obtaining the solution. For the online scenario, we show how to extend the proposed algorithms for the snapshot scenario to solve the online scenario. We finally evaluate the performance of the proposed algorithms through experimental simulations, based on both real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms admit more requests than the baseline algorithm and the quality of the solutions delivered by heuristics is comparable to the exact solution by the ILP in most cases. Today's computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to implementing traditional middleboxes is the consolidated middlebox technique, which implements the middleboxes as software in virtual machines in software-defined networks (SDNs), offering economical, and simplified management for middleboxes. This however poses a great challenge, that is, how to find a cost-optimal routing path for each user request such that the data traffic of the request will pass through the middleboxes in their orders in the service chain of the request, with the objective to maximize the network throughput, subject to various resource capacity constraints in SDNs. In this paper, we study the network throughput maximization problem in an SDN under two different scenarios: one is the snapshot scenario where a set of requests at one time slot is given, we aim to admit as many requests in the set as possible to maximize the network throughput; another is the online scenario in which requests arrive one by one without the knowledge of future arrivals. Given a finite time horizon consisting of T equal time slots, the system must respond to the arrived requests in the beginning of each time slot, by either admitting or rejecting the requests, depending on the resource availabilities in the network. For the snapshot scenario, we first formulate an integer linear program (ILP) solution, we then devise two heuristics that strive for fine tradeoffs between the quality of a solution and the running time of obtaining the solution. For the online scenario, we show how to extend the proposed algorithms for the snapshot scenario to solve the online scenario. We finally evaluate the performance of the proposed algorithms through experimental simulations, based on both real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms admit more requests than the baseline algorithm and the quality of the solutions delivered by heuristics is comparable to the exact solution by the ILP in most cases. |
| Author | Weifa Liang Song Guo Meitian Huang Zichuan Xu |
| Author_xml | – sequence: 1 givenname: Meitian surname: Huang fullname: Huang, Meitian – sequence: 2 givenname: Weifa orcidid: 0000-0002-8207-6740 surname: Liang fullname: Liang, Weifa – sequence: 3 givenname: Zichuan surname: Xu fullname: Xu, Zichuan – sequence: 4 givenname: Song surname: Guo fullname: Guo, Song |
| BookMark | eNp9kE1PAjEQhhuDiYD-AOOliefFtrtst0eC-JEAHsB43JTdKRSWLbYloL_eIsQYD56mmb5PZ_q0UKM2NSB0TUmHUiLupuPJqMMI5R3GWZcl5Aw1qYhZlHRj3vh1vkAt55aEdDMqWBOtBkrpQkPtca-aG6v9Yu2wMhZPF9Zs54vN1uOR3Ou1_pRemxrrGk-M8jtpIboHpWso8Rj8ztiVw2-Bx31TO1PpUvpwNdJlWcHM7MFdonMlKwdXp9pGrw-Daf8pGr48Pvd7w6hgIvZRpspuJglRJCmTRJWQhG0TwTKeypkEKmdUlBJIyrMCFAUq0tBOZ4xIylUBcRvdHt_dWPO-BefzpdnaOozMg4aUJcFQHFL8mCqscc6Cygvtv7_ordRVTkl-MJsfzOYHs_nJbCDpH3Jj9Vraj3-ZmyOjAeAnzwVngqTxF4ryiNY |
| CODEN | ITNSC4 |
| CitedBy_id | crossref_primary_10_1109_TNSM_2021_3091424 crossref_primary_10_1109_TPDS_2018_2874257 crossref_primary_10_1109_TNSM_2019_2909116 crossref_primary_10_1002_cpe_5633 crossref_primary_10_1016_j_comnet_2017_12_011 crossref_primary_10_1109_TNSM_2018_2810817 crossref_primary_10_1016_j_comnet_2019_107040 crossref_primary_10_1109_TNSM_2020_3032969 crossref_primary_10_1587_transinf_2018EDL8240 crossref_primary_10_1109_TMC_2019_2927214 crossref_primary_10_1109_TCC_2019_2915835 |
| Cites_doi | 10.1109/JPROC.2014.2371999 10.1145/2875951.2875956 10.1109/ICDCS.2017.43 10.1109/LCN.2016.58 10.1109/JSAC.2011.111002 10.1145/633025.633039 10.1145/2396556.2396566 10.1007/978-3-319-25258-2_8 10.1145/2627566.2627574 10.1145/2785989.2785999 10.1145/2068816.2068834 10.1145/2486001.2486022 10.1109/COMST.2015.2477041 10.1002/net.3230140209 10.1002/net.3230040204 10.1126/science.286.5439.509 10.1109/INFOCOM.2016.7524563 10.1109/ICC.2016.7510816 10.1145/2619239.2626313 10.1145/2740070.2626300 10.1145/2377677.2377680 10.1016/j.ipl.2006.06.003 10.1109/INFOCOM.2016.7524565 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017 |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TNSM.2017.2725240 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1932-4537 |
| EndPage | 645 |
| ExternalDocumentID | 10_1109_TNSM_2017_2725240 7972906 |
| Genre | orig-research |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 EBS EJD HZ~ IES IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE AAYXX CITATION |
| ID | FETCH-LOGICAL-c293t-8fd58a00f04d44fde4005492876abae1ab19dae0678cef1e196bae6b20a17fce3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 14 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000410223900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1932-4537 |
| IngestDate | Sun Nov 09 06:22:05 EST 2025 Tue Nov 18 22:07:01 EST 2025 Sat Nov 29 03:13:12 EST 2025 Wed Aug 27 02:59:46 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-8fd58a00f04d44fde4005492876abae1ab19dae0678cef1e196bae6b20a17fce3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-8207-6740 |
| PQID | 1936247253 |
| PQPubID | 85504 |
| PageCount | 15 |
| ParticipantIDs | crossref_citationtrail_10_1109_TNSM_2017_2725240 crossref_primary_10_1109_TNSM_2017_2725240 proquest_journals_1936247253 ieee_primary_7972906 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-Sept. 2017-9-00 20170901 |
| PublicationDateYYYYMMDD | 2017-09-01 |
| PublicationDate_xml | – month: 09 year: 2017 text: 2017-Sept. |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE eTransactions on network and service management |
| PublicationTitleAbbrev | T-NSM |
| PublicationYear | 2017 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref12 (ref24) 2015 ref15 ref14 ref31 ref30 ref32 ref10 ref2 ref17 ref16 ref19 ref18 barabási (ref3) 1999; 286 charikar (ref5) 2014 (ref13) 2015 sekar (ref27) 2012 gupta (ref11) 2014 chi (ref6) 1999 ref26 ref25 ref20 ref22 ref21 martins (ref23) 2014 zhang (ref33) 2015 (ref1) 2017 sherry (ref28) 2012 ref29 ref7 ref4 fayazbakhsh (ref8) 2014 gember (ref9) 2012 |
| References_xml | – ident: ref18 doi: 10.1109/JPROC.2014.2371999 – start-page: 10 year: 1999 ident: ref6 article-title: Compression proxy server: Design and implementation publication-title: Proc USITS – ident: ref21 doi: 10.1145/2875951.2875956 – ident: ref32 doi: 10.1109/ICDCS.2017.43 – year: 2015 ident: ref13 publication-title: Servers for Enterprise-BladeSystem Rack & Tower and Hyperscale – ident: ref16 doi: 10.1109/LCN.2016.58 – ident: ref17 doi: 10.1109/JSAC.2011.111002 – start-page: 459 year: 2014 ident: ref23 article-title: ClickOS and the art of network function virtualization publication-title: Proc USENIX NSDI – year: 2012 ident: ref9 article-title: Stratos: Virtual middleboxes as first-class entities – ident: ref29 doi: 10.1145/633025.633039 – ident: ref2 doi: 10.1145/2396556.2396566 – ident: ref22 doi: 10.1007/978-3-319-25258-2_8 – ident: ref4 doi: 10.1145/2627566.2627574 – start-page: 24 year: 2012 ident: ref27 article-title: Design and implementation of a consolidated middlebox architecture publication-title: Proc USENIX NSDI – ident: ref12 doi: 10.1145/2785989.2785999 – ident: ref14 doi: 10.1145/2068816.2068834 – year: 2014 ident: ref5 publication-title: Multi-Commodity Flow with In-Network Processing – ident: ref26 doi: 10.1145/2486001.2486022 – start-page: 216 year: 2015 ident: ref33 article-title: Sector: TCAM space aware routing on SDN publication-title: Proc International Teletraffic Congr – ident: ref25 doi: 10.1109/COMST.2015.2477041 – ident: ref31 doi: 10.1002/net.3230140209 – ident: ref30 doi: 10.1002/net.3230040204 – volume: 286 start-page: 509 year: 1999 ident: ref3 article-title: Emergence of scaling in random networks publication-title: Science doi: 10.1126/science.286.5439.509 – ident: ref20 doi: 10.1109/INFOCOM.2016.7524563 – ident: ref15 doi: 10.1109/ICC.2016.7510816 – year: 2015 ident: ref24 publication-title: Plan Network Requirements for Skype for Business – ident: ref10 doi: 10.1145/2619239.2626313 – start-page: 551 year: 2014 ident: ref11 article-title: SDX: A software defined Internet exchange publication-title: Proc ACM Sigcomm doi: 10.1145/2740070.2626300 – start-page: 13 year: 2012 ident: ref28 article-title: Making middleboxes someone else's problem: Network processing as a cloud service publication-title: Proc ACM Sigcomm doi: 10.1145/2377677.2377680 – year: 2017 ident: ref1 publication-title: Amazon ec2 instance configuration – start-page: 533 year: 2014 ident: ref8 article-title: Enforcing network-wide policies in the presence of dynamic middlebox actions using FlowTags publication-title: Proc NSDI – ident: ref7 doi: 10.1016/j.ipl.2006.06.003 – ident: ref19 doi: 10.1109/INFOCOM.2016.7524565 |
| SSID | ssj0058192 |
| Score | 2.1694686 |
| Snippet | Today's computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to... Today’s computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 631 |
| SubjectTerms | Algorithms Computer simulation consolidated middleboxes Consolidation Cybersecurity Hardware Heuristic algorithms Maximization Middleboxes network function virtualization network resource allocations Network topologies online algorithms Optical switches Optimization Performance evaluation Routing Routing (machining) routing algorithms Run time (computers) Software-defined networking Throughput throughput maximization Virtual environments Virtual networks |
| Title | Efficient Algorithms for Throughput Maximization in Software-Defined Networks With Consolidated Middleboxes |
| URI | https://ieeexplore.ieee.org/document/7972906 https://www.proquest.com/docview/1936247253 |
| Volume | 14 |
| WOSCitedRecordID | wos000410223900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1932-4537 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0058192 issn: 1932-4537 databaseCode: RIE dateStart: 20040101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4g8aAH30YUzR48GYvd0nbbI_ERD0JMwMit2XanSgRKKCg_351tISQaE29Ns7Np-u3O-wFw6WEgKRxlyWbgW64XcyvUgskKFKqAc8l9ZZB-Ep1O0O-HzxW4XtXCIKJJPsMGPZpYvsqSObnKbkQoqDv5BmwI4Re1Wkuu61FjrzJqye3wptfptilxSzQc4XgO-TbW5I4ZpPKD-xqR8rD7v4_Zg51SdWStAut9qOD4ALbXGgoewse96QihCVlr-JZpw_99lDOtl7JeMY9nMp-xtlwMRmX5JRuMWVdz4i85ResOU72VYp0iNTxnr5qe0UjPbDggz4BibePPiLMF5kfw8nDfu320ynEKVqJl-swKUuUF0rZT21Wumyp0SV8Ltcnky1gilzEPlUQSXwmmHPXd1K_92LElF2mCzWOojrMxngCTnFQzZSPZk1q6SR-N8SaEJ5w4TWpgL392lJS9xmnkxTAyNocdRoRPRPhEJT41uFqRTIpGG38tPiRAVgtLLGpQXyIalVcxj7SG6juupmue_k51Blu0d5E4VofqbDrHc9hMPmeDfHphTtk38LDSkw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT9swFH9iHdLYgcEAUWDgw05ooXaaxMkRARUTbTSJInqLnPgFKtqmatqtf_78nLRCAk3aLYr8ksi_-H1_AHz3MVQUjnJUOwwcz0-FExnB5IQadSiEEoG2SHdlHIeDQfRrA36sa2EQ0Saf4QVd2li-LrIFucpaMpLUnfwDfPQ9z-VVtdaK7_rU2quOWwoetfrxfY9St-SFK13fJe_GK8ljR6m84b9WqHS-_N_n7MB2rTyyywrtXdjAyVf4_Kql4B683NieEIaQXY6eCmP6P49LZjRT1q8m8kwXc9ZTy-G4LsBkwwm7N7z4j5qhc425eZRmcZUcXrJHQ89oqGcxGpJvQLOe9WikxRLLfXjo3PSvbp16oIKTGak-d8Jc-6HiPOee9rxco0caW2SMpkClCoVKRaQVkgDLMBdoTqe5HaQuV0LmGbYPoDEpJngITAlSzjRHsiiNfFMBWvNNSl-6aZ41ga82O8nqbuM09GKUWKuDRwnhkxA-SY1PE87XJNOq1ca_Fu8RIOuFNRZNOFkhmtSHsUyMjhq4nqFrH71PdQafbvu9btL9Gd8dwxa9p0ojO4HGfLbAb7CZ_Z4Py9mp_eP-AghI1do |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Algorithms+for+Throughput+Maximization+in+Software-Defined+Networks+With+Consolidated+Middleboxes&rft.jtitle=IEEE+eTransactions+on+network+and+service+management&rft.au=Meitian+Huang&rft.au=Weifa+Liang&rft.au=Zichuan+Xu&rft.au=Song+Guo&rft.date=2017-09-01&rft.pub=IEEE&rft.eissn=1932-4537&rft.volume=14&rft.issue=3&rft.spage=631&rft.epage=645&rft_id=info:doi/10.1109%2FTNSM.2017.2725240&rft.externalDocID=7972906 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1932-4537&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1932-4537&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1932-4537&client=summon |