Connection admission control for capacity-varying networks with stochastic capacity change times

Authors:
J. Siwko;I. Rubin
Affiliations:
Contronautics, Inc., Hudson, MA and Department of Electrical Engineering, University of California, Los Angeles, CA;Department of Electrical Engineering, University of California, Los Angeles, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2001

Citing 6
Cited 1

A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept

IEEE/ACM Transactions on Networking (TON)
Performance evaluation of a reservation random access scheme for packetized wireless systems with call control and hand-off loading

Wireless Networks
Resource sharing for book-ahead and instantaneous-request calls

IEEE/ACM Transactions on Networking (TON)
On optimal call admission control in cellular networks

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Call admission control schemes: a review

IEEE Communications Magazine
Distributed call admission control in mobile/wireless networks

IEEE Journal on Selected Areas in Communications

Connection control by virtual admission in wireless LAN environment

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many connection-oriented networks, such as low Earth orbit satellite (LEOS) systems and networks providing multipriority service using advance reservations, have capacities which vary over time. Connection admission control (CAC) policies which only use current capacity information may lead to intolerable dropping of admitted connections whenever network capacity decreases. We present the admission limit curve (ALC) for capacity-varying networks with random capacity change times. We prove the ALC is a constraint limiting the conditions under which any connection-stateless CAC policy may admit connections and still meet dropping guarantees on an individual connection basis. The ALC also leads to a lower bound on the blocking performance achievable by any connection-stateless CAC policy which provides dropping guarantees to individual connections. In addition, we describe a CAC policy for stochastic capacity change times which uses knowledge about future capacity changes to provide dropping guarantees on an individual connection basis and which achieves blocking performance close to the lower bound.