A Methodology for Deriving Per-Flow End-to-End Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing
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.
Unable to display preview. Download preview PDF.
- 5.Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. IETF RFC 2475 (1998)Google Scholar
- 6.Davie, B., et al.: An Expedited Forwarding PHB. IETF RFC 3246 (2002)Google Scholar
- 7.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)Google Scholar
- 8.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)Google Scholar
- 9.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)Google Scholar
- 10.Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: An Overview. IETF RFC 1633 (1994)Google Scholar