Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Asynchronous transfer mode (2nd ed.): solution for broadband ISDN
Asynchronous transfer mode (2nd ed.): solution for broadband ISDN
Optimal buffer control during congestion in an ATM network node
IEEE/ACM Transactions on Networking (TON)
Some optimal traffic regulation schemes for ATM networks: a Markov decision approach
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Teletraffic Technologies in ATM Networks
Teletraffic Technologies in ATM Networks
Asynchronous Transfer Mode Networks: Performance Issues
Asynchronous Transfer Mode Networks: Performance Issues
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Real-time scheduling with quality of service constraints
IEEE Journal on Selected Areas in Communications
Priority assignment control of ATM line buffers with multiple QOS classes
IEEE Journal on Selected Areas in Communications
A separation principle between scheduling and admission control for broadband switching
IEEE Journal on Selected Areas in Communications
Congestion control and prevention in ATM networks
IEEE Network: The Magazine of Global Internetworking
A Review of Call Admission Control Schemes in Wireless ATM Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 1
A node simulation tool for bandwidth allocation and CAC in ATM networks
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Hi-index | 0.24 |
The paper presents a scheme for admission control at call set-up level at an ATM node. The traffic is considered to be divided into classes, characterized by statistical parameters like peak and average bandwidth, and by Quality of Service (QoS) requirements that allow us to define a 'feasibility region' where such requirements are guaranteed. A model to describe the 'call admission' is proposed. Then, three alternative strategies to get the maximum number of acceptable connections, by taking into account the probability of blocking a call at the call set-up level, are described. The first one is intended to minimize the overall call blocking probability; the second one is aimed at balancing the probability among the different traffic classes; while the last one allows us to enforce a constraint on the call blocking probability. The efficiency of the proposed strategies is tested by simulation and verified by comparing it with other admission control schemes that appear in the literature.