{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:08:51Z","timestamp":1730268531482,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935053","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"2345-2353","source":"Crossref","is-referenced-by-count":3,"title":["Maximizing throughput in wireless networks with finite internal buffers"],"prefix":"10.1109","author":[{"given":"Ching-Min","family":"Lien","sequence":"first","affiliation":[]},{"given":"Cheng-Shang","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Jay","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Duan-Shin","family":"Lee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/90.298432"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.1995.540168"},{"key":"ref12","article-title":"On the complexity of scheduling in wireless networks","author":"sharma","year":"2006","journal-title":"MOBICOM 2006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref4","article-title":"Stable scheduling policies for maximizing throughput in generalized constrained queueing networks","author":"chaporkar","year":"2006","journal-title":"Proceedings of IEEE Infocom"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061983"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900402"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.30"},{"key":"ref8","article-title":"Generalized Dynamic Frame Sizing Algorithm for Finite-Internal-Buffered Networks","volume":"13","author":"lien","year":"2009","journal-title":"IEEE Communication Letters"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462026"},{"article-title":"Introduction to Graph Theory","year":"2001","author":"west","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0459-9"},{"key":"ref9","article-title":"Multi-cast traffic in input-queued switches: optimal scheduling and maximum throughput","volume":"11","author":"marsan","year":"2003","journal-title":"IEEE IACM Transactions on Networking"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935053.pdf?arnumber=5935053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T07:26:46Z","timestamp":1490081206000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935053\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935053","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}