A framework for robust measurement-based admission control
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
IEEE/ACM Transactions on Networking (TON)
Performance bounds for rate envelope multiplexing
Performance Evaluation
A family of measurement-based admission control algorithms
PICS '98 Proceedings of the IFIP TC6/WG6.3 Seventh International Conference on Performance of Information and Communication Systems
On the relevance of time scales in performance oriented traffic characterizations
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Call admission control schemes: a review
IEEE Communications Magazine
Hi-index | 0.00 |
In guaranteed Quality of Service (QoS) packet networks like future QoS Internet quantifying resource usage is a key issue for traffic management. Within this the estimated bandwidth requirements of traffic flows are apparently important building blocks of decisions made by connection admission control, QoS routing and resource reservation protocols. This paper focuses on bandwidth requirement estimators under the framework of bufferless fluid flow multiplexing (bffm) which is a suitable modeling approach for scenarios with high network utilization with large number of traffic flows multiplexed. The bandwidth requirement estimates proposed have acceptable accuracy and are parsimonious, that is they need very few pieces of information on traffic flows which are either measurable in straightforward manner or known a priori and propagated through the nodes of networks. These properties are essential for efficient implementations.