Results 1 -
6 of
6
Statistical connection admission control framework based on achievable capacity estimation
- in Proceedings of IEEE International Conference on Communications (ICC ’06
, 2006
"... ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other wo ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Measurement-Based Admission Control for Bufferless Multiplexers
, 2001
"... In this paper we study measurement--based admission control for bufferless multiplexing, which is very attractive for real--time traffic. We first discuss a novel Large Deviations (LD) approach to measurement--based admission control. We then provide an extensive review of the existing literature ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
In this paper we study measurement--based admission control for bufferless multiplexing, which is very attractive for real--time traffic. We first discuss a novel Large Deviations (LD) approach to measurement--based admission control. We then provide an extensive review of the existing literature on measurement--based admission control.
Robust measurement-based admission control using Markov’s theory of canonical distributions
, 2006
"... This paper presents models, algorithms and analysis for measurement-based admission control in network applications in which there is high uncertainty concerning source statistics. In the process it extends and unifies several recent approaches to admission control. A new class of algorithms is intr ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper presents models, algorithms and analysis for measurement-based admission control in network applications in which there is high uncertainty concerning source statistics. In the process it extends and unifies several recent approaches to admission control. A new class of algorithms is introduced based on results concerning Markov’s canonical distributions. In addition, a new model is developed for the evolution of the number of flows in the admission control system. Performance evaluation is done through both analysis and simulation. Results show that the proposed algorithms minimize buffer-overflow probability among the class of all moment-consistent algorithms.
Measurement-based Admission Control using Worst-case Source Models
, 2003
"... An algorithm for measurement-based admission control is introduced based on recent results concerning extremal distributions for i.i.d. sources. A large deviations analysis of this algorithm shows that it is asymptotically optimal in the class of all moment-consistent algorithms. ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
An algorithm for measurement-based admission control is introduced based on recent results concerning extremal distributions for i.i.d. sources. A large deviations analysis of this algorithm shows that it is asymptotically optimal in the class of all moment-consistent algorithms.
Distribution-Free Conservative Bounds for QoS Measures
"... In this paper we set up a family of conservative upper bounds for QoS measures applicable in QoS guaranteed packet-based communication networks. The bounds are dis-tribution free, that is they depend only on the number of traf-fic sources, the peak rates of the flows and the mean arrival intensity o ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper we set up a family of conservative upper bounds for QoS measures applicable in QoS guaranteed packet-based communication networks. The bounds are dis-tribution free, that is they depend only on the number of traf-fic sources, the peak rates of the flows and the mean arrival intensity of the aggregated traffic stream. No other informa-tion on the traffic distribution is required. The bounds have been developed under the well known bufferless fluid flow multiplexing (bffm) modeling framework, nevertheless, an important property is also discussed in the paper, namely they can also be applicable to the buffered statistical multi-plexer case when the input flows are regulated. The perfor-mance of the bounds are analyzed and comparative numer-ical investigations are also presented in both multiplexing models. 1
Fast Algorithms for Computing Parsimonious Estimates of QoS Measures 111 Fast Algorithms for Computing Parsimonious Estimates of QoS Measures
"... In recent publications concerning quality of service (QoS) measures in communication networks several attempts have been made to improve the techniques of computing or estimating the quality of data trans-fer. Many of the promising results are based on the knowledge of only very few parameters on th ..."
Abstract
- Add to MetaCart
(Show Context)
In recent publications concerning quality of service (QoS) measures in communication networks several attempts have been made to improve the techniques of computing or estimating the quality of data trans-fer. Many of the promising results are based on the knowledge of only very few parameters on the traffic situation, some of which are known a priory, others are measured. The paper deals with such parsimo-nious estimation techniques of QoS measures under the bufferless fluid flow multiplexing (bffm) frame-work, and concentrates on the efficient computation of them. The proposed fixed-point recursive algo-rithms are key elements in applying either the im-plicit formulae or ones containing optimization tasks in real-time environment. 1.
