Results 1  10
of
51
Admission Control for Statistical QoS: Theory and Practice
 IN IEEE NETWORK, 13(2):2029, MARCH 1999.
, 1999
"... In networks that support Quality of Service (QoS), an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks as it deter ..."
Abstract

Cited by 127 (12 self)
 Add to MetaCart
In networks that support Quality of Service (QoS), an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks as it determines the extent to which network resources are utilized and whether the promised QoS parameters are actually delivered. Our goals in this paper are threefold. First, we describe and classify a broad set of proposed admission control algorithms. Second, we evaluate the accuracy of these algorithms via experiments using both onoff sources and long traces of compressed video; we compare the admissible regions and QoS parameters predicted by our implementations of the algorithms with those obtained from tracedriven simulations. Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain.
Statistical service assurances for traffic scheduling algorithms
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS. SPECIAL ISSUE ON INTERNET QOS
, 2000
"... Network services for the most demanding advanced networked applications which require absolute, perflow service assurances can be deterministic or statistical. By exploiting statistical properties of traffic, statistical assurances can extract more capacity from a network than deterministic assura ..."
Abstract

Cited by 77 (14 self)
 Add to MetaCart
Network services for the most demanding advanced networked applications which require absolute, perflow service assurances can be deterministic or statistical. By exploiting statistical properties of traffic, statistical assurances can extract more capacity from a network than deterministic assurances. In this work we consider statistical service assurances for traffic scheduling algorithms. We present functions, socalled effective envelopes, which are, with high certainty, upper bounds of multiplexed traffic. Effective envelopes can be used to obtain bounds on the amount of traffic on a link that can be provisioned with statistical service assurances. We show that our bounds can be applied to a variety of packet scheduling algorithms. In fact, one can reuse existing admission control functions for scheduling algorithms with deterministic assurances. We present numerical examples which compare the number of ows with statistical assurances that can be admitted with our effective envelope approach to those achieved with existing methods.
An EndtoEnd Probabilistic Network Calculus with Moment Generating Functions
, 2006
"... Network calculus is a minplus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worstcase assumptions of network calculus to develop a probabilistic equi ..."
Abstract

Cited by 66 (5 self)
 Add to MetaCart
(Show Context)
Network calculus is a minplus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worstcase assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closedform, endtoend, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent crosstraffic.
A Network Calculus with Effective Bandwidth
, 2003
"... We present a statistical network calculus in a setting where both arrivals and service are specified interms of probabilistic bounds. We provide explicit bounds on delay, backlog, and output burstiness in a network. By formulating wellknown effective bandwidth expressions in terms of envelope func ..."
Abstract

Cited by 61 (10 self)
 Add to MetaCart
(Show Context)
We present a statistical network calculus in a setting where both arrivals and service are specified interms of probabilistic bounds. We provide explicit bounds on delay, backlog, and output burstiness in a network. By formulating wellknown effective bandwidth expressions in terms of envelope functions,we are able to apply our calculus to a wide range of traffic source models, including Fractional Brownian Motion. We present probabilistic lower bounds on the service for three scheduling algorithms: Static Priority (SP), Earliest Deadline First (EDF), and Generalized Processor Sharing (GPS).
InterClass Resource Sharing using Statistical Service Envelopes
 In Proceedings of IEEE Infocom '99
, 1999
"... Networks that support multiple services through "linksharing" must address the fundamental conflicting requirement between isolation among service classes to satisfy each class' quality of service requirements, and statistical sharing of resources for efficient network utilization. ..."
Abstract

Cited by 57 (12 self)
 Add to MetaCart
Networks that support multiple services through "linksharing" must address the fundamental conflicting requirement between isolation among service classes to satisfy each class' quality of service requirements, and statistical sharing of resources for efficient network utilization. While a number of service disciplines have been devised which provide mechanisms to both isolate flows and fairly share excess capacity, admission control algorithms are needed which exploit the effects of interclass resource sharing. In this paper, we develop a framework of using statistical service envelopes to study interclass statistical resource sharing. We show how this service envelope enables a class to overbook resources beyond its deterministically guaranteed capacity by statistically characterizing the excess service available due to fluctuating demands of other service classes. We apply our techniques to several multiclass schedulers, including Generalized Processor Sharing, and des...
Delaybounded packet scheduling of bursty traffic over wireless channels
 IEEE Transactions on Information Theory
