An adaptive algorithm for measurement-based admission control in integrated services packet networks

Authors:
C Casetti;J Kurose;D Towsley
Affiliations:
Dipartimento di Ingegneria Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Computer Science Department, University of Massachusetts, Amherst, MA 01003, USA;Computer Science Department, University of Massachusetts, Amherst, MA 01003, USA
Venue:
Computer Communications
Year:
2000

Citing 16
Cited 1

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Analysis and design of rate-based congestion control of high speed networks, I: stochastic fluid models, access regulation

Queueing Systems: Theory and Applications
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Open issues and challenges in providing quality of service guarantees in high-speed networks

ACM SIGCOMM Computer Communication Review
Analysis, modeling and generation of self-similar VBR video traffic

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Network support for multimedia: a discussion of the Tenet approach

Computer Networks and ISDN Systems - Special issue on a multi-dimensional view of multimedia
A measurement-based admission control algorithm for integrated services packet networks

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
A measurement-based admission control algorithm for integrated service packet networks

IEEE/ACM Transactions on Networking (TON)
A framework for robust measurement-based admission control

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Measurement-Based Call Admission Control: Analysis and Simulation

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Estimation of aggregate effective bandwidth for traffic admission in ATM networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Real-time scheduling with quality of service constraints

IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet

IEEE Journal on Selected Areas in Communications

Resource Allocation and Admission Control Styles in QoS DiffServ Networks

QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

Call admission control is typically devised so as to employ the declared worst-case traffic descriptors for incoming calls, a solution resulting in poor bandwidth utilization. A measurement-based admission scheme is an appealing alternative, offering adaptivity to the changing traffic conditions, while allowing statistical multiplexing gains to be exploited. In this paper, we examine the problem of determining which traffic characterization a measurement-based admission control algorithm should require of sources requesting access. We also propose an adaptive measurement-based admission control algorithm that simplifies the estimation process. We test the new algorithm under different traffic scenarios and show that a high utilization level is achieved without violating delay-based QoS guarantees.