Improve Service Chaining Performance with Optimized Middlebox Placement
Previous works have proposed various approaches to implement service chaining by routing traffic through the desired middleboxes according to pre-defined policies. However, no matter what routing scheme is used, the performance of service chaining depends on where these middleboxes are placed. Thus,...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on services computing Jg. 10; H. 4; S. 560 - 573 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.07.2017
|
| Schlagworte: | |
| ISSN: | 1939-1374, 2372-0204 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Previous works have proposed various approaches to implement service chaining by routing traffic through the desired middleboxes according to pre-defined policies. However, no matter what routing scheme is used, the performance of service chaining depends on where these middleboxes are placed. Thus, in this paper, we study middlebox placement problem, i.e., given network information and policy specifications, we attempt to determine the optimal locations to place the middleboxes so that the performance is optimized. The performance metrics studied in this paper include the end-to-end delay and the bandwidth consumption, which cover both users' and network providers' interests. We first formulate it as 0-1 programming problem, and prove it is NP-hard. We then propose two heuristic algorithms to obtain the sub-optimal solutions. The first algorithm is a greedy algorithm, and the second algorithm is based on simulated annealing. Through extensive simulations, we show that in comparison with a baseline algorithm, the proposed algorithms can reduce 22 percent end-to-end delay and save 38 percent bandwidth consumption on average. The formulation and proposed algorithms have no special assumption on network topology or policy specifications, therefore, they have broad range of applications in various types of networks such as enterprise, data center and broadband access networks. |
|---|---|
| AbstractList | Previous works have proposed various approaches to implement service chaining by routing traffic through the desired middleboxes according to pre-defined policies. However, no matter what routing scheme is used, the performance of service chaining depends on where these middleboxes are placed. Thus, in this paper, we study middlebox placement problem, i.e., given network information and policy specifications, we attempt to determine the optimal locations to place the middleboxes so that the performance is optimized. The performance metrics studied in this paper include the end-to-end delay and the bandwidth consumption, which cover both users' and network providers' interests. We first formulate it as 0-1 programming problem, and prove it is NP-hard. We then propose two heuristic algorithms to obtain the sub-optimal solutions. The first algorithm is a greedy algorithm, and the second algorithm is based on simulated annealing. Through extensive simulations, we show that in comparison with a baseline algorithm, the proposed algorithms can reduce 22 percent end-to-end delay and save 38 percent bandwidth consumption on average. The formulation and proposed algorithms have no special assumption on network topology or policy specifications, therefore, they have broad range of applications in various types of networks such as enterprise, data center and broadband access networks. |
| Author | Jiaqiang Liu Ying Zhang Li Su Depeng Jin Yong Li |
| Author_xml | – sequence: 1 givenname: Jiaqiang surname: Liu fullname: Liu, Jiaqiang – sequence: 2 givenname: Yong surname: Li fullname: Li, Yong – sequence: 3 givenname: Ying surname: Zhang fullname: Zhang, Ying – sequence: 4 givenname: Li surname: Su fullname: Su, Li – sequence: 5 givenname: Depeng surname: Jin fullname: Jin, Depeng |
| BookMark | eNp9kM9LwzAYhoNMcJveBS_9BzqTfG3SHKXoHEw22DyXLP3iIm060jB__PVubHjw4OmFl_d5D8-IDHznkZBbRieMUXW_XpUTTlk-4TnlPOcXZMhB8pRymg3IkClQKQOZXZFR379TKnhRqCGZztpd6PaYrDDsncGk3GrnnX9LlhhsF1rtD-WHi9tksYuudd9YJy-urhvcdJ_JstEGW_Txmlxa3fR4c84xeX16XJfP6XwxnZUP89QAQEzRZkJvcp1DLSSvc5tJawpmmFS6yLRhzCgLSgitapACNNgMjMkFbHjNgMKYiNOvCV3fB7SVcVFH1_kYtGsqRqujjuqgozrqqM46DiD9A-6Ca3X4-g-5OyEOEX_nEoBLJeAHu_JtIg |
| CODEN | ITSCAD |
| CitedBy_id | crossref_primary_10_1007_s11036_021_01868_5 crossref_primary_10_1109_TNSM_2021_3087838 crossref_primary_10_1109_JSAC_2019_2959181 crossref_primary_10_1364_JOCN_10_000582 crossref_primary_10_1109_TNSE_2022_3159796 crossref_primary_10_1016_j_jnca_2019_102429 crossref_primary_10_1016_j_jnca_2020_102637 crossref_primary_10_1109_ACCESS_2020_3006502 crossref_primary_10_3390_info13020053 crossref_primary_10_1109_JIOT_2019_2937110 crossref_primary_10_1109_TII_2020_3042872 crossref_primary_10_1016_j_comnet_2019_107040 crossref_primary_10_1109_JIOT_2024_3356750 crossref_primary_10_1016_j_comcom_2018_10_008 crossref_primary_10_1109_TNSM_2021_3055494 crossref_primary_10_1109_ACCESS_2018_2882255 crossref_primary_10_3390_electronics11030331 crossref_primary_10_3390_systems10050165 crossref_primary_10_1109_TNSM_2020_3047391 crossref_primary_10_1109_JIOT_2022_3204916 crossref_primary_10_1109_TNSM_2022_3181517 crossref_primary_10_1109_TNSM_2021_3123502 crossref_primary_10_1587_transinf_2018EDL8240 crossref_primary_10_1016_j_comnet_2022_109451 crossref_primary_10_1109_TPDS_2023_3301670 crossref_primary_10_1109_JIOT_2022_3204359 crossref_primary_10_1109_TNSE_2020_2997376 crossref_primary_10_1109_TCC_2018_2881963 crossref_primary_10_1109_TNET_2021_3107413 crossref_primary_10_1109_TCC_2017_2780165 crossref_primary_10_1109_JSAC_2021_3087264 crossref_primary_10_1109_TNSM_2022_3141165 crossref_primary_10_1109_TVT_2024_3404090 crossref_primary_10_1109_TPDS_2020_3030920 crossref_primary_10_1109_TNSM_2021_3102583 crossref_primary_10_1016_j_future_2018_03_018 crossref_primary_10_3390_s21196563 crossref_primary_10_1109_JIOT_2023_3306737 crossref_primary_10_1109_TPDS_2021_3049804 crossref_primary_10_1109_ACCESS_2025_3569077 crossref_primary_10_3390_drones7040259 crossref_primary_10_1109_JSEN_2016_2561969 crossref_primary_10_1109_ACCESS_2017_2780991 crossref_primary_10_1016_j_simpat_2024_103031 crossref_primary_10_1109_JSAC_2019_2894305 crossref_primary_10_1109_TSC_2018_2849712 crossref_primary_10_1109_TNSM_2020_3045432 crossref_primary_10_1109_ACCESS_2016_2629278 crossref_primary_10_1016_j_jnca_2021_103269 crossref_primary_10_1109_TVT_2024_3487015 crossref_primary_10_1016_j_jnca_2022_103361 crossref_primary_10_1109_ACCESS_2018_2822398 crossref_primary_10_1109_JIOT_2019_2958063 crossref_primary_10_1109_TCCN_2021_3091711 crossref_primary_10_1109_ACCESS_2024_3452325 crossref_primary_10_1109_ACCESS_2019_2963139 |
| Cites_doi | 10.1016/j.ejor.2005.09.032 10.15388/Informatica.2003.037 10.1109/INFCOM.2010.5461930 10.1145/321958.321975 10.1145/2627566.2627574 10.1109/TNSM.2015.2401568 10.1145/354871.354874 10.1109/INFCOM.2011.5935247 10.1109/ICNP.2013.6733615 10.1145/2018436.2018465 10.1145/1402958.1402967 10.1109/INFCOM.2013.6566849 10.1145/1868447.1868466 10.1145/2486001.2486022 10.1007/BF00121304 10.1145/1402958.1402966 10.1109/MNET.2015.7113223 10.1145/1355734.1355746 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TSC.2015.2502252 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present 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 | 2372-0204 |
| EndPage | 573 |
| ExternalDocumentID | 10_1109_TSC_2015_2502252 7332796 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Basic Research Program of China 973 Program grantid: 2013CB329105 – fundername: National Nature Science Foundation of China grantid: 61301080; 61171065; 61273214; 91338203; 91338102 funderid: 10.13039/501100001809 |
| GroupedDBID | 0R~ 29I 4.4 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD HZ~ IEDLZ IFIPE IPLJI JAVBF M43 O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB AAYXX CITATION |
| ID | FETCH-LOGICAL-c333t-ef46ab5a53d672d5f47fc81c179a84ac11c9f3966a9d3763a3f43cc563b2d1303 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 78 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000414282600006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1939-1374 |
| IngestDate | Sat Nov 29 02:04:31 EST 2025 Tue Nov 18 22:13:16 EST 2025 Wed Aug 27 02:48:30 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c333t-ef46ab5a53d672d5f47fc81c179a84ac11c9f3966a9d3763a3f43cc563b2d1303 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_7332796 crossref_citationtrail_10_1109_TSC_2015_2502252 crossref_primary_10_1109_TSC_2015_2502252 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-07-01 |
| PublicationDateYYYYMMDD | 2017-07-01 |
| PublicationDate_xml | – month: 07 year: 2017 text: 2017-07-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE transactions on services computing |
| PublicationTitleAbbrev | TSC |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref14 ref10 (ref7) 0 sekar (ref2) 0 fayazbakhsh (ref15) 0 ref17 ref16 ref19 levin (ref23) 0 kazemian (ref26) 0 sherry (ref1) 0 ref25 ref20 ref22 ref21 csoma (ref24) 0 (ref13) 0 (ref11) 0 ref28 martins (ref18) 0 ref27 ref8 (ref29) 0 ref9 ref4 ref3 ref6 ref5 misevi?ius (ref12) 2003; 14 |
| References_xml | – ident: ref8 doi: 10.1016/j.ejor.2005.09.032 – volume: 14 start-page: 497 year: 2003 ident: ref12 article-title: A modified simulated annealing algorithm for the quadratic assignment problem publication-title: Informatica doi: 10.15388/Informatica.2003.037 – ident: ref19 doi: 10.1109/INFCOM.2010.5461930 – start-page: 113 year: 0 ident: ref26 article-title: Header space analysis: Static checking for networks publication-title: Proc 3rd USENIX Conf Netw Syst Des Implementation – year: 0 ident: ref11 – start-page: 333 year: 0 ident: ref23 article-title: Panopticon: Reaping the benefits of incremental SDN deployment in enterprise networks publication-title: Proc USENIX Annu Techn Conf – ident: ref9 doi: 10.1145/321958.321975 – ident: ref22 doi: 10.1145/2627566.2627574 – year: 0 ident: ref13 – ident: ref17 doi: 10.1109/TNSM.2015.2401568 – start-page: 459 year: 0 ident: ref18 article-title: Clickos and the art of network function virtualization publication-title: Proc 3rd USENIX Conf Netw Syst Des Implementation – start-page: 13 year: 0 ident: ref1 article-title: Making middleboxes someone else's problem: Network processing as a cloud service publication-title: Proc ACM Sigcomm – ident: ref28 doi: 10.1145/354871.354874 – start-page: 533 year: 0 ident: ref15 article-title: Enforcing network-wide policies in the presence of dynamic middlebox actions using flowtags publication-title: Proc 3rd USENIX Conf Netw Syst Des Implementation – ident: ref21 doi: 10.1109/INFCOM.2011.5935247 – ident: ref5 doi: 10.1109/ICNP.2013.6733615 – ident: ref20 doi: 10.1145/2018436.2018465 – ident: ref14 doi: 10.1145/1402958.1402967 – ident: ref16 doi: 10.1109/INFCOM.2013.6566849 – ident: ref27 doi: 10.1145/1868447.1868466 – start-page: 125 year: 0 ident: ref24 article-title: ESCAPE: Extensible service chain prototyping environment using mininet, click, NETCONF and POX publication-title: Proc ACM Sigcomm – ident: ref4 doi: 10.1145/2486001.2486022 – year: 0 ident: ref7 – ident: ref10 doi: 10.1007/BF00121304 – start-page: 323 year: 0 ident: ref2 article-title: Design and implementation of a consolidated middlebox architecture publication-title: Proc 9th USENIX Conf Netw Syst Des Implementation – ident: ref3 doi: 10.1145/1402958.1402966 – ident: ref25 doi: 10.1109/MNET.2015.7113223 – ident: ref6 doi: 10.1145/1355734.1355746 – year: 0 ident: ref29 |
| SSID | ssj0062889 |
| Score | 2.4451075 |
| Snippet | Previous works have proposed various approaches to implement service chaining by routing traffic through the desired middleboxes according to pre-defined... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 560 |
| SubjectTerms | algorithm design Algorithm design and analysis Bandwidth Delays Heuristic algorithms middlebox placement Middleboxes performance optimization Routing Servers Service chaining |
| Title | Improve Service Chaining Performance with Optimized Middlebox Placement |
| URI | https://ieeexplore.ieee.org/document/7332796 |
| Volume | 10 |
| WOSCitedRecordID | wos000414282600006&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: 2372-0204 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0062889 issn: 1939-1374 databaseCode: RIE dateStart: 20080101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFH7U4kEPblWsGzl4EZwuWSdHKVYPWgsu9DZksmBBW6mtiL_eJDOtCiJ4G4aEGb4k70te3nsfwHEuGTNOioSljifUSZcENYfEtFJlnWBtHfPWHq5Er5cOBrJfgdNFLoy1Ngaf2UZ4jHf5ZqxnwVXWFIRgIfkSLAkhilytudUNqrlyfg3Zks27206I22INT_F-yuIftPNNRyXSSHf9fz-wAWvldhGdFeO7CRU72oLVb0UEa3BR-AUsKpc96jwWqg-o_5UUgIK_Fd14-_A8_LAGXUe_RD5-R_3gRw-f3Yb77vld5zIp5RESTQiZJtZRrnKmGDFcYMMcFU6nHlwhVUqVbre1dMQfZ5Q0wYwo4ijRmnGSYxOoaweqo_HI7gIK-wyeE2_3rKSM5ioXOMecUKyph5PXoTlHL9Nl7fAgYfGUxTNES2Ye7yzgnZV41-Fk0eOlqJvxR9tagHrRrkR57_fX-7CCA7XGkNkDqE4nM3sIy_ptOnydHMVJ8QmeIbU8 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MKagP3qY4r3nwRbDbmmvzKMM5cZsDp-yttGmCA91kbiL-epu0mxNE8K2UhJYvyfmSk3POB3AWS8YSI4XHAsM9aqTxrJqDl9SCSBvBfOXy1h5botMJ-n3ZLcDFPBdGa-2Cz3TFPrq7_GSkptZVVhWEYCH5EiwzSrGfZWvN7K7VzZWzi8iarPbu6zZyi1VSkk8nLf5BPAtKKo5IGpv_-4Ut2Mg3jOgyG-FtKOjhDqwvlBEswXXmGdAoX_io_pTpPqDud1oAsh5XdJdaiJfBp05Q23km4tEH6lpPuv3sLjw0rnr1ppcLJHiKEDLxtKE8ilnESMIFTpihwqgghVfIKKCR8n0lDUkPNJFMrCGJiKFEKcZJjBNLXntQHI6Geh-Q3WnwmKSWT0vKaBzFAseYE4oVTeHkZajO0AtVXj3cilg8h-4UUZNhindo8Q5zvMtwPu_xmlXO-KNtyUI9b5ejfPD761NYbfbarbB107k9hDVsidYF0B5BcTKe6mNYUe-Twdv4xE2QLzkOuIM |
| 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=Improve+Service+Chaining+Performance+with+Optimized+Middlebox+Placement&rft.jtitle=IEEE+transactions+on+services+computing&rft.au=Jiaqiang+Liu&rft.au=Yong+Li&rft.au=Ying+Zhang&rft.au=Li+Su&rft.date=2017-07-01&rft.pub=IEEE&rft.eissn=2372-0204&rft.volume=10&rft.issue=4&rft.spage=560&rft.epage=573&rft_id=info:doi/10.1109%2FTSC.2015.2502252&rft.externalDocID=7332796 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1939-1374&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1939-1374&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1939-1374&client=summon |