S. D. Patek J. Liebeherr and A. Burchard. A calculus for end-to-end statistical service guarantees. Technical Report CS-2001-19, University of Virginia, Department of Computer Science, August 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....network services. Different definitions of probabilis tic service curves have been studied in [10] 36] A prob abilistic network calculus for a class of so called dynamic F servers is developed in [4] A calculus for providing end to end statistical QoS is developed and evaluated in [2] [30]. This calculus employs effective service curves and applies in rather general settings. This article is organized as follows. In Section II we formally define the cascaded leaky bucket regulators and the statistical QoS requirement. We also discuss the smoothers at the network ingresses and ....

J. Liebeherr, $. Patek, and A. Burchard. A calculus for end to end statistical service guarantees. Technical Report CS 2001.

....Network calculus; Differentiated services; Aggregate scheduling 1. Introduction We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves. This scenario arises in scenarios where aggregate multiplexing is performed such as: Internet differentiated services [2,4,8,13], or front ends to optical switches [18] Multiplexing several flows into a FIFO scheduler causes an increase in the burstiness of every flow. Capturing this effect is important in order to properly dimension buffers in complex scenarios where multiplexers are interconnected. However, it is not ....

S.D. Patek, J. Liebeherr, A. Burchard, A calculus for end-to-end statistical service guarantees, Technical Report CS-2001-19, Department of Computer Science, University of Virginia, August 2001.

....flows. It is based on Chernov bounds and the central limit theorem; the approach can be re written using Hoeffding bounds, as above. The effective envelope is then is used to evaluate the amount of multiplexing that can be achieved in constant rate servers. The concept is further developed in [94], which introduces the idea of effective service curve; this allows application to network scenarios such as EF. The end result is similar to the previous method; however, the method of effective envelope and effective service curve does not give closed form expression, unlike the method based on ....

J. Liebeherr, S. D. Patek, and A. Burchard, "A calculus for endto -end statistical service guarantees," Tech. Rep. CS-2001-19, University of Virginia, Department of Computer Science, August 2001.

....model was considered. Schemes for providing statistical QoS in networks using EDF scheduling were proposed by Andrews[8] and Sivaraman[9] Unlike the ratebased schedulers considered here, EDF decouples rate and delay guarantees at the expense of admission control complexity. Leibeherr et al.[10] proposed the notion of effective service curves as a probabilistic bound on service received by a flow. Several existing MBAC algorithms address flow QoS requirements along the dimensions of the bandwidth or aggregate loss rate. An important difference of our algorithm with the existing MBAC ....

J. Liebeherr, S. Patek, and A. Burchard, A calculus for endto -end statistical service guarantees, Technical Report CS2001 -19, University of Virginia, August 2001. 6

....flows. It is based on Chernov bounds and the central limit theorem; the approach can be re written using Hoeffding bounds, as above. The effective envelope is then is used to evaluate the amount of multiplexing that can be achieved in constant rate servers. The concept is further developed in [91], which introduces the idea of effective service curve; this allows application to network scenarios such as EF. The end result is similar to the previous method; however, the method of effective envelope and effective service curve does not give closed form expression, unlike the method based on ....

J. Liebeherr, S. D. Patek, and A. Burchard, "A calculus for endto -end statistical service guarantees," Tech. Rep. CS-

No context found.

A. Burchard, J. Liebeherr, and S. D. Patek. A calculus for end-to-end statistical service guarantees (revised). Technical Report CS-2001-19, University of Virginia, Computer Science Department, May 2002. Available from http://www.cs.virginia.edu/jorg/cs-01-19.pdf.

No context found.

A. Burchard, J. Liebeherr, and S. D. Patek. A calculus for end-to-end statistical service guarantees. Technical Report CS-2001-19, University of Virginia, Computer Science Department, May 2002. Available from http://www.cs.virginia.edu/jorg/cs-01-19.pdf.

