TY - GEN

T1 - Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling

AU - Fidler, Markus

PY - 2003/2/17

Y1 - 2003/2/17

N2 - The Differentiated Services framework allows to provide scalable network Quality of Service by aggregate scheduling. Services, like a Premium class, can be defined to offer a bounded end-to-end delay. For such services, the methodology of Network Calculus has been applied successfully in Integrated Services networks to derive upper bounds on the delay of individual flows. Recent extensions allow an application of Network Calculus even to aggregate scheduling networks. Nevertheless, computations are significantly complicated due to the multiplexing and de-multiplexing of micro-flows to aggregates. Here problems concerning the tightness of delay bounds may be encountered. A phenomenon called Pay Bursts Only Once is known to give a closer upper estimate on the delay, when an end-to-end service curve is derived prior to delay computations. Doing so accounts for bursts of the flow of interest only once end-to-end instead of at each link independently. This principle also holds in aggregate scheduling networks. However, it can be extended in that bursts of interfering flows are paid only once, too. In this paper we show the existence of such a complementing Pay Bursts Only Once phenomenon for interfering flows. We derive the end-to-end service curve for a flow of interest in an arbitrary aggregate scheduling feed forward network for rate-latency service curves, and leaky bucket constraint arrival curves, which conforms to both of the above principles. We give simulation results to show the utility of the derived forms.

AB - The Differentiated Services framework allows to provide scalable network Quality of Service by aggregate scheduling. Services, like a Premium class, can be defined to offer a bounded end-to-end delay. For such services, the methodology of Network Calculus has been applied successfully in Integrated Services networks to derive upper bounds on the delay of individual flows. Recent extensions allow an application of Network Calculus even to aggregate scheduling networks. Nevertheless, computations are significantly complicated due to the multiplexing and de-multiplexing of micro-flows to aggregates. Here problems concerning the tightness of delay bounds may be encountered. A phenomenon called Pay Bursts Only Once is known to give a closer upper estimate on the delay, when an end-to-end service curve is derived prior to delay computations. Doing so accounts for bursts of the flow of interest only once end-to-end instead of at each link independently. This principle also holds in aggregate scheduling networks. However, it can be extended in that bursts of interfering flows are paid only once, too. In this paper we show the existence of such a complementing Pay Bursts Only Once phenomenon for interfering flows. We derive the end-to-end service curve for a flow of interest in an arbitrary aggregate scheduling feed forward network for rate-latency service curves, and leaky bucket constraint arrival curves, which conforms to both of the above principles. We give simulation results to show the utility of the derived forms.

UR - http://www.scopus.com/inward/record.url?scp=84944273572&partnerID=8YFLogxK

U2 - 10.1007/3-540-36480-3_2

DO - 10.1007/3-540-36480-3_2

M3 - Conference contribution

AN - SCOPUS:84944273572

SN - 3540006044

SN - 3540006044

SN - 9783540006046

SN - 9783540006046

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 34

BT - Quality of Service in Multiservice IP Networks - Second International Workshop

A2 - Marsan, Marco Ajmone

A2 - Corazza, Giorgio

A2 - Listanti, Marco

A2 - Roveri, Aldo

PB - Springer Verlag

T2 - 2nd International Workshop on Quality of Service in Multiservice IP Networks, QoS-IP 2003

Y2 - 24 February 2003 through 26 February 2003

ER -