Anja Feldmann, Bruce Maggs, Jiri Sgall, Daniel D. Sleator, Andrew Tomkins  Home/Search
Context Related
| math.cas.cz/~sgall/ps/calladm.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.cas.cz/~sgall/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents an analysis of several on-line algorithms, called call admission algorithms, for processing requests for connections in distributed networks. Each request comes with a source, a destination, and a bandwidth requirement. The call admission algorithm decides whether to accept the request, and if so, when to schedule it and which path the connection should use through the network. The duration of the request is unknown to the algorithm when the request is made. We analyze the... (Update)
Context of citations to this paper: More
.... Feldman et al. study the requirement that slack time be proportional to processing time in the context of call control on networks [8]. In contrast to our results, they show that this additional requirement cannot be used to asymptotically improve the competitiveness of...
...such as video, voice, and multimedia. Consequently, there has been considerable recent work on non preemptive admission control [1, 12, 3, 2, 4, 7]. Our work is most closely related to, and a generalization of, Lipton and Tomkins [12] Our main results are summarized in Table...
Cited by: More
Scheduling of Virtual Connections in Fast Networks - Erlebach, Jansen (1996) (Correct)
Off-Line and On-Line Call-Scheduling in Stars and Trees - Erlebach, Jansen (1997) (Correct)
Online Scheduling - Pruhs, Sgall, Torng (2003) (Correct)
Similar documents (at the sentence level):
53.2%: Competitive Analysis of Call Admission Algorithms.. - Feldmann, Maggs.. (1995) (Correct)
Active bibliography (related documents): More All
0.3: OPT versus LOAD in Dynamic Storage Allocation - Buchsbaum, Karloff, Kenyon.. (2003) (Correct)
0.3: Buffer Minimization Using Max-Coloring - Pemmaraju, Raman, Varadarajan (2003) (Correct)
0.1: On-line Scheduling with Hard Deadlines - Goldman, Parwatikar, Suri (1998) (Correct)
Similar documents based on text: More All
0.1: Thesis Summary: On-line Call Admission for High-Speed Networks - Feldmann (1995) (Correct)
0.1: Optimal On-line Scheduling of Parallel Jobs with Dependencies - Feldmann, Kao, Sgall, Teng (1993) (Correct)
0.1: Fitting Mixtures Of Exponentials To Long-Tail Distributions.. - Feldmann, Whitt (1997) (Correct)
Related documents from co-citation: More All
10: Competitive non-preemptive call control - Awerbuch, Bartal et al.
8: Online interval scheduling - Lipton, Tomkins - 1994
7: line Call Admission for HighSpeed Networks (context) - Feldmann - 1995
BibTeX entry: (Update)
A. Feldmann, B.M. Maggs, J. Sgall, D.D. Sleator, and A. Tomkins. Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS-95-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, January 1995. http://citeseer.ist.psu.edu/feldmann95competitive.html More
@techreport{ feldmann95competitive,
author = "Anja Feldmann and Bruce Maggs and Ji{\v{r}}{\'\i} Sgall and Daniel Sleator and Andrew Tomkins",
title = "Competitive analysis of call admission algorithms that allow delay",
number = "CMU-CS-95-102",
year = "1995",
url = "citeseer.ist.psu.edu/feldmann95competitive.html" }
Citations (may not include all citations):488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
133 Throughput-competitive on-line routing - Awerbuch, Azar et al. - 1993
118 Competitive non-preemptive call control - Awerbuch, Bartal et al. - 1994
73 Online interval scheduling - Lipton, Tomkins - 1994
72 line admission control and circuit routing for high performa.. - Awerbuch, Gawlick et al. - 1994
69 Competitive routing of virtual circuits with unknown duratio.. - Awerbuch, Azar et al. - 1994
62 Efficient on-line call control algorithms - Garay, Gopal et al. - 1993
17 Competitive analysis of call admission algorithms that allow.. - Feldmann, Maggs et al. - 1995
17 The linearity of first-fit for coloring interval graphs (context) - Kierstead - 1988
12 Broadband multimedia applications using ATM networks: High-p.. (context) - Armbruster, Wimmer - 1992
4 On some packing problems related to dynamic storage allocati.. (context) - Chrobak, Slusarek - 1988
2 First-fit and interval graphs (context) - Kierstead, Qin - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.cas.cz/~sgall/papers.html): More
Approximation Schemes for Scheduling on Uniformly Related and .. - Epstein, Sgall (Correct)
Semi-Online Scheduling With Decreasing Job Sizes - Seiden, Sgall, Woeginger (1998) (Correct)
Making DNA Computers Error Resistant - Boneh, Dunworth, Lipton, Sgall (1995) (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