(Enter summary)
Abstract: This paper presents a comprehensive study of the effect of job
interleaving by preemption on the throughput of a single server where requests
arrive with a given processing time and slack. The problem is to
decide which requests to serve so as to maximize the server's utilization.
This simple model captures many situations, both at the application (e.g.,
delivery of video) as well as at the network/transmission levels (e.g., scheduling
of packets from input to output interface of a switch). The ... (Update)
Cited by: More
Packet-Mode Policies for Input-Queued Switches - Guez, Kesselman, Rosen (2004)
(Correct)
Similar documents (at the sentence level):
56.4%: On-line Admission Control and Packet Scheduling with.. - Garay, Naor, Yener, Zhao (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Competitive On-line Switching Policies - Bar-Noy, Freund, Landa, Naor (2002)
(Correct)
0.3: An Efficient Signaling Structure for ATM Networks - Dakang Wu
(Correct)
0.2: Simple Algorithms for a Weighted Interval Selection Problem - Erlebach, Spieksma (2000)
(Correct)
Similar documents based on text: More All
0.2: Power Optimal Connectivity and Coverage in Wireless.. - Inanc, Magdon-Ismail..
(Correct)
0.1: Efficient On-Line Call Control Algorithms - Garay, Gopal, Kutten, Mansour.. (1993)
(Correct)
0.1: Batch Verification with Applications to Cryptography and.. - Bellare, Garay, Rabin
(Correct)
BibTeX entry: (Update)
J. A. Garay, J. Naor, B. Yener and Peng Zhao, "On-line Admission Control and Packet Scheduling with Interleaving," Proceedings of INFOCOM 2002. http://citeseer.ist.psu.edu/garay02line.html More
@misc{ garay02line,
author = "J. Garay and J. Naor and B. Yener and P. Zhao",
title = "line Admission Control and Packet Scheduling with Interleaving",
text = "J. A. Garay, J. Naor, B. Yener and Peng Zhao, On-line Admission Control
and Packet Scheduling with Interleaving, Proceedings of INFOCOM 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/garay02line.html" }
Citations (may not include all citations):
4212
Computers and intractability: a guide to the theory of NP-co.. (context) - GAREY, JOHNSON - 1979
280
Online Computation and Competitive Analysis (context) - BORODIN, EL-YANIV - 1998 ACM
140
Exact admission control for networks with a bounded delay se..
- LIEBEHERR, WREGE et al. ACM DBLP
69
Optimal multiplexing on a single link: Delay and buffer requ..
- GEORGIADIS, GU et al. - 1997
65
Performance Guarantees in Communication Networks (context) - CHANG - 2000 ACM
32
A local-ratio theorem for approximating the weighted vertex .. (context) - BAR-YEHUDA, EVEN - 1985
14
approximation algorithm for the undirected feedback vertex s.. (context) - BAFNA, BERMAN et al. - 1999
12
Scheduling for overload in real-time systems
- BARUAH, HARITSA - 1997
11
the competitiveness of online real-time task scheduling (context) - BARUAH, KOREN et al. - 1992
10
Patience is a virtue: the effect of slack on competitiveness..
- GOLDWASSER - 1999
10
Computational complexity of approximation algorithms for com.. (context) - GENS, LEVNER - 1979
6
Online scheduling with hard deadlines (context) - GOLDMAN, PARWATIKAR et al. - 2000 ACM DBLP
4
Online real-time preemptive scheduling of jobs with deadline..
- DASGUPTA, PALIS - 2001
3
Competitive analysis of call admission algorithms that allow..
- FELDMAN, MAGGS et al. - 1995
3
Quality of service in IP networks (context) - ARMITAGE - 2000 ACM
http://www.intel.com/
http://Atlanta.web.lucent.com
Documents on the same site (http://www.ieee-infocom.org/2002/technical_programs.htm): More
Avoiding Instability during Graceful Shutdown of OSPF - Shaikh, Dube, Varma (2002)
(Correct)
Downlink Resource Allocation and Pricing for Wireless Networks - Marbach, Berry (2002)
(Correct)
Joint Scheduling and Power Control for Wireless Ad-hoc Networks - ElBatt, Ephremides (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC