Pay bursts only once holds for (some) non-FIFO systems

@article{Schmitt2011PayBO,
  title={Pay bursts only once holds for (some) non-FIFO systems},
  author={Jens B. Schmitt and Nicos Gollan and Steffen Bondorf and Ivan Martinovic},
  journal={2011 Proceedings IEEE INFOCOM},
  year={2011},
  pages={1970-1978}
}
Non-FIFO processing of flows by network nodes is not a rare phenomenon. Unfortunately, the state-of-the-art analytical tool for the computation of performance bounds in packet-switched networks, network calculus, cannot deal well with non-FIFO systems. The problem lies in its conventional service curve definitions. Either the definition is too strict to allow for a concatenation and consequent beneficial end-to-end analysis, or it is too loose and results in infinite delay bounds. Hence, in… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Network Calculus A Theory of Deterministic Queuing Systems for the Internet

  • J.-Y. Le Boudec, P. Thiran
  • Number 2050 in Lecture Notes in Computer Science…
  • 2001
Highly Influential
13 Excerpts

Similar Papers

Loading similar papers…