Wide-area traffic: the failure of Poisson modeling
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A framework for robust measurement-based admission control
IEEE/ACM Transactions on Networking (TON)
On the nonstationarity of Internet traffic
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Measurement-based admission control with aggregate traffic envelopes
IEEE/ACM Transactions on Networking (TON)
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Practical Approaches for Connection Admission Control in Multiservice Networks
ICON '99 Proceedings of the 7th IEEE International Conference on Networks
Assessing the quality of voice communications over internet backbones
IEEE/ACM Transactions on Networking (TON)
Deploying Diffserv at the Network Edge for Tight SLAs, Part 1
IEEE Internet Computing
Probabilistic delay guarantees using delay distribution measurement
Proceedings of the 12th annual ACM international conference on Multimedia
A pragmatic approach to dealing with high-variability in network measurements
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Deploying Diffserv at the Network Edge for Tight SLAs, Part 2
IEEE Internet Computing
A comment on simulating LRD traffic with pareto ON/OFF sources
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Experience-based admission control (EBAC)
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
An implementation-based comparison of Measurement-Based Admission Control algorithms
Journal of High Speed Networks
Multi-Class Measurement Based Admission Control for a QoS Framework with Dynamic Resource Management
Journal of Network and Systems Management
Hi-index | 0.00 |
The Measurement-based Admission Control algorithm presented in this paper has been devised to overcome three shortcomings. Firstly, its configuration parameter strictly correspond to standard QoS definitions in Service Level Agreements, namely packet loss probability. While this is featured by alternative designs too, the second issue, that of considerable performance fluctuations under varying traffic conditions, is a rather general problem. Applying a non-parametric approach the presented algorithm's estimation model is free from assumptions and simulations assert consistent performance for a set of various conditions. Finally, the third improvement is certainly most appealing, the algorithm's independence from fine-tuning. In fact, the optimal value of the performance determining parameter is being estimated from the measured sample. This makes the algorithm highly adaptive as well as autonomous and simulations confirm near optimal performance and accuracy.