Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, H.-M., 10 Gigabit/s Plattform für das G-WiN betriebsbereit, DFN Mitteilungen, Heft 60, November 2002.
Blake, S., et al., An Architecture for Differentiated Services RFC 2475, 1998.
Chang, C.-S., Performance Guarantees in Communication Networks, Springer, TNCS, 2000.
Charny, A., and Le Boudec, J.-Y., Delay Bounds in a Network with Aggregate Scheduling, Springer, LNCS 1922, Proceedings of QofIS, 2000.
Charny, A., et al., Supplemental Information for the New Definition of EF PHB (Expedited Forwarding Per-Hop-Behavior) RFC 3247, 2002.
Cruz, R. L., A Calculus for Network Delay, Part I: Network Elements in Isolation, IEEE Transactions on Information Theory, vol. 37, no. 1, pp 114–131, 1991.
Cruz, R. L., A Calculus for Network Delay, Part II: Network Analysis, IEEE Transactions on Information Theory, vol. 37, no. 1, pp 132–141, 1991.
Cruz, R. L., SCED+: Efficient Management of Quality of Service Guarantees, IEEE Infocom, 1998.
Davie, B., et al.,An Expedited Forwarding PHB RFC 3246, 2002.
Foster, I., Fidler, M., Roy, A., Sander, V., Winkler, L., End-to-End Quality of Service for High-End Applications Elsevier Computer Communications Journal, in press, 2003.
Law, A.M., and Kelton, W. D., Simulation, Modeling, and Analysis McGraw-Hill, 3rd edition, 2000.
Le Boudec, J.-Y., and Thiran, P., Network Calculus Made Easy, Technical Report EPFL-DI 96/218. Ecole Polytechnique Federale, Lausanne (EPFL), 1996.
Le Boudec, J.-Y., and Thiran, P., Network Calculus A Theory of Deterministic Queuing Systems for the Internet, Springer, LNCS 2050, Version July 6, 2002.
Nichols, K., and Carpenter, B., Definition of Differentiated Services Per Domain Behaviors and Rules for their Specification, RFC 3086, 2001.
Nichols, K., Jacobson, V., and Zhang, L., A Two-bit Differentiated Services Architecture for the Internet, RFC 2638, 1999.
Pareck, A. K., and Gallager, R. G., A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case, IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 344–357, 1993.
Pareck, A. K., and Gallager, R. G., A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple-Node Case, IEEE/ACM Transactions on Networking, vol. 2, no. 2, pp. 137–150, 1994.
Paxson, V., and Floyd, S., Wide Area Traffic: The Failure of Poisson Modeling IEEE/ACM Transactions on Networking, vol. 3, no. 3, pp. 226–244, 1995.
Sander, V., Design and Evaluation of a Bandwidth Broker that Provides Network Quality of Service for Grid Applications, Ph.D. Thesis, Aachen University, 2002.
Sander, V., and Fidler, M., Evaluation of a Differentiated Services based Implementation of a Premium and an Olympic Service, Springer, LNCS 2511, Proceedings of QofIS, 2002.
Starobinski, D., Karpovsky, M., and Zakrevski, L., Application of Network Calculus to General Topologies using Turn-Prohibition, Proceedings of IEEE Infocom, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fidler, M. (2003). Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2003. Lecture Notes in Computer Science, vol 2601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36480-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00604-6
Online ISBN: 978-3-540-36480-1
eBook Packages: Springer Book Archive