{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:51:24Z","timestamp":1729612284021,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1109\/iccnc.2017.7876239","type":"proceedings-article","created":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T04:16:38Z","timestamp":1489464998000},"page":"831-836","source":"Crossref","is-referenced-by-count":3,"title":["An efficient binary-search based heuristic for extended Unsplittable Flow Problem"],"prefix":"10.1109","author":[{"given":"Erdal","family":"Akin","sequence":"first","affiliation":[]},{"given":"Turgay","family":"Korkmaz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/MASCOT.2001.948886","article-title":"Brite: An approach to universal topology generation","author":"medina","year":"2001","journal-title":"Modeling Analysis and Simulation of Computer and Telecommunication Systems 2001 Proceedings Ninth International Symposium on"},{"key":"ref31","article-title":"Internetworking with TCP\/IP","volume":"i","author":"comer","year":"1995"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2014.W1E.6"},{"key":"ref10","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":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523685"},{"key":"ref12","first-page":"158","article-title":"Bandwidth on demand","volume":"15","author":"spanbauer","year":"1997","journal-title":"PC World(San Francisco CA)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11751588_117"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1927-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref19","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":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486012"},{"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 University of California Berkeley Rep UCB\/EECS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018446"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486019"},{"key":"ref6","first-page":"191","article-title":"On path selection for traffic with bandwidth guarantees","author":"ma","year":"1997","journal-title":"n Proceedings of the IEEE International Conference on Network Protocols (ICNP '97)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.07.012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-145"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/90.779203"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/90.779205"},{"key":"ref2","first-page":"128","article-title":"Models and algorithms of qos-based routing with mpls traffic engineering","author":"xu","year":"2002","journal-title":"High Speed Networks and Multimedia Communications 5th IEEE International Conference"},{"article-title":"Network Flows: Theory, Algorithms, and Applications","year":"1993","author":"ahuja","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/35.809383"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832263"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312696"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312859"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.64"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16295-4_48"},{"key":"ref26","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 Society for Industrial and Applied Mathematics"},{"journal-title":"Approximation algorithms for disjoint paths problems","year":"1996","author":"kleinberg","key":"ref25"}],"event":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","start":{"date-parts":[[2017,1,26]]},"location":"Silicon Valley, CA, USA","end":{"date-parts":[[2017,1,29]]}},"container-title":["2017 International Conference on Computing, Networking and Communications (ICNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7871262\/7876087\/07876239.pdf?arnumber=7876239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T12:34:04Z","timestamp":1498394044000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7876239\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/iccnc.2017.7876239","relation":{},"subject":[],"published":{"date-parts":[[2017,1]]}}}