On-line admission control and packet scheduling with interleaving

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2002, Pages 94-103

  Garay, Juan A ^a   Naor, Joseph Seffi ^b   Yener, Bülent ^c   Zhao, Peng ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b NOKIA RESEARCH CENTER   (United States)

^c BOGAZICI UNIVERSITY   (Turkey)

^d EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ONLINE SYSTEMS; PACKET NETWORKS; QUALITY OF SERVICE; ROUTERS; SCHEDULING; SERVERS;

ADMISSION CONTROL; JOB INTERLEAVING; PACKET SCHEDULING;

DATA COMMUNICATION SYSTEMS;

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

References (18)

1. Quality of service in IP networks
2. A 2-approximation algorithm for the undirected feedback vertex set problem
3. A local-ratio theorem for approximating the weighted vertex cover problem
4. Scheduling for overload in real-time systems
5. On the competitiveness of online real-time task scheduling
6. Online real-time preemptive scheduling of jobs with deadlines on multiple machines
7. Competitive analysis of call admission algorithms that allow delay
8. Patience is a virtue: The effect of slack on competitiveness for admission control
9. Optimal multiplexing on a single link: Delay and buffer requirements
10. Computers and intractability: A guide to the theory of NP-completeness
11. Data-over-cable service interface specification radio frequency interface specification SP-RFIv1.1-101-990311
12. Computational complexity of approximation algorithms for combinatorial problems
13. Online scheduling with hard deadlines
14. Exact admission control for networks with a bounded delay service