2026-09-22T07:54:03Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81339 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Vaduvur Bharghavan Lu, Songwu 2015-09-25T20:10:39Z 2015-09-25T20:10:39Z 10000-01-01 2000 2000 We compare our proposed three algorithms with four other wireless fair scheduling algorithms in this area, and we conclude through both simulations and analysis that WFS is one of the two algorithms that possess all the properties of wireless fair service. Made available in DSpace on 2015-09-25T20:10:39Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9971125.pdf: 8091491 bytes, checksum: c0f43d8fd39f85b91cbff0405380de53 (MD5) Previous issue date: 2000 Embargo set by: Seth Robbins for item 82620 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 145 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000. http://hdl.handle.net/2142/81339 (MiAaPQ)AAI9971125 eng Computer Science Design and Evaluation of Packet Scheduling Algorithms for Providing Quality of Service in Wireless Cellular Networks text Electrical Engineering Electrical Engineering University of Illinois at Urbana-Champaign Dissertation Ph.D.