{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:04:01Z","timestamp":1730232241794,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icc.2019.8761398","type":"proceedings-article","created":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T20:16:31Z","timestamp":1563221791000},"page":"1-7","source":"Crossref","is-referenced-by-count":9,"title":["Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN"],"prefix":"10.1109","author":[{"given":"Erdal","family":"Akin","sequence":"first","affiliation":[]},{"given":"Turgay","family":"Korkmaz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref32","first-page":"527","article-title":"An Effective Path Load Balancing Mechanism Based on SON","author":"li","year":"2014","journal-title":"2014 IEEE 13th International Conference on Trust Security and Privacy in Computing and Communications"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841733"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890968"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2017.7876255"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"ref11"},{"key":"ref12","first-page":"1067","article-title":"Modeling and Resource Scheduling of Real-Time Unsplittable Data Transfers","volume":"9","author":"atanak","year":"2015","journal-title":"Appl Math"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1661"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523685"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2017.7876239"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100269","article-title":"On Splittable and Unsplittable Flow Capac-itated Network Design Arc-set Polyhedra","volume":"92","author":"atamttirk","year":"2002","journal-title":"Mathematical Programming"},{"journal-title":"Approximation algorithms for disjoint paths problems","year":"1996","author":"kleinberg","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1172-z"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2602204.2602219"},{"key":"ref28","first-page":"89","article-title":"Hedera: Dynamic Flow Scheduling for Data Center Networks","volume":"10","author":"al-fares","year":"2010","journal-title":"NSDI"},{"key":"ref4","first-page":"13","article-title":"Above The Clouds: A Berkeley View of Cloud Computing","volume":"28","author":"fox","year":"2009","journal-title":"Dept Electrical Eng and Comput Sciences"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2992"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2218253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1145\/2740070.2626316","article-title":"CONGA: Distributed Congestion-aware Load Balancing for Data centers","volume":"44","author":"alizadeh","year":"2014","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-145"},{"key":"ref8","first-page":"191","article-title":"On Path Selection for Traffic with Bandwidth Guarantees","author":"ma","year":"1997","journal-title":"Proceedings of the IEEE International Conference on Network Protocols (ICNP '97)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MIE.2017.2649104"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963084"},{"article-title":"QoS Routing Mechanisms and OSPF Extensions","year":"1999","author":"orda","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2749760"},{"journal-title":"Software Defined Networks A Comprehensive Approach","year":"2014","author":"goransson","key":"ref20"},{"key":"ref22","article-title":"Comparison of Routing Algorithms with Static and Dynamic Link Cost in SON","author":"akin","year":"2018","journal-title":"Consumer Communications and Networking Conference (CCNC)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/11751588_117"},{"key":"ref24","first-page":"217","article-title":"Simple Mathematical Modeling of Efficient Path Selection for QoS Routing in Load Balancing","volume":"1","author":"yuen","year":"2004","journal-title":"Multimedia and Expo 2004 ICME '04 2004 IEEE International Conference on"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254829"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICEIEC.2017.8076592"},{"key":"ref25","first-page":"184","article-title":"Improved Bounds for The Unsplittable Flow Problem","author":"kolman","year":"2002","journal-title":"Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete Algorithms"}],"event":{"name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","start":{"date-parts":[[2019,5,20]]},"location":"Shanghai, China","end":{"date-parts":[[2019,5,24]]}},"container-title":["ICC 2019 - 2019 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8753818\/8761046\/08761398.pdf?arnumber=8761398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T23:08:20Z","timestamp":1657840100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8761398\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/icc.2019.8761398","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}