(Enter summary)
Abstract: We address the issue of call acceptance and routing in ATM networks. Our goal is to design an algorithm that guarantees bounds on the fraction of cells lost by a call. The method we propose for call acceptance and routing does not require models describing the traffic. Each switch estimates the additional fraction of cells that would be lost if new calls were routed through the switch. The routing algorithm uses these estimates. The estimates are obtained by monitoring the switch operations and ... (Update)
Cited by: More
Measurement Based Optimal Source Shaping with a.. - Modani, Dube, Kumar (2000)
(Correct)
Estimating Tail Probabilities in Queues via Extremal Statistics - Glynn, Zeevi (1999)
(Correct)
Estimating Tail Decay for Stationary Sequences via Extreme Values - Zeevi, Glynn (2001)
(Correct)
Similar documents (at the sentence level):
35.8%: Admission Control and Routing in ATM Networks.. - Courcoubetis.. (1995)
(Correct)
Similar documents based on text: More All
0.3: Real-Time Issues in Call Acceptance Management for.. - Courcoubetis.. (1991)
(Correct)
0.2: A Poisson Limit for the Unfinished Work of Superposed Point.. - Cao, Ramanan (2001)
(Correct)
0.2: Cyclone: A safe dialect of C - Jim, Morrisett, Grossman, Hicks.. (2002)
(Correct)
Related documents from co-citation: More All
20: Effective bandwidths at multi-class queues (context) - Kelly - 1991
17: A decision-theoretic approach to call admission control in ATM networks (context) - Gibbens, Kelly et al. - 1995
17: Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources
- Kesidis, Walrand et al. - 1993
BibTeX entry: (Update)
C. Courcoubetis, G. Kesidis, A. Ridder, J. Walrand, and R.R. Weber. Admission Control and Routing in ATM Networks using Inferences from Measured Buffer Occupancy. ORSA/TIMS special interest meeting, Monterey, January, 1991. (to also appear in IEEE Trans. Communications) . http://citeseer.ist.psu.edu/courcoubetis95admission.html More
@misc{ courcoubetis91admission,
author = "C. Courcoubetis and G. Kesidis and A. Ridder and J. Walrand and R. Weber",
title = "Admission Control and Routing in {ATM} Networks using Inferences from Measured
Buffer Occupancy",
note = "{ORSA}/{TIMS} special interest meeting, Monterey, January, 1991.
(to also appear in {IEEE} Trans. Communications) .",
year = "1991",
url = "citeseer.ist.psu.edu/courcoubetis95admission.html" }
Citations (may not include all citations):
1
was born in Toronto (context) - Kesidis, -M' - 1964
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://walrandpc.eecs.berkeley.edu/Pubs.html): More
WebTP: A Receiver-Driven Web Transport Protocol - Gupta, Chen, McCanne, Walrand (1998)
(Correct)
Effective Bandwidths for Multiclass Markov Fluids and.. - Kesidis, Walrand, Chang (1993)
(Correct)
Relative Entropy Between Markov Transition Rate Matrices - Kesidis, Walrand (1993)
(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