CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper addresses the problem of estimating the worst-case end-to-end delay for a flow in a tandem of FIFO multiplexing nodes, following up our previous work [12]. We show that, contrary to the expectations, the state-of-the-art method for computing delay bounds, i.e. upper bounds on the worst-case delay, called the Least Upper Delay Bound (LUDB) methodology, may actually be larger than the worst-case delay even in simple cases. Thus, we first devise a method to compute improved delay bounds. Then, in order to assess how close the derived bounds are to the actual, still unknown, worst-case delays, we devise a method to compute lower bounds on the worst-case delay. Our analysis shows that the gap between the upper and lower bounds is quite small in many practical cases, which implicitly validates the upper bounds themselves.
| Titolo: | Estimating the Worst-case Delay in FIFO Tandems Using Network Calculus |
| Autori interni: | |
| Anno del prodotto: | 2008 |
| Abstract: | This paper addresses the problem of estimating the worst-case end-to-end delay for a flow in a tandem of FIFO multiplexing nodes, following up our previous work [12]. We show that, contrary to the expectations, the state-of-the-art method for computing delay bounds, i.e. upper bounds on the worst-case delay, called the Least Upper Delay Bound (LUDB) methodology, may actually be larger than the worst-case delay even in simple cases. Thus, we first devise a method to compute improved delay bounds. Then, in order to assess how close the derived bounds are to the actual, still unknown, worst-case delays, we devise a method to compute lower bounds on the worst-case delay. Our analysis shows that the gap between the upper and lower bounds is quite small in many practical cases, which implicitly validates the upper bounds themselves. |
| Handle: | http://hdl.handle.net/11568/200522 |
| ISBN: | 9789639799318 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
Copyright © 2021