By Topic

The use of learning algorithms in ATM networks call admission control problem: a methodology

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Vasilakos, A.V. ; Dept. of Comput. Sci., Hellenic Air Force Acad., Athens, Greece ; Loukas, N.H. ; Atlasis, A.F.

The call admission control (CAC) problem, one of the most fundamental in ATM networks, has yet to be solved. We use a novel stochastic estimator learning algorithm (SELA) to predict in “real time” if a call request should be accepted or not, for various types of traffic sources. The feedback the algorithm receives has been drawn from the efficient “equivalent bandwidth” approximation proposed by Guerin et al. (1991). The proposed scheme exhibits a remarkable statistical gain compared with other CAC schemes reported in the literature, without QOS deterioration. The paper contains a simulation study of its performance and discusses several possible ways in which this work could be extended

Published in:

Local Computer Networks, 1995., Proceedings. 20th Conference on

Date of Conference:

16-19 Oct 1995