....envelopes [2] Effective envelopes are functions that are, with high probability, upper bounds on multiplexed traffic from a set of flows satisfying the given assumptions. Effective envelopes have been shown to be a useful tool for calculating the statistical multiplexing gain at a network node [9, 8]. Consider the set C q of type q flows. We use A Cq to denote the aggregate arrivals of all type q flows, that is, A Cq (t; t ) P j2Cq A j (t; t ) Let N q denote the number of flows in set C q . All flows of the same type have the same subadditive bound. Thus, we use A q to denote ....

J. Liebeherr, S. D. Patek, and A. Burchard. A calculus for end-to-end statistical service guarantees. Technical Report CS-01-19, University of Virginia, Computer Science Department, August 2001.

....these results focus on the analysis of a single node, and do not consider a multi node network. The remaining sections of this paper are structured as follows. In Section II, we review relevant results from the statistical network calculus in terms of effective service curves, as presented in [6]. In Section III we discuss the arrivals and service provisioning of the flow aggregate. We extend the notion of effective envelopes from [3] to heterogeneous arrivals. In Section IV we present an effective service curve for a single flow at a node in which service is allocated to an aggregate of ....

.... flow aggregates we assume that the service curves are strict [5] in the sense that they guarantee the minimum deterministic service whenever a flow is backlogged, that is, D(t 1 ,t 2 ) S(t 2 whenever B(x) 0 for all x (t 1 ,t 2 ) To express probabilistic service guarantees, following [6], we define a (minimum) effective service for an arrival process A as a nonnegative function that satisfies for all t 0, A#S #. 1) Given an effective service curve at a node, one can derive probabilistic bounds on backlog, delay, and the output process for effective service ....

[Article contains additional citation context not shown here]

A. Burchard, J. Liebeherr, and S. D. Patek. A calculus for end-to-end statistical service guarantees. Technical Report CS-2001-19, University of Virginia, Computer Science Department, May 2002.

....the results focus on the analysis of a single node, and do not consider a multi node network. The remaining sections of this paper are structured as follows. In Section 2, we review needed results from the statistical network calculus in terms of effective service curves, as presented in [6]. In Section 3 we discuss the arrivals and service provisioning of the flow aggregate. We extend the notion of effective envelopes from [3] to heterogeneous arrivals. In Section 4 we present an effective service curve for a single flow at a node in which service is allocated to an aggregate of ....

.... to flow aggregates we assume that the service curves are strict [5] in the sense that they guarantee the minimum service whenever a flow is backlogged, that is, D(t 1 #t 2 ) S(t 2 t 1 ) whenever B(x) 0 for each x (t 1 #t 2 ) To express probabilistic service guarantees, following [6], we define a (minimum) effective service curve for an arrival process A, as a nonnegative function that satisfies for all t 0, D(t) 1) A function E is called an envelope for a function f if f(t ) f( E(t) for all t# 0. Henceforth, following the literature, the term ....

[Article contains additional citation context not shown here]

A. Burchard, J. Liebeherr, and S. D. Patek. A calculus for end-to-end statistical service guarantees. Technical Report CS-2001-19, University of Virginia, Computer Science Department, May 2002. Available from http://www.cs.virginia.edu/jorg/cs-01-19.pdf.

No context found.

S. D. Patek J. Liebeherr and A. Burchard. A calculus for end-to-end statistical service guarantees. Technical Report CS-2001-19, University of Virginia, Department of Computer Science, August 2001.

No context found.

A. Burchard, J. Liebeherr, and S. Patek. A Calculus for Endto -end Statistical Service Guarantees. Technical Report CS2001 -19, University of Virginia, Department of Computer Science, 2002.

No context found.

J. Liebeherr, S. Patek, A. Burchard, "A Calculus for Endto -end Statistical Service Guarantees," University of Virginia Tech Report CS-2001-19 (revised).

No context found.

J. Liebeherr, S. D. Patek, and A. Burchard, "A calculus for endto -end statistical service guarantees," Tech. Rep. CS-2001-19, University of Virginia, Department of Computer Science, August 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC