{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T22:45:05Z","timestamp":1776465905291,"version":"3.51.2"},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1389-1286(02)00401-2","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:07:37Z","timestamp":1043939257000},"page":"451-474","source":"Crossref","is-referenced-by-count":383,"title":["A framework for opportunistic scheduling in wireless networks"],"prefix":"10.1016","volume":"41","author":[{"given":"Xin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin K.P.","family":"Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ness B.","family":"Shroff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(02)00401-2_BIB1","doi-asserted-by":"crossref","unstructured":"M. Agarwal, A. Puri, Base station scheduling of requests with fixed deadlines, in: Proceedings of IEEE INFOCOM 2002, IEEE, 2002","DOI":"10.1109\/INFCOM.2002.1019293"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB2","unstructured":"M. Andrews, S. Borst, F. Dominique, P. Jelenkovic, K. Kumaran, K. Ramakrishnan, P. Whiting, Dynamic bandwidth allocation algorithms for high-speed data wireless networks, Bell Labs Technical Report, 2000"},{"issue":"2","key":"10.1016\/S1389-1286(02)00401-2_BIB3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/35.900644","article-title":"Providing quality of service over a shared wireless link","volume":"39","author":"Andrews","year":"2001","journal-title":"IEEE Communications Magazine"},{"issue":"7","key":"10.1016\/S1389-1286(02)00401-2_BIB4","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/35.852034","article-title":"CDMA\/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users","volume":"38","author":"Bender","year":"2000","journal-title":"IEEE Communications Magazine"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB5","series-title":"Data Networks","author":"Bertsekas","year":"1987"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB6","unstructured":"S. Borst, P. Whiting, Dynamic rate control algorithms for CDMA throughput optimization, in: Proceedings of IEEE Infocom 2001, Alaska, April 2001"},{"issue":"1","key":"10.1016\/S1389-1286(02)00401-2_BIB7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/5.904507","article-title":"Scheduling algorithms in broadband wireless networks","volume":"89","author":"Cao","year":"200l","journal-title":"Proceedings of the IEEE"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB8","article-title":"Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system","volume":"vol. 3","author":"Jalali","year":"2000"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","article-title":"Charging and rate control for elastic traffic","volume":"8","author":"Kelly","year":"1997","journal-title":"European Transactions on Telecommunications"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB10","series-title":"Stochastic Approximation Algorithms and Applications","author":"Kushner","year":"1997"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB11","unstructured":"X. Liu, Opportunistic scheduling in wireless communication networks, Ph.D. Thesis, Purdue University, 2002"},{"issue":"10","key":"10.1016\/S1389-1286(02)00401-2_BIB12","doi-asserted-by":"crossref","DOI":"10.1109\/49.957318","article-title":"Opportunistic transmission scheduling with resource-sharing constraints in wireless networks","volume":"19","author":"Liu","year":"2001","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"10.1016\/S1389-1286(02)00401-2_BIB13","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1109\/90.793003","article-title":"Fair scheduling in wireless packet networks","volume":"7","author":"Lu","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB14","doi-asserted-by":"crossref","unstructured":"T. Nandagopal, S. Lu, V. Bharghavan, A unified architecture for the design and evaluation of wireless fair queueing algorithms, in: Proceedings of ACM Mobicom 1999, August 1999","DOI":"10.1145\/313451.313520"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB15","doi-asserted-by":"crossref","unstructured":"T. Ng, I. Stoica, H. Zhang, Packet fair queueing algorithms for wireless networks with location-dependent errors, in: Proceedings of IEEE INFOCOM 1998, vol. 3, New York, 1998","DOI":"10.1109\/INFCOM.1998.662920"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB16","doi-asserted-by":"crossref","unstructured":"S. Shakkottai, R. Srikant, Scheduling real-time traffic with deadlines over a wireless channel, in: Proceedings of ACM Workshop on Wireless and Mobile Multimedia, Seattle, WA, August 1999","DOI":"10.1145\/313256.313273"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB17","doi-asserted-by":"crossref","unstructured":"S. Shakkottai, A. Stolyar, Scheduling algorithms for a mixture of real-time and non-real-time data in HDR, Bell Laboratories Technical Report, 2000","DOI":"10.1016\/S1388-3437(01)80170-0"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB18","doi-asserted-by":"crossref","unstructured":"S. Shakkottai and A. Stolyar, Scheduling for multiple flows sharing a time-varying channel: the exponential rule, Translations of the AMS, 2001 (a volume in memory of F. Karpelevich)","DOI":"10.1090\/trans2\/207\/12"},{"key":"10.1016\/S1389-1286(02)00401-2_BIB19","series-title":"Principles of Mobile Communication","author":"Stuber","year":"1996"},{"issue":"6","key":"10.1016\/S1389-1286(02)00401-2_BIB20","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1109\/TIT.2002.1003822","article-title":"Opportunistic beamforming using dumb antennas","volume":"48","author":"Viswanath","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"10.1016\/S1389-1286(02)00401-2_BIB21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01219775","article-title":"Weighted averaging and stochastic approximation","volume":"1","author":"Wang","year":"1997","journal-title":"Mathematics of Control, Signals, and Systems"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602004012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602004012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:47:43Z","timestamp":1583995663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128602004012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S1389128602004012"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(02)00401-2","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}