• DocumentCode
    3538774
  • Title

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

  • Author

    Vasilakos, A.V. ; Loukas, N.H. ; Atlasis, A.F.

  • Author_Institution
    Dept. of Comput. Sci., Hellenic Air Force Acad., Athens, Greece
  • fYear
    1995
  • fDate
    16-19 Oct 1995
  • Firstpage
    407
  • Lastpage
    412
  • Abstract
    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
  • Keywords
    asynchronous transfer mode; estimation theory; learning (artificial intelligence); local area networks; performance evaluation; stochastic processes; telecommunication congestion control; ATM network call admission control problem:; call request acceptance; equivalent bandwidth approximation; feedback; performance simulation; statistical gain; stochastic estimator learning algorithm; traffic sources; Aggregates; Bandwidth; Bit rate; Call admission control; Channel allocation; Equations; Gaussian distribution; Intelligent networks; Learning automata; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks, 1995., Proceedings. 20th Conference on
  • Conference_Location
    Minneapolis, MN
  • ISSN
    0742-1303
  • Print_ISBN
    0-8186-7162-9
  • Type

    conf

  • DOI
    10.1109/LCN.1995.527369
  • Filename
    527369