Minimizing Transient Congestion during Network Update in Data Centers
To maximize data center network utilization, the SDN control plane needs to frequently update the data plane as the network conditions change. Since each switch updates its flow table independently and asynchronously, the state transition -- if done directly from the initial to the final stage -- ma...
        Saved in:
      
    
          | Published in | Proceedings - International Conference on Network Protocols pp. 1 - 10 | 
|---|---|
| Main Authors | , , , | 
| Format | Conference Proceeding Journal Article | 
| Language | English | 
| Published | 
            IEEE
    
        01.11.2015
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1092-1648 | 
| DOI | 10.1109/ICNP.2015.33 | 
Cover
| Abstract | To maximize data center network utilization, the SDN control plane needs to frequently update the data plane as the network conditions change. Since each switch updates its flow table independently and asynchronously, the state transition -- if done directly from the initial to the final stage -- may result in serious flash congestion and packet loss. Prior work strives to find a congestion-free update plan with multiple stages, each with the property that there will be no congestion independent of the update order. Yet congestion-free update requires part of the link capacity to be left vacant and decreases utilization of the expensive network infrastructure. Further, it involves solving a series of LP, which is slow and does not scale well. In this paper, we study the more general problem of minimizing transient congestion during network update, given the number of intermediate stages. This exposes the tradeoff between update speed and transient congestion, and allows an operator to navigate a broader design space for performing network update. We formulate the minimum congestion update problem (MCUP) as an optimization program and prove its hardness. We propose an approximation algorithm and a greedy improvement algorithm to find the update sequence in an efficient and scalable manner. Extensive experiments with Mininet show that our solution reduces update time by 50% and saves control overhead by 30% compared to state of the art. | 
    
|---|---|
| AbstractList | To maximize data center network utilization, the SDN control plane needs to frequently update the data plane as the network conditions change. Since each switch updates its flow table independently and asynchronously, the state transition -- if done directly from the initial to the final stage -- may result in serious flash congestion and packet loss. Prior work strives to find a congestion-free update plan with multiple stages, each with the property that there will be no congestion independent of the update order. Yet congestion-free update requires part of the link capacity to be left vacant and decreases utilization of the expensive network infrastructure. Further, it involves solving a series of LP, which is slow and does not scale well. In this paper, we study the more general problem of minimizing transient congestion during network update, given the number of intermediate stages. This exposes the tradeoff between update speed and transient congestion, and allows an operator to navigate a broader design space for performing network update. We formulate the minimum congestion update problem (MCUP) as an optimization program and prove its hardness. We propose an approximation algorithm and a greedy improvement algorithm to find the update sequence in an efficient and scalable manner. Extensive experiments with Mininet show that our solution reduces update time by 50% and saves control overhead by 30% compared to state of the art. | 
    
| Author | Haipeng Dai Hong Xu Jiaqi Zheng Guihai Chen  | 
    
| Author_xml | – sequence: 1 givenname: Jiaqi surname: Zheng fullname: Zheng, Jiaqi – sequence: 2 givenname: Hong surname: Xu fullname: Xu, Hong – sequence: 3 givenname: Guihai surname: Chen fullname: Chen, Guihai – sequence: 4 givenname: Haipeng surname: Dai fullname: Dai, Haipeng  | 
    
| BookMark | eNotjztPwzAUhY1UJErpxsbikSXlXjuJ7RGFApVKYWjnyEluKkPrFDsVgl9PUJnOcD6dxyUb-c4TY9cIM0Qwd4ti9TYTgNlMyjM2NUpjmiuphcnkiI0HRCSYp_qCXcb4DiBAKDlm8xfn3d79OL_l62B9dOR7XnR-S7F3nefNMfx5K-q_uvDBN4fG9sSd5w-2t7wYaArxip23dhdp-q8Ttnmcr4vnZPn6tCjul4kToPtE1Sh1blKpKlsrCWkObSUzkzcZVgJbK6imFLQVlW2aWtfQUouQY4VALYCcsNtT7iF0n8dhYbl3sabdznrqjrFEjZkx6fBsQG9OqCOi8hDc3obvUg3diCh_AZSQWgg | 
    
| CODEN | IEEPAD | 
    
| ContentType | Conference Proceeding Journal Article  | 
    
| DBID | 6IE 6IL CBEJK RIE RIL 7SC 8FD JQ2 L7M L~C L~D  | 
    
| DOI | 10.1109/ICNP.2015.33 | 
    
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts  Academic Computer and Information Systems Abstracts Professional  | 
    
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional  | 
    
| DatabaseTitleList | Computer and Information Systems Abstracts  | 
    
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher  | 
    
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Engineering | 
    
| EISBN | 9781467382953 1467382957  | 
    
| EndPage | 10 | 
    
| ExternalDocumentID | 7437111 | 
    
| Genre | orig-research | 
    
| GroupedDBID | 29O 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL RNS 7SC 8FD JQ2 L7M L~C L~D  | 
    
| ID | FETCH-LOGICAL-i208t-7c13869437bac730460fb3596d51b21fa2ece408a2baddc8c0fef1061b10ef003 | 
    
| IEDL.DBID | RIE | 
    
| ISSN | 1092-1648 | 
    
| IngestDate | Thu Oct 02 09:52:20 EDT 2025 Wed Aug 27 01:56:23 EDT 2025  | 
    
| IsDoiOpenAccess | false | 
    
| IsOpenAccess | true | 
    
| IsPeerReviewed | false | 
    
| IsScholarly | true | 
    
| Language | English | 
    
| LinkModel | DirectLink | 
    
| MergedId | FETCHMERGED-LOGICAL-i208t-7c13869437bac730460fb3596d51b21fa2ece408a2baddc8c0fef1061b10ef003 | 
    
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Conference-1 ObjectType-Feature-3 content type line 23 SourceType-Conference Papers & Proceedings-2  | 
    
| PQID | 1815994273 | 
    
| PQPubID | 23500 | 
    
| PageCount | 10 | 
    
| ParticipantIDs | ieee_primary_7437111 proquest_miscellaneous_1815994273  | 
    
| PublicationCentury | 2000 | 
    
| PublicationDate | 20151101 | 
    
| PublicationDateYYYYMMDD | 2015-11-01 | 
    
| PublicationDate_xml | – month: 11 year: 2015 text: 20151101 day: 01  | 
    
| PublicationDecade | 2010 | 
    
| PublicationTitle | Proceedings - International Conference on Network Protocols | 
    
| PublicationTitleAbbrev | ICNP | 
    
| PublicationYear | 2015 | 
    
| Publisher | IEEE | 
    
| Publisher_xml | – name: IEEE | 
    
| SSID | ssj0020273 ssib030099286  | 
    
| Score | 2.3469014 | 
    
| Snippet | To maximize data center network utilization, the SDN control plane needs to frequently update the data plane as the network conditions change. Since each... | 
    
| SourceID | proquest ieee  | 
    
| SourceType | Aggregation Database Publisher  | 
    
| StartPage | 1 | 
    
| SubjectTerms | Algorithm design and analysis Algorithms Approximation algorithms Congestion Data centers Networks Optimization Planes Protocol (computers) Routing Switches Switching theory Transient analysis Utilization Wide area networks  | 
    
| Title | Minimizing Transient Congestion during Network Update in Data Centers | 
    
| URI | https://ieeexplore.ieee.org/document/7437111 https://www.proquest.com/docview/1815994273  | 
    
| hasFullText | 1 | 
    
| inHoldings | 1 | 
    
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZKJ1h4tIjykpEYSZuH4zhzaVWQWnWgUrcodi5ShEgrSJb-eu6ctiBgYLMHS9bdyffd4zszdq_c1HfzIHJA5sIRmcqcGDGck5k4AhcEgmTbIDuTk4V4XobLFnvYc2EAwDafQZ-WtpafrUxNqbIBervIIyLvQaRkw9Xa2U5AUMenUWjbYIvmtNhKZ-w7GBKofdN7PHgazubU1BX26btc-6nKr5fYupfxMZvuLtZ0lbz260r3zebHzMb_3vyEdb-IfHy-d1GnrAXlGTv6NoOww0bToizeig1uuHVcRJDkeJ4KT6g03hAZ-azpF-eLNeUIeFHyx7RKOWWHEUF22WI8ehlOnO3fCk7hu6pyIuMFSsZ4LZ2ayJZHcx2EscxCT_tenvpgQLgq9TW-gEYZN4ecwkftuZDjU3DO2uWqhAvG_SzEGCYniqoWEEglw0jgDoEOBjNC9liHBJKsm_EZyVYWPXa3E3mCJk11irSEVf2RIOgI41igAi__PnrFDkl9DSXwmrWr9xpuEBtU-tYaxSd26LUn | 
    
| linkProvider | IEEE | 
    
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELYqGICFR4soTyMxkjZx7CSeS6sW2qhDK3WL8rClCJFWkCz99dw5bUHAwGYPlqy7k--7x3cm5CGwY2Zr17eUp7nFsyCzJGA4K0ulr2zFASSbBtnQG87580IsGuRxx4VRSpnmM9XBpanlZ8u0wlRZF7yd7yCRd19wzkXN1tpaj4tgh-EwtE24hZNaTK1TMguCgmDX9i67o144xbYu0cEPc823Kr_eYuNgBsdksr1a3Vfy2qnKpJOuf0xt_O_dT0jri8pHpzsndUoaqjgjR9-mEDZJf5IX-Vu-hg01rgspkhTOY-kJ1EZrKiMN645xOl9hloDmBX2Ky5hifhgwZIvMB_1Zb2htflewcmYHpeWnjht4Eq6VxKlvCqQ6cYX0MuEkzNExU6nidhCzBN7ANEhtrTQGkIljKw2PwTnZK5aFuiCUZQKiGI0k1YQr1ws84XPYAdSBcIZ7bdJEgUSreoBGtJFFm9xvRR6BUWOlIi7UsvqIAHYIKTko8PLvo3fkYDibjKPxKHy5IoeoypogeE32yvdK3QBSKJNbYyCfJKK4dA | 
    
| 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%3Abook&rft.genre=proceeding&rft.title=Proceedings+-+International+Conference+on+Network+Protocols&rft.atitle=Minimizing+Transient+Congestion+during+Network+Update+in+Data+Centers&rft.au=Jiaqi+Zheng&rft.au=Hong+Xu&rft.au=Guihai+Chen&rft.au=Haipeng+Dai&rft.date=2015-11-01&rft.pub=IEEE&rft.issn=1092-1648&rft.spage=1&rft.epage=10&rft_id=info:doi/10.1109%2FICNP.2015.33&rft.externalDocID=7437111 | 
    
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1092-1648&client=summon | 
    
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1092-1648&client=summon | 
    
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1092-1648&client=summon |