{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:55Z","timestamp":1772164075888,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,17]]},"DOI":"10.1145\/2785956.2787478","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T10:09:20Z","timestamp":1440410960000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":122,"title":["BwE"],"prefix":"10.1145","author":[{"given":"Alok","family":"Kumar","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Sushant","family":"Jain","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Uday","family":"Naik","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Anand","family":"Raghuraman","sequence":"additional","affiliation":[{"name":"Premise Data Corporation, San Francisco, CA, USA"}]},{"given":"Nikhil","family":"Kasinadhuni","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Enrique Cauich","family":"Zermeno","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"C. Stephen","family":"Gunn","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Jing","family":"Ai","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Bj\u00f6rn","family":"Carlin","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Mihai","family":"Amarandei-Stavila","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Mathieu","family":"Robin","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Aspi","family":"Siganporia","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Stephen","family":"Stuart","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Wikipedia: Differentiated services. http:\/\/en.wikipedia.org\/wiki\/Differentiated_services.  Wikipedia: Differentiated services. http:\/\/en.wikipedia.org\/wiki\/Differentiated_services."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.905605"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316220"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_3_2_2_5_1","volume-title":"December","author":"Blake S.","year":"1998","unstructured":"Blake , S. , Black , D. , Carlson , M. , Davies , E. , Wang , Z. , and Weiss , W . An Architecture for Differentiated Service. RFC 2475 (Informational) , December 1998 . Updated by RFC 3260. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., and Weiss, W. An Architecture for Differentiated Service. RFC 2475 (Informational), December 1998. Updated by RFC 3260."},{"key":"e_1_3_2_2_6_1","volume-title":"Rate adaptation, congestion control and fairness: A tutorial","author":"Boudec J.-Y.","year":"2000","unstructured":"Boudec , J.-Y. Rate adaptation, congestion control and fairness: A tutorial , 2000 . Boudec, J.-Y. Rate adaptation, congestion control and fairness: A tutorial, 2000."},{"key":"e_1_3_2_2_7_1","volume-title":"September","author":"Braden R.","year":"1997","unstructured":"Braden , R. , Zhang , L. , Berson , S. , Herzog , S. , and Jamin , S . Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification. RFC 2205 (Proposed Standard) , September 1997 . Updated by RFCs 2750, 3936, 4495. Braden, R., Zhang, L., Berson, S., Herzog, S., and Jamin, S. Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification. RFC 2205 (Proposed Standard), September 1997. Updated by RFCs 2750, 3936, 4495."},{"key":"e_1_3_2_2_8_1","volume-title":"INFOCOM","author":"Cao Z.","year":"1999","unstructured":"Cao , Z. , and Zegura , E. W . Utility max-min: An application-oriented bandwidth allocation scheme . In INFOCOM ( 1999 ). Cao, Z., and Zegura, E. W. Utility max-min: An application-oriented bandwidth allocation scheme. In INFOCOM (1999)."},{"key":"e_1_3_2_2_9_1","first-page":"227","volume-title":"Distributed Computing Systems, 2001. 21st International Conference on. (Apr","author":"Choi B.-K.","year":"2001","unstructured":"Choi , B.-K. , and Bettati , R . Endpoint admission control: network based approach . In Distributed Computing Systems, 2001. 21st International Conference on. (Apr 2001 ), pp. 227 -- 235 . Choi, B.-K., and Bettati, R. Endpoint admission control: network based approach. In Distributed Computing Systems, 2001. 21st International Conference on. (Apr 2001), pp. 227--235."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/55482.55520"},{"key":"e_1_3_2_2_11_1","first-page":"837","volume-title":"Upward Max Min Fairness. In INFOCOM","author":"Danna E.","year":"2012","unstructured":"Danna , E. , Hassidim , A. , Kaplan , H. , Kumar , A. , Mansour , Y. , Raz , D. , and Segalov , M . Upward Max Min Fairness. In INFOCOM ( 2012 ), pp. 837 -- 845 . Danna, E., Hassidim, A., Kaplan, H., Kumar, A., Mansour, Y., Raz, D., and Segalov, M. Upward Max Min Fairness. In INFOCOM (2012), pp. 837--845."},{"key":"e_1_3_2_2_12_1","first-page":"846","volume-title":"A Practical Algorithm for Balancing the Max-min Fairness and Throughput Objectives in Traffic Engineering. In Proc. INFOCOM (March","author":"Danna E.","year":"2012","unstructured":"Danna , E. , Mandal , S. , and Singh , A . A Practical Algorithm for Balancing the Max-min Fairness and Throughput Objectives in Traffic Engineering. In Proc. INFOCOM (March 2012 ), pp. 846 -- 854 . Danna, E., Mandal, S., and Singh, A. A Practical Algorithm for Balancing the Max-min Fairness and Throughput Objectives in Traffic Engineering. In Proc. INFOCOM (March 2012), pp. 846--854."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921188"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_2_18_1","first-page":"297","volume-title":"Proc. of NSDI","author":"Jeyakumar V.","year":"2013","unstructured":"Jeyakumar , V. , Alizadeh , M. , Mazieres , D. , Prabhakar , B. , Kim , C. , and Greenberg , A . Eyeq: Practical network performance isolation at the edge . In Proc. of NSDI ( 2013 ), USENIX Association , pp. 297 -- 312 . Jeyakumar, V., Alizadeh, M., Mazieres, D., Prabhakar, B., Kim, C., and Greenberg, A. Eyeq: Practical network performance isolation at the edge. In Proc. of NSDI (2013), USENIX Association, pp. 297--312."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626336"},{"key":"e_1_3_2_2_20_1","volume-title":"NetShare: Virtualizing data center networks across services. Tech. rep","author":"Lam T.","year":"2010","unstructured":"Lam , T. , Radhakrishnan , S. , Vahdat , A. , and Varghese , G . NetShare: Virtualizing data center networks across services. Tech. rep ., 2010 . Lam, T., Radhakrishnan, S., Vahdat, A., and Varghese, G. NetShare: Virtualizing data center networks across services. Tech. rep., 2010."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2012007"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/599927"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070584"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486027"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282419"},{"key":"e_1_3_2_2_26_1","volume-title":"Workshop on I\/O Virtualization","author":"Rodrigues H.","year":"2011","unstructured":"Rodrigues , H. , Santos , J. , Turner , Y. , Soares , P. , and Guedes , D . Gatekeeper: Supporting bandwidth guarantees for multi-tenant datacenter networks . In Workshop on I\/O Virtualization ( 2011 ). Rodrigues, H., Santos, J., Turner, Y., Soares, P., and Guedes, D. Gatekeeper: Supporting bandwidth guarantees for multi-tenant datacenter networks. In Workshop on I\/O Virtualization (2011)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948237"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/357401.357402"},{"key":"e_1_3_2_2_29_1","volume-title":"The networked physical world--proposals for engineering the next generation of computing, commerce & automatic identification. White Paper","author":"Sarma S.","year":"2000","unstructured":"Sarma , S. , Brock , D. L. , and Ashton , K . The networked physical world--proposals for engineering the next generation of computing, commerce & automatic identification. White Paper , Auto-ID Center , MIT. Designed b y Foxner. www. foxner. com ( 2000 ). Sarma, S., Brock, D. L., and Ashton, K. The networked physical world--proposals for engineering the next generation of computing, commerce & automatic identification. White Paper, Auto-ID Center, MIT. Designed b y Foxner. www. foxner. com (2000)."},{"key":"e_1_3_2_2_30_1","volume-title":"NSDI","author":"Shieh A.","year":"2011","unstructured":"Shieh , A. , Kandula , S. , Greenberg , A. , Kim , C. , and Saha , B . Sharing the data center network . In NSDI ( 2011 ). Shieh, A., Kandula, S., Greenberg, A., Kim, C., and Saha, B. Sharing the data center network. In NSDI (2011)."}],"event":{"name":"SIGCOMM '15: ACM SIGCOMM 2015 Conference","location":"London United Kingdom","acronym":"SIGCOMM '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2785956.2787478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:42:38Z","timestamp":1750210958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787478"}},"subtitle":["Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing"],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":30,"alternative-id":["10.1145\/2785956.2787478","10.1145\/2785956"],"URL":"https:\/\/doi.org\/10.1145\/2785956.2787478","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2829988.2787478","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,17]]},"assertion":[{"value":"2015-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}