Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN
Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a given flow while maximizing throughput and minimizing maximum link-load. In the case of routing multiple flows at the same time, finding such mul...
Uložené v:
| Vydané v: | IEEE International Conference on Communications (2003) s. 1 - 7 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.05.2019
|
| Predmet: | |
| ISSN: | 1938-1883 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a given flow while maximizing throughput and minimizing maximum link-load. In the case of routing multiple flows at the same time, finding such multiple paths even with just the bandwidth constraint is a well-known NP-hard problem and has been widely studied in the literature as the Unsplittable Flow Problem (UFP). Unfortunately, the existing approximation and heuristic solutions suffer from excessive computation time or low performance in maximizing throughput and minimizing maximum link-load. In this paper, we propose a new effective heuristic solution to find multiple paths that can satisfy bandwidth requirements of a given set of unsplittable flows while providing better throughput and load balancing in Software Defined Networks (SDN). We demonstrate the efficiency of our heuristic using simulations. |
|---|---|
| AbstractList | Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a given flow while maximizing throughput and minimizing maximum link-load. In the case of routing multiple flows at the same time, finding such multiple paths even with just the bandwidth constraint is a well-known NP-hard problem and has been widely studied in the literature as the Unsplittable Flow Problem (UFP). Unfortunately, the existing approximation and heuristic solutions suffer from excessive computation time or low performance in maximizing throughput and minimizing maximum link-load. In this paper, we propose a new effective heuristic solution to find multiple paths that can satisfy bandwidth requirements of a given set of unsplittable flows while providing better throughput and load balancing in Software Defined Networks (SDN). We demonstrate the efficiency of our heuristic using simulations. |
| Author | Akin, Erdal Korkmaz, Turgay |
| Author_xml | – sequence: 1 givenname: Erdal surname: Akin fullname: Akin, Erdal – sequence: 2 givenname: Turgay surname: Korkmaz fullname: Korkmaz, Turgay |
| BookMark | eNot0E9PwjAYgPFqNBGQu4mXfoFh37bb3h5xgJLgn4Am3kjXvWM1YyNbCeHbe5DTc_sdniG7adqGGHsAMQEQ5mmZZRMpwEwwTUAZvGJjkyLEChMUiOaaDcAojABR3bFh3_8KEUujYMB-1jZQ9Gx7Kvjs3Ni9d3xTtV2gPvBPGyo-rXdt50O152Xb8XlZeuepCfWZr9tj8M2Ovx3r4A818UXdnnruG76Zvd-z29LWPY0vHbHvxfwre41WHy_LbLqKPKRxiBAK6wppHZTOaCik1lqQzmNdxGleaMjJORmnKiHAPBcGZAlSKQLQRhGqEXv8dz0RbQ-d39vuvL2MUH-3G1MH |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ICC.2019.8761398 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781538680889 1538680882 |
| EISSN | 1938-1883 |
| EndPage | 7 |
| ExternalDocumentID | 8761398 |
| Genre | orig-research |
| GroupedDBID | 29F 29I 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-i175t-81dacd2ac1fc941d24440e4b54d57bd41becc25736e18bb0912f1233e11493e83 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000492038802037&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 05:51:22 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-81dacd2ac1fc941d24440e4b54d57bd41becc25736e18bb0912f1233e11493e83 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_8761398 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-May |
| PublicationDateYYYYMMDD | 2019-05-01 |
| PublicationDate_xml | – month: 05 year: 2019 text: 2019-May |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE International Conference on Communications (2003) |
| PublicationTitleAbbrev | ICC |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0052931 |
| Score | 2.0641406 |
| Snippet | Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Analytical models Data models Protocols Security Software Testing |
| Title | Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN |
| URI | https://ieeexplore.ieee.org/document/8761398 |
| WOSCitedRecordID | wos000492038802037&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELbaigEWHi3iLQ-MhNqJU9sj9CEYqCoKUrcqti-0UklQm4L491yStoDEwmZFcizd-fJ9jr-7I-QSnB-1ONdeqKTviQjA05IxTzpgMTPGBMoVzSZkv69GIz2okKtNLgwAFOIzuM6HxV2-S-0y_1XWxMhFwqKqpCplq8zVWn91Q4Qtvr6GZLp5327nui3cCOWcX81TCuzo7f5v1T3S-E7Co4MNvOyTCiQHZOdH_cA6GT0iU_RuEYgc7ZSt5elwkstnFxkdILejN7OXFI__k1eK5JR2i3oRuNrsk-ZSIHwJfVgpCmlvln4s6DShw06_QZ573af2nbdqleBNEf8zD1lnZNHslsdWC-4QtAUDYULhQmmc4LmrMDqDFnBlDJIEP0bMCgCPQzoAFRySWpImcESosL5WvmXKikgwE2qnAL0Gmse-jFx0TOq5jcZvZTWM8co8J38_PiXbuRtKieAZqWXzJZyTLfueTRfzi8KFXwBhnkU |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT8IwFG4QTdQXL2i82wcfnbRbx9pH5RKIsBDBhDeyrWeyBDcDQ-O_92wD1MQX35omXZNz1n5f2--cQ8gNaNOrca4MWzqmITwAQzmMGY4GFjLf9y2p82ITjuvK0Uj1S-R2HQsDALn4DO6yZv6Wr5NgkV2VVXHlImGRG2TTFsJkRbTWat-1Ebj46iGSqWqnXs-UW_grFKN-lU_J0aO1979598nRdxge7a8B5oCUID4kuz8yCFbI6Am5ovGAUKRpoyguTweTTEA7T2kf2R29n74ksyidvFKkp7SZZ4zA2aafNBMD4Udob6kppK1p8jGnUUwHDfeIPLeaw3rbWBZLMCJkAKmBvNML0PABDwMluEbYFgyEbwttO74WPHMWrk-rBlz6PtIEM0TUsgAPRMoCaR2TcpzEcEKoCEwlzYDJQHiC-bbSEtBvoHhoOp72Tkkls9H4rciHMV6a5-zv7muy3R72uuNux308JzuZSwrB4AUpp7MFXJKt4D2N5rOr3J1falyhjA |
| 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=IEEE+International+Conference+on+Communications+%282003%29&rft.atitle=Rate-Based+Dynamic+Shortest+Path+Algorithm+for+Efficiently+Routing+Multiple+Flows+in+SDN&rft.au=Akin%2C+Erdal&rft.au=Korkmaz%2C+Turgay&rft.date=2019-05-01&rft.pub=IEEE&rft.eissn=1938-1883&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FICC.2019.8761398&rft.externalDocID=8761398 |