Name
Abstract | ||
|---|---|---|
In this paper, delay bounds in data flow systems with non-FIFO service disciplines are explored. It is shown that conventional
network calculus definitions of a service curve are not satisfying under the assumption of non-FIFO service. Either the definition
is too strict to allow for a concatenation and consequent beneficial end-to-end analysis, or it is too loose and thus results
in infinite delay bounds. Hence, a new definition is proposed and demonstrated to achieve both finite delay bounds and a concatenation
of systems resulting in a favourable end-to-end analysis. In particular, we show that the celebrated pay bursts only once
phenomenon is retained under non-FIFO service.
|
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-540-92666-5_12 | kommunikation in verteilten systemen |
Keywords | Field | DocType |
conca- tenation property.,pay bursts only once,non-fifo,network calculus | FIFO (computing and electronics),Computer science,Algorithm,Concatenation,Network calculus,Data flow diagram | Conference |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jens B. Schmitt | 1 | 691 | 66.31 |
| Nicos Gollan | 2 | 25 | 3.45 |
| Ivan Martinovic | 3 | 930 | 82.51 |