Results 1 
9 of
9
Statistical Performance Guarantees for Streaming Flows using Expedited Forwarding
 in Proc. of IEEE INFOCOM’2001
, 2001
"... We suggest that satisfactory statistical performance guarantees for streaming flows can be fulfilled when their packets receive expedited forwarding in nonpreemptive priority queues. This relies on the conjecture that jitter remains negligible in the network such that performance measures can be bo ..."
Abstract

Cited by 45 (5 self)
 Add to MetaCart
(Show Context)
We suggest that satisfactory statistical performance guarantees for streaming flows can be fulfilled when their packets receive expedited forwarding in nonpreemptive priority queues. This relies on the conjecture that jitter remains negligible in the network such that performance measures can be bounded by assuming flows constitute Poisson arrival processes of MTU sized packets. We provide analytical and simulation evidence in support of this conjecture and show how it leads to simple engineering rules for both constant and variable rate streaming traffic. I.
Large Deviations estimates for Polling and Weighted Fair Queueing service systems
, 1998
"... In this paper we consider a single server system with an arbitrary number of traffic classes employing either Weighted Fair Queueing or Weighted Round Robin service policy among classes. By using sample path Large Deviations techniques we derive logarithmic equivalents of the quantities P(W i ? x) a ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
In this paper we consider a single server system with an arbitrary number of traffic classes employing either Weighted Fair Queueing or Weighted Round Robin service policy among classes. By using sample path Large Deviations techniques we derive logarithmic equivalents of the quantities P(W i ? x) as x ! 1, where W i is the stationary amount of class i traffic backlogged. This generalizes previous results of Weber [13], O'Connell [9] and Bertsimas et al. [1] who derived these equivalents in the case of only two customer classes. The results are illustrated in the case of Poisson traffic. It is shown, in particular, that for such traffic and in a symmetric case huge backlogs for a given class are more likely with Fair Queueing rather than with FIFO scheduling.
Individual QoS versus Aggregate QoS: A Loss Performance Study
 IEEE/ACM Transactions on Networking
, 2002
"... This papers explores, primarily by means of analysis, the differences that can exist between individual and aggregate loss guarantees in an environment where guarantees are only provided at an aggregate level. The foc us is on understanding which traffic parameters are responsible for inducing possi ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
This papers explores, primarily by means of analysis, the differences that can exist between individual and aggregate loss guarantees in an environment where guarantees are only provided at an aggregate level. The foc us is on understanding which traffic parameters are responsible for inducing possible deviations and to what extent. In addition, we seek to evaluate the level of additional resources, e.g., bandwidth or buffer, required to ensure that all individual loss measures remain below their desired target. The paper's contributions are in developing analytical models that enable the evaluation of individual loss probabilities in settings where only aggregate losses are controlled, and in identifying traffic parameters that play a dominant role in causing differences between individual and aggregate losses. The latter allows the construction of guidelines identifying what kind of traffic can be safely multiplexed into a common service class.
Aggregation and Conformance in Differentiated Service Networks  A Case Study
 ACM SIGCOMM COMPUTER COMMUNICATION REVIEW (CCR
, 2000
"... The Differentiated Service (DiffServ) architecture [1] advocates a model based on different "granularity" at network edges and within the network. In particular, core routers are only required to act on a few aggregates, that are meant to offer a predefined set of service levels. The use ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
The Differentiated Service (DiffServ) architecture [1] advocates a model based on different "granularity" at network edges and within the network. In particular, core routers are only required to act on a few aggregates, that are meant to offer a predefined set of service levels. The use of aggregation raises a number of questions for endtoend services, in particular when crossing domain boundaries where policing actions may be applied. This paper focuses on the impact of such policing actions in the context of individual and bulk services built on top of the Expedited Forwarding (EF) [7] perhopbehavior (PHB). The findings of this investigation confirm and quantify the expected need for reshaping at network boundaries. They also make recommendations for when reshaping is not available.
www.elsevier.com/locate/peva Buffer overflow asymptotics for multiplexed regulated traffic
, 2007
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract
 Add to MetaCart
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:
A Poissonian Traffic Descriptor
"... Differentiated Services (DS) networks provide different service classes and employ traffic conditioners that contain shaping devices which force traffic streams to be conform to a certain traffic description. The shaping algorithm employed, in turn, is a proper traffic descriptor of the shaped flows ..."
Abstract
 Add to MetaCart
Differentiated Services (DS) networks provide different service classes and employ traffic conditioners that contain shaping devices which force traffic streams to be conform to a certain traffic description. The shaping algorithm employed, in turn, is a proper traffic descriptor of the shaped flows. For reasons lying in the evolution of communication systems Leaky Bucket Algorithms (LBA) are the quasistandard shaping devices. In this article we introduce a new shaping algorithm that emits traffic flows that behave 'better than Poisson' with respect to buffer occupancy such that the Poissonian traffic description gives an upper bound on the buffer occupancy caused by the shaped flows. If the property 'better than Poisson' is carried throughout the entire network, assuming Poissonian flows with different average rates gives a reliable estimate for network dimensioning. We believe that the 'better than Poisson' traffic description is more valuable than LBA conformance. Furthermore we show the introduced shaping algorithm to be a better (in terms of throughput, goodput and delay) partner to TCP's closed loop control than the LBAs.
A Framework for Mean Delay Analysis in Networks with Multiplexed Regulated Traffic
"... Abstract — In this paper, a framework is developed to estimate the mean delay performance of multiplexed leakybucket or (π, ρ,σ) regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by onoff type processes with exponentially distributed off ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — In this paper, a framework is developed to estimate the mean delay performance of multiplexed leakybucket or (π, ρ,σ) regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by onoff type processes with exponentially distributed off periods. We then obtain perflow bounds on the mean delay that are useful in admission control. We show that when there is no peak rate constraint, the PollaczekKhinchine formula for M/G/1 queues provides a tight bound thus establishing the BetterthanPoisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic BetterthanPoisson property of regulated flows. We apply our results to concentrator networks where we show that an upperbound of the endtoend delay can be obtained by assuming sources do not change their input characteristics as they pass through the network. The techniques are based on a Palm theory of continuous increasing measures and increasing convex stochastic orderings. Index Terms — Mean delay, regulated traffic, leaky bucket, increasing convex ordering, M/G/1 queue, Better than Poisson I.
Buffer Overflow Asymptotics for Multiplexed Regulated Traffic
"... By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the manysources regime for the tail distribution of the workload generated by these flows in a FIFO queue wi ..."
Abstract
 Add to MetaCart
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the manysources regime for the tail distribution of the workload generated by these flows in a FIFO queue with constant service rate. Furthermore, we compare this workload distribution with an M/G/1 queue and get insights on the betterthanPoisson property of regulated flows. We conclude that the superposition of independent regulated flows generates an asymptotically smaller workload than a marked Poisson process whose service times and intensity depend on the parameters of regulated sources.