{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:10Z","timestamp":1750221130400,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:00:00Z","timestamp":1552003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,3,8]]},"DOI":"10.1145\/3318265.3318290","type":"proceedings-article","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:34:06Z","timestamp":1554813246000},"page":"100-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["VPS-SDN"],"prefix":"10.1145","author":[{"given":"Saleem","family":"Karmoshi","sequence":"first","affiliation":[{"name":"University of Science and Technology of China"}]},{"given":"Wang","family":"Shuo","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}]},{"given":"Fekri","family":"Saleh","sequence":"additional","affiliation":[{"name":"University of Science and Technology Houari Boumediene"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}]},{"given":"Ming","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}]}],"member":"320","published-online":{"date-parts":[[2019,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUDCOM-ASIA.2013.44"},{"key":"e_1_3_2_1_2_1","volume-title":"Improved approximation algorithms for unsplittable flow problems,\" in focs","author":"Kolliopoulos S. G.","year":"1997","unstructured":"S. G. Kolliopoulos and C. Stein , \" Improved approximation algorithms for unsplittable flow problems,\" in focs , 1997 , p. 426: IEEE. S. G. Kolliopoulos and C. Stein, \"Improved approximation algorithms for unsplittable flow problems,\" in focs, 1997, p. 426: IEEE."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921188"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0038-092X(92)90068-L"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-014-9295-6"},{"key":"e_1_3_2_1_7_1","first-page":"143","volume-title":"2016 6th International Conference on","author":"Karmoshi S.","year":"2016","unstructured":"S. Karmoshi , A. Hawbani , A. Ghannami , S. Mohammed , and M. Zhu , \" VNE-Greedy: Virtual Network Embedding Algorithm Based on OpenStack Cloud Computing Platform,\" in Digital Home (ICDH) , 2016 6th International Conference on , 2016 , pp. 143 -- 149 : IEEE. S. Karmoshi, A. Hawbani, A. Ghannami, S. Mohammed, and M. Zhu, \"VNE-Greedy: Virtual Network Embedding Algorithm Based on OpenStack Cloud Computing Platform,\" in Digital Home (ICDH), 2016 6th International Conference on, 2016, pp. 143--149: IEEE."},{"key":"e_1_3_2_1_8_1","unstructured":"An OpenFlow Programmable Patch Panel. Available: http:\/\/www.projectfloodlight.org\/blog\/2012\/05\/24\/openflow-patch-panel\/ An OpenFlow Programmable Patch Panel. Available: http:\/\/www.projectfloodlight.org\/blog\/2012\/05\/24\/openflow-patch-panel\/"},{"key":"e_1_3_2_1_9_1","volume-title":"ZooKeeper: Wait-free Coordination for Internet-scale Systems,\" in USENIX annual technical conference","author":"Hunt P.","year":"2010","unstructured":"P. Hunt , M. Konar , F. P. Junqueira , and B. Reed , \" ZooKeeper: Wait-free Coordination for Internet-scale Systems,\" in USENIX annual technical conference , 2010 , vol. 8 , no. 9: Boston, MA, USA. P. Hunt, M. Konar, F. P. Junqueira, and B. Reed, \"ZooKeeper: Wait-free Coordination for Internet-scale Systems,\" in USENIX annual technical conference, 2010, vol. 8, no. 9: Boston, MA, USA."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1953.tb01433.x"},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"2017 3rd International Conference of","author":"Wang S.","year":"2017","unstructured":"S. Wang , Q. Wang , H. Zhang , and J. Li , \" Using branch-and-price to maximize redundant network utilization in cloud datacenter,\" in Cloud Computing Technologies and Applications (CloudTech) , 2017 3rd International Conference of , 2017 , pp. 1 -- 8 : IEEE. S. Wang, Q. Wang, H. Zhang, and J. Li, \"Using branch-and-price to maximize redundant network utilization in cloud datacenter,\" in Cloud Computing Technologies and Applications (CloudTech), 2017 3rd International Conference of, 2017, pp. 1--8: IEEE."},{"key":"e_1_3_2_1_12_1","volume-title":"Nxt-Max: for supporting VDC-based maximum redundant bandwidth allocation in cloud datacenter,\" Cluster Computing","author":"Shuo W.","year":"2018","unstructured":"W. Shuo , L. Jing , W. Qiqi , and Z. Hongjie , \" Nxt-Max: for supporting VDC-based maximum redundant bandwidth allocation in cloud datacenter,\" Cluster Computing , 2018 . W. Shuo, L. Jing, W. Qiqi, and Z. Hongjie, \"Nxt-Max: for supporting VDC-based maximum redundant bandwidth allocation in cloud datacenter,\" Cluster Computing, 2018."},{"key":"e_1_3_2_1_13_1","first-page":"1373","volume-title":"Towards reproducible performance studies of datacenter network architectures using an open-source simulation approach,\" in 2013 IEEE Global Communications Conference (GLOBECOM)","author":"Wong D.","year":"2013","unstructured":"D. Wong , K. T. Seow , C. H. Foh , and R. Kanagavelu , \" Towards reproducible performance studies of datacenter network architectures using an open-source simulation approach,\" in 2013 IEEE Global Communications Conference (GLOBECOM) , 2013 , pp. 1373 -- 1378 : IEEE. D. Wong, K. T. Seow, C. H. Foh, and R. Kanagavelu, \"Towards reproducible performance studies of datacenter network architectures using an open-source simulation approach,\" in 2013 IEEE Global Communications Conference (GLOBECOM), 2013, pp. 1373--1378: IEEE."}],"event":{"name":"HP3C '19: 2019 the 3rd International Conference on High Performance Compilation, Computing and Communications","acronym":"HP3C '19","location":"Xi'an China"},"container-title":["Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318265.3318290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318265.3318290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:24Z","timestamp":1750208544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318265.3318290"}},"subtitle":["cloud datacenters network resource allocation"],"short-title":[],"issued":{"date-parts":[[2019,3,8]]},"references-count":13,"alternative-id":["10.1145\/3318265.3318290","10.1145\/3318265"],"URL":"https:\/\/doi.org\/10.1145\/3318265.3318290","relation":{},"subject":[],"published":{"date-parts":[[2019,3,8]]},"assertion":[{"value":"2019-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}