"... Abstract—In this paper, we study minimal power transmission of bursty sources over wireless channels with constraints on mean queuing delay. The power minimizing schedulers adapt power and rate of transmission based on the queue and channel state. We show that packet scheduling based on queue state ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we study minimal power transmission of bursty sources over wireless channels with constraints on mean queuing delay. The power minimizing schedulers adapt power and rate of transmission based on the queue and channel state. We show that packet scheduling based on queue state can be used to trade queuing delay with transmission power, even on additive white Gaussian noise (AWGN) channels. Our extensive simulations show that small increases in average delay can lead to substantial savings in transmission power, thereby providing another avenue for mobile devices to save on battery power. We propose a lowcomplexity scheduler that has nearoptimal performance. We also construct a variablerate quadrature amplitude modulation (QAM)based transmission scheme to show the benefits of the proposed formulation in a practical communication system. Power optimal schedulers with absolute packet delay constraints are also studied and their performance is evaluated via simulations. Index Terms—Packet scheduling, power control, queuing delay, traffic regulation, wireless channels. I.
Providing Absolute Differentiated Services for RealTime Applications in StaticPriority Scheduling Networks
 IEEE INFOCOM
, 2001
"... In this paper, we propose and analyze a methodology for providing absolute differentiated services for realtime applications in networks that use staticpriority schedulers. We extend previous work on worstcase delay analysis and develop a method that can be used to derive delay bounds without spe ..."
Abstract

Cited by 44 (15 self)
 Add to MetaCart
In this paper, we propose and analyze a methodology for providing absolute differentiated services for realtime applications in networks that use staticpriority schedulers. We extend previous work on worstcase delay analysis and develop a method that can be used to derive delay bounds without specific information on flow population. With this new method, we are able to successfully employ a utilizationbased admission control approach for flow admission. This approach does not require explicit delay computation at admission time and hence is scalable to large systems. We assume the underlying network to use staticpriority schedulers. We design and analyze several priority assignment algorithms, and investigate their ability to achieve higher utilization bounds. Traditionally, schedulers in differentiated services networks assign priorities on a classby class basis, with the same priority for each class on each router. In this paper, we show that relaxing this requirement, that is, allowing different routers to assign different priorities to classes, achieves significantly higher utilization bounds.
Packet Multiplexers with Adversarial Regulated Traffic
 In Proceedings of IEEE Infocom '98
, 2001
"... We consider a finitebuffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e., the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on t ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
(Show Context)
We consider a finitebuffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e., the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal onoff sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.
A minplus calculus for endtoend statistical service guarantees
 IEEE TRANSACTION ON INFORMATION THEORY
, 2006
"... The network calculus offers an elegant framework for determining worstcase bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework with statistical service guarantees. The notion of a statistical service curve is presented as a probabilistic b ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
(Show Context)
The network calculus offers an elegant framework for determining worstcase bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework with statistical service guarantees. The notion of a statistical service curve is presented as a probabilistic bound on the service received by an individual flow or an aggregate of flows. The problem of concatenating pernode statistical service curves to form an endtoend (network) statistical service curve is explored. Two solution approaches are presented that can each yield statistical network service curves. The first approach requires the availability of time scale bounds at which arrivals and departures at each node are correlated. The second approach considers a service curve that describes service over time intervals. Although the latter description of service is less general, it is argued that many practically relevant service curves may be compliant to this description.
On the Performance of Multiplexing Independent Regulated Inputs
, 2001
"... In this paper, we consider the performance analysis problem for a work conserving link with a large number of independent regulated inputs. For such a problem, we derive simple stochastic bounds under a general trac constraint for the inputs. The bound for queue length is shown to be a stochastic ex ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
In this paper, we consider the performance analysis problem for a work conserving link with a large number of independent regulated inputs. For such a problem, we derive simple stochastic bounds under a general trac constraint for the inputs. The bound for queue length is shown to be a stochastic extension of the deterministic worst case bound and it is asymptotically tighter than the bound in Kesidis and Konstantopoulos [23]. We also test the bound by considering periodic inputs with independent starting phases. Based on Sanov's theorem and importance sampling, we propose a fast simulation algorithm that achieves signi cant variance reduction. The simulations results are compared with our stochastic bound and the bound in [23].