End-to-end Delay Bounds in FIFO-multiplexing Tandems

Luciano Lenzini; Enzo Mingozzi; Giovanni Stea

2nd International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

End-to-end Delay Bounds in FIFO-multiplexing Tandems

Download557 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/valuetools.2007.1912,
    author={Luciano Lenzini and Enzo Mingozzi and Giovanni Stea},
    title={End-to-end Delay Bounds in FIFO-multiplexing Tandems},
    proceedings={2nd International ICST Conference on Performance Evaluation Methodologies and Tools},
    proceedings_a={VALUETOOLS},
    year={2010},
    month={5},
    keywords={Network Calculus FIFO-multiplexing Delay Bound.},
    doi={10.4108/valuetools.2007.1912}
}

Luciano Lenzini
Enzo Mingozzi
Giovanni Stea
Year: 2010
End-to-end Delay Bounds in FIFO-multiplexing Tandems
VALUETOOLS
ICST
DOI: 10.4108/valuetools.2007.1912

Luciano Lenzini¹^,*, Enzo Mingozzi¹^,*, Giovanni Stea¹^,*

1: Dipartimento di Ingegneria dell’Informazione, University of Pisa, Italy Via Diotisalvi, 2 56122 Pisa, Italy - Ph. +39 050 2217599

*Contact email: l.lenzini@iet.unipi.it, e.mingozzi@iet.unipi.it, g.stea@iet.unipi.it

Abstract

In this paper we address the problem of finding good end-to-end delay bounds for single leaky-bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes. More specifically, we focus on a methodology, called the Least Upper Delay Bound (LUDB) method, which is based on Network Calculus. The latter has already been used for computing delay bounds in tandems in which the path of the various flows are subject to particular restrictions. In this paper we generalize it to tandems traversed by flows following arbitrary paths. We show that such methodology yields better bounds than those obtained through both per-node analysis and comparable methods proposed in the literature.

Keywords: Network Calculus FIFO-multiplexing Delay Bound.

Published: 2010-05-16
Modified: 2011-09-14

: http://dx.doi.org/10.4108/valuetools.2007.1912