ACM Home Page
Please provide us with feedback. Feedback
A framework for robust measurement-based admission control
Full text PdfPdf (2.10 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Cannes, France
Pages: 237 - 248  
Year of Publication: 1997
ISBN:0-89791-905-X
Also published in ...
Authors
Matthias Grossglauser  INRIA, BP 93, 06902 Sophia Antipolis Cedex, France
David Tse  Dept. of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 35,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/263105.263173
What is a DOI?

ABSTRACT

Measurement-based Admission Control (MBAC) is an attractive mechanism to concurrently offer Quality of Service (QoS) to users, without requiring a-priori traffic specification and on-line policing. However, several aspects of such a system need to be clearly understood in order to devise robust MBAC schemes. Through a sequence of increasingly sophisticated stochastic models, we study the impact of parameter estimation errors, of flow arrival and departure dynamics, and of estimation memory on the performance of an MBAC system.We show that a certainty equivalence assumption, i.e., assuming that the measured parameters are the real ones, can grossly compromise the target performance of the system. We quantify the improvement in performance as a function of the memory size of the estimator and a more conservative choice of the certainty-equivalent parameters. Our results yield valuable new insight into the performance of MBAC schemes, and represent quantitative guidelines for the design of robust schemes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. Billingsley. Probability and Measure (3rd Ed.). Wiley, 1995.
2
 
3
Costas Courcoubetis et al. Admission Control and Routing in ATM Networks using inferences from Measured Buffer Occupancy. In ORSA/TIMS special interest meeting, Monterey, CA, January 1991.
 
4
J. Cuzick. Boundary Crossing Probabilities for Stationary Gaussian Processes and Brownian Motion. Transactions of the American Mathematical Society, pages 469-492, February 1981.
 
5
R.J. Gibbens, F.P. Kelly, and P.B. Key. A decision-theoretic approach to call admission control in ATM networks. IEEE Journal on Selected Areas of Communications, pages 1101- 1114, August 1995.
6
 
7
I. Hsu and J. Walrand. Dynamic Bandwidth Allocation for ATM Switches. Journal of Applied Probability, September 1996.
 
8
J.Y. Hui. Resource allocation for broadband networks. IEEE Journal on Selected Areas of Communications, December 1988.
9
 
10
 
11
E. P. Rathgeb. Policing of Realistic VBR Video Traffic in an ATM Network. International Journal of Digital and Analog Gommunications Systems, 6:213--226, 1993.
 
12
H. Saito and K. Shiomoto. Dynamic Call Admission Control in ATM Networks. IEEE Journal on Selected Areas of Communications, 9:982-989, 1991.
 
13
S. Shenker. Fundamental Design Issues for the Future Internet. iEEE Journal on Selected Areas of Communications, 13(7), 1995.
 
14

CITED BY  11

Collaborative Colleagues:
Matthias Grossglauser: colleagues
David Tse: colleagues