{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:45Z","timestamp":1764996945043,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,6,26]],"date-time":"2012-06-26T00:00:00Z","timestamp":1340668800000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2012,6,26]]},"abstract":"<jats:p>\n            Application performance in cloud data centers often depends crucially on network bandwidth, not just the aggregate data transmitted as in typical SLAs. We describe a mechanism for data center networks called\n            <jats:italic>NetShare<\/jats:italic>\n            that requires no hardware changes to routers but allows bandwidth to be allocated predictably across services based on weights. The weights are either specified by a manager, or automatically assigned at each switch port based on a virtual machine heuristic for isolation. Bandwidth unused by a service is shared proportionately by other services, providing weighted hierarchical max-min fair sharing. On a testbed of Fulcrum switches, we demonstrate that NetShare provides bandwidth isolation in various settings, including multipath networks.\n          <\/jats:p>","DOI":"10.1145\/2317307.2317309","type":"journal-article","created":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T11:53:04Z","timestamp":1341316384000},"page":"5-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Netshare and stochastic netshare"],"prefix":"10.1145","volume":"42","author":[{"given":"Vinh The","family":"Lam","sequence":"first","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Sivasankar","family":"Radhakrishnan","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Rong","family":"Pan","sequence":"additional","affiliation":[{"name":"Cisco Systems, San Jose, CA, USA"}]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"George","family":"Varghese","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,6,26]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Fulcrum Monacofootnotesize http:\/\/www.fulcrummicro.com\/.  Fulcrum Monacofootnotesize http:\/\/www.fulcrummicro.com\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_2_1_3_1","volume-title":"Data Networks. P. H","author":"Bertsekas D.","year":"1992","unstructured":"D. Bertsekas and R. Gallager . Data Networks. P. H ., 1992 . D. Bertsekas and R. Gallager. Data Networks. P. H., 1992."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921188"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.413212"},{"volume-title":"Proc. OSDI '10","author":"Gulati Ajay","key":"e_1_2_1_8_1","unstructured":"Ajay Gulati , Arif Merchant , and Peter Varman . mClock : Handling Throughput Variability for Hypervisor IO Scheduling . In Proc. OSDI '10 . Ajay Gulati, Arif Merchant, and Peter Varman. mClock: Handling Throughput Variability for Hypervisor IO Scheduling. In Proc. OSDI '10."},{"key":"e_1_2_1_9_1","volume":"199","author":"Hahne Ellen L.","unstructured":"Ellen L. Hahne . Round-robin scheduling for max-min fairness in data networks. IEEE J. Comms , 199 1. Ellen L. Hahne. Round-robin scheduling for max-min fairness in data networks. IEEE J. Comms, 1991.","journal-title":"IEEE J. Comms"},{"key":"e_1_2_1_10_1","volume-title":"USENIX INM\/WREN","author":"Kim W.","year":"2010","unstructured":"W. Kim and et al. Automated and scalable qos control for network convergence . In USENIX INM\/WREN , 2010 . W. Kim and et al. Automated and scalable qos control for network convergence. In USENIX INM\/WREN, 2010."},{"key":"e_1_2_1_12_1","unstructured":"P. McKenney. Stochastic fairness queueing. In Internetworking 1991.  P. McKenney. Stochastic fairness queueing. In Internetworking 1991."},{"key":"e_1_2_1_13_1","volume-title":"Bob Olsen. Approximate Fair Bandwidth Allocation: A Method for Simple and Flexible Traffic Management. In 46th Allerton Conf.","author":"Pan Rong","year":"2008","unstructured":"Rong Pan , Balaji Prabhakar , Flavio Bonomi , and Bob Olsen. Approximate Fair Bandwidth Allocation: A Method for Simple and Flexible Traffic Management. In 46th Allerton Conf. , 2008 . Rong Pan, Balaji Prabhakar, Flavio Bonomi, and Bob Olsen. Approximate Fair Bandwidth Allocation: A Method for Simple and Flexible Traffic Management. In 46th Allerton Conf., 2008."},{"volume-title":"Proc. OSDI'10","author":"Sherwood Rob","key":"e_1_2_1_14_1","unstructured":"Rob Sherwood , Glen Gibb , Kok-Kiong Yap , Guido Appenzeller , Martin Casado , Nick McKeown , and Guru Parulkar . Can the Production Network Be the Testbed? In Proc. OSDI'10 . Rob Sherwood, Glen Gibb, Kok-Kiong Yap, Guido Appenzeller, Martin Casado, Nick McKeown, and Guru Parulkar. Can the Production Network Be the Testbed? In Proc. OSDI'10."},{"volume-title":"Changhoon Kim. Seawall: Performance Isolation in Cloud Datacenter Networks. In Proc. HotCloud'10","author":"Shieh Alan","key":"e_1_2_1_15_1","unstructured":"Alan Shieh , Srikanth Kandula , Albert Greenberg , and Changhoon Kim. Seawall: Performance Isolation in Cloud Datacenter Networks. In Proc. HotCloud'10 . Alan Shieh, Srikanth Kandula, Albert Greenberg, and Changhoon Kim. Seawall: Performance Isolation in Cloud Datacenter Networks. In Proc. HotCloud'10."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/217382.217453"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2317307.2317309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2317307.2317309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:53Z","timestamp":1750238453000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2317307.2317309"}},"subtitle":["predictable bandwidth allocation for data centers"],"short-title":[],"issued":{"date-parts":[[2012,6,26]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6,26]]}},"alternative-id":["10.1145\/2317307.2317309"],"URL":"https:\/\/doi.org\/10.1145\/2317307.2317309","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2012,6,26]]},"assertion":[{"value":"2012-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}