{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:43:09Z","timestamp":1774021389149,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Key Basic Research Program of China","award":["2012CB315802"],"award-info":[{"award-number":["2012CB315802"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61379133"],"award-info":[{"award-number":["61379133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Foundation of State key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications)","award":["SKLNST-2013-1-15"],"award-info":[{"award-number":["SKLNST-2013-1-15"]}]},{"name":"Outstanding Young Scientist Foundation of CAS"},{"name":"RICOH"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/tnsm.2016.2517087","type":"journal-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T20:47:27Z","timestamp":1452631647000},"page":"5-18","source":"Crossref","is-referenced-by-count":46,"title":["Adaptive Path Isolation for Elephant and Mice Flows by Exploiting Path Diversity in Datacenters"],"prefix":"10.1109","volume":"13","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kave","family":"Salamatian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongcheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592806"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848094"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018467"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626309"},{"key":"ref31","first-page":"132","article-title":"Scheduling algorithms for CIOQ switches","author":"pappu","year":"0","journal-title":"Proc 20th IEEE Int Conf Netw Protocols (ICNP)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626305"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018443"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342388"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2009.4917884"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535397"},{"key":"ref10","article-title":"Sizing router buffers","author":"appenzeller","year":"2005"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015499"},{"key":"ref12","first-page":"455","article-title":"Information-agnostic flow scheduling for commodity data centers","author":"bai","year":"0","journal-title":"Proc 12th USENIX Symp Netw Syst Des Implement (NSDI"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535384"},{"key":"ref16","first-page":"390","article-title":"The case for evaluating mapreduce performance using workload suites","author":"chen","year":"0","journal-title":"Proc 19th Int Symp Model Anal Simul Comput Telecommun Syst (MASCOTS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934956"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018466"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379048"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"ref27","first-page":"141","author":"kelly","year":"1996","journal-title":"Notes on effective bandwidth"},{"key":"ref3","article-title":"Routing bridges: Base protocol specification","year":"2011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018444"},{"key":"ref5","first-page":"19","article-title":"Hedera: Dynamic flow scheduling for data center networks","volume":"10","author":"al-fares","year":"0","journal-title":"Proc Netw Syst Des Implement (NSDI)"},{"key":"ref8","first-page":"19","article-title":"Less is more: Trading a little bandwidth for ultra-low latency in the data center","author":"alizadeh","year":"0","journal-title":"Proc Netw Syst Des Implementation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"ref2","year":"2015","journal-title":"Service Level Agreement for VMware Vcloud Air"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"ref1","year":"2015","journal-title":"Open Vswitch"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.17487\/rfc2679","article-title":"A one-way delay metric for IPPM","author":"almes","year":"1999"},{"key":"ref22","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref21","article-title":"pHost: Distributed near-optimal datacenter transport over commodity network fabric","author":"gao","year":"0","journal-title":"Proc ACM Conf Emerging Network Experiment and Technology (CoNEXT)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342389"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.17487\/rfc2992","article-title":"Analysis of an equal-cost multi-path algorithm","author":"hopps","year":"2000"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/7429995\/07378988.pdf?arnumber=7378988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:34Z","timestamp":1642003354000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7378988\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":40,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2016.2517087","relation":{},"ISSN":["1932-4537"],"issn-type":[{"value":"1932-4537","type":"print"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}