Base station scheduling of requests with fixed deadlines

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2002, Pages 487-496

  Agarwal, Mohit ^a   Puri, Anuj ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CARRIER COMMUNICATION; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; FADING (RADIO); MOBILE RADIO SYSTEMS; PACKET NETWORKS; RADIO STATIONS; SCHEDULING;

BASE STATION; ONLINE MAXIMAL DELAY ALGORITHM;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036349226     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2002.1019293     Document Type: Article

References (22)

1. An optimal algorithm for online bipartite matching
2. Amortized efficiency of list update and paging rules
3. Competitive snoopy paging
4. Online interval scheduling
5. Patience is a virtue: The effect of slack on competitiveness for admission control
6. On the power of randomization in online algorithms
7. Enhancing throughput over wireless LANs using channel state dependent packet scheduling
8. Fair scheduling in wireless packet networks
9. Downlink scheduling in CDMA data networks
10. Adaptive allocation of CDMA resources for network level QoS assurances
11. Online scheduling - A survey
12. On the competitiveness of on-line real-time scheduling
13. Packet fair queueing scheduling based on multirate multipath-transparent CDMA for wireless networks
14. Online weighted bipartite matching
15. CDMA/HDR: A bandwidth efficient high speed wireless data service for nomadic users
16. Online matching for scheduling problems
17. Scheduling and IPC mechanisms for continuous media
18. On the competitiveness of online scheduling of unit length packets with hard deadlines in slotted time