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. © Springer-Verlag 2004.
CITATION STYLE
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. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3280, 604–614. https://doi.org/10.1007/978-3-540-30182-0_61
Mendeley helps you to discover research relevant for your work.