Abstract
In a DiffServ architecture, packets with the same marking are treated as an aggregate at core routers, independently of the flow they belong to. Nevertheless, for the purpose of QoS provisioning, derivation of upper bounds on the delay of individual flows is required. In this paper, we consider the derivation of per-flow end-to-end delay bounds in DiffServ domains where peregress (or sink-tree) FIFO aggregation is in place. We expose a general methodology to derive delay bounds, and we instantiate it on a case study. We show that the methodology yields a tighter bound than those available from the literature, and we express a worst-case scenario for the case study network, in which the bound is actually achieved.
This work has been carried out within the framework of the FIRB -PERF project, funded by the Italian Ministry for Education and Scientific Research (MIUR).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Le Boudec, J.-Y., Thiran, P.: Network Calculus. In: Thiran, P., Le Boudec, J.-Y. (eds.) Network Calculus. LNCS, vol. 2050, p. 3. Springer, Heidelberg (2001)
Fidler, M., Sander, V.: A Parameter Based Admission Control for Differentiated Services Networks. Elsevier Computer Networks 44, 463–479 (2004)
Charny, A., Le Boudec, J.-Y.: Delay Bounds in a Network with Aggregate Scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 1–13. Springer, Heidelberg (2000)
Bennett, J.C.R., et al.: Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding. IEEE/ACM Trans. Networking 10(4), 529–540 (2002)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. IETF RFC 2475 (1998)
Davie, B., et al.: An Expedited Forwarding PHB. IETF RFC 3246 (2002)
Choi, B., Bettati, R.: Endpoint Admission Control: Network Based Approach. In: Proc. IEEE Int. Conf. Distributed Computing Systems (ICDCS), Phoenix, Az, pp. 227–235 (2001)
Lenzini, L., Martorini, L., Mingozzi, E., Stea, G.: End-to-End Per-Flow Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing. Tech. Rep., Univ. of Pisa (2004)
Le Faucher, F., Davie, B., Davari, S., Krishnan, R., Cheval, P., Heinanen, J.: Multi Protocol Label Switching (MPLS) Support of Differentiated Services. IETF RFC 3270 (2002)
Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: An Overview. IETF RFC 1633 (1994)
Lenzini, L., Mingozzi, E., Stea, G.: Delay Bounds for FIFO Aggregates: A Case Study. In: Karlsson, G., Smirnov, M. (eds.) QofIS 2003. LNCS, vol. 2811, pp. 31–40. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenzini, L., Martorini, L., Mingozzi, E., Stea, G. (2004). A Methodology for Deriving Per-Flow End-to-End Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive