{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:43:10Z","timestamp":1729629790271,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/glocom.2011.6134433","type":"proceedings-article","created":{"date-parts":[[2012,1,30]],"date-time":"2012-01-30T21:45:17Z","timestamp":1327959917000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Queue-Length Proportional and Max-Min Fair Bandwidth Allocation for Best Effort Flows"],"prefix":"10.1109","author":[{"given":"T.","family":"Cheocherngngarn","sequence":"first","affiliation":[]},{"given":"J.","family":"Andrian","sequence":"additional","affiliation":[]},{"family":"Zhenyu Yang","sequence":"additional","affiliation":[]},{"family":"Deng Pan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1022848304724","article-title":"Fair scheduling for input buffered switches","volume":"6","author":"ni","year":"2003","journal-title":"Cluster Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810495"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1995.515971"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/143365.143495"},{"key":"ref14","article-title":"Practical algorithms for performance guarantees in buffered crossbars","author":"chuang","year":"0","journal-title":"IEEE INFOCOM"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810532"},{"key":"ref16","article-title":"Providing flow based performance guarantees for buffered crossbar switches","author":"pan","year":"2008","journal-title":"IEEE IPDPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258922"},{"key":"ref4","article-title":"Credit based fair scheduling for packet switched networks","author":"pan","year":"0","journal-title":"IEEE INFOCOM"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1992.263509"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370242"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70746"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.140"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TNET.2007.900402","article-title":"On guaranteed smooth switching for buffered crossbar switches","volume":"16","author":"min he","year":"0","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.135"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"}],"event":{"name":"2011 IEEE Global Communications Conference (GLOBECOM 2011)","start":{"date-parts":[[2011,12,5]]},"location":"Houston, TX, USA","end":{"date-parts":[[2011,12,9]]}},"container-title":["2011 IEEE Global Telecommunications Conference - GLOBECOM 2011"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6132211\/6133457\/06134433.pdf?arnumber=6134433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T13:31:51Z","timestamp":1497965511000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6134433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/glocom.2011.6134433","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}