Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds
Authors:
- 14 July 2004
- journal article
- Published by Elsevier in Computer Networks
- Vol. 46 (4) , 505-518
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Traffic aided opportunistic scheduling for wireless networks: algorithms and performance boundsComputer Networks, 2004
- Size-based scheduling to improve web performanceACM Transactions on Computer Systems, 2003
- A framework for opportunistic scheduling in wireless networksComputer Networks, 2003
- Opportunistic beamforming using dumb antennasIEEE Transactions on Information Theory, 2002
- File transmission over wireless fast fading downlinkIEEE Transactions on Information Theory, 2002
- Opportunistic transmission scheduling with resource-sharing constraints in wireless networksIEEE Journal on Selected Areas in Communications, 2001
- Providing quality of service over a shared wireless linkIEEE Communications Magazine, 2001
- Self-similarity in World Wide Web traffic: evidence and possible causesIEEE/ACM Transactions on Networking, 1997
- Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source levelIEEE/ACM Transactions on Networking, 1997
- The Queue M/G/1 with the Shortest Remaining Processing Time DisciplineOperations Research, 1966