2026-09-20T11:43:09Zhttps://digital.library.adelaide.edu.au/server/oai/request

oai:digital.library.adelaide.edu.au:2440/1221482019-11-28T03:36:19Zcom_2440_14759col_2440_14760

Evans, Sue Anido, Gary Dutkiewicz, Eryk Department of Applied Mathematics 1991 http://hdl.handle.net/2440/122148 In this thesis a study of connection admission control for use in future ATM networks is presented. Traffic management and control strategies proposed in the literature are suveyed. An architecture for managing and controlling traffic in ATM networks is then presented. Based on this framework a connection admission model is proposed. Two major aspects of the model, involving the solution of a finite deterministic queue with an arrival process modelled by a two-state Markov-modulated Poisson process and the superposition of two-state Markov-modulated poisson processes, are presented. The resultant algorithms are then combined to produce an algorithm for connection admission control in ATM networks. Thesis (MSc) -- University of Adelaide, Dept. of Applied Mathematics, 1992 en Connection admission control in ATM networks Thesis This electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exceptions. If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legalsopen.access