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)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Erlang capacity and uniform approximations for shared unbuffered resources
IEEE/ACM Transactions on Networking (TON)
Traffic characterization and its applications to ATM network design
Traffic characterization and its applications to ATM network design
Improved loss calculations at an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
Call-burst blocking and call admission control in a broadband network with bursty sources
Performance Evaluation
Resource management in wide-area ATM networks using effective bandwidths
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
Analytical modelling of the GC-based handover scheme with heavy-tailed call holding times
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Performance evaluation of bandwidth allocation in ATM networks
International Journal of Business Information Systems
Combining quality of services path first routing and admission control to support VoIP traffic
Future Generation Computer Systems
Hi-index | 0.00 |
In this paper, we propose a scalable algorithm for connection admission control (CAC). The algorithm applies to a Multiprotocol Label Switching (MPLS) ATM switch with a FIFO buffer. The switch carries data from statistically independent variable bit rate (VBR) sources that asynchronously alternate between ON and OFF states with exponentially distributed periods. The sources may be heterogeneous both in terms of their statistical characteristics (peak cell rate, sustained cell rate, and burst size attributes) as well as their Quality of Service (QoS) requirements. The performance of the proposed CAC scheme is evaluated using known performance bounds and simulation results. For the purpose of comparison, we also present scalability analyses for some of the previously proposed CAC schemes. Our results show that the proposed CAC scheme consistently performs better and operates the link close to the highest possible utilization level. Furthermore, the scheme scales well with increasing amount of resources (link capacity and buffer size) and accommodates intelligently the mix of traffic offered by sources of diversed burstiness characteristics.