A note on Time and Space Methods in Network Calculus

• Presented at: International Zurich Seminar on Broadband Communications, Zurich, Switzerland
• Published in: International Zurich Seminar on Broadband Communications, p. 267-272
• Publication date: 1998

We model some lossless queuing systems arising in guaranteed service networks as non-linear min-plus systems that can be bounded by linear systems. We introduce the distinction between space and time methods for such systems. Space methods are related to min-plus system theory, while time methods borrow from dynamic programming and exploit the causality of the operators. We apply this to the window flow control problem previously studied by Cruz and Okino

Keywords: Guaranteed Quality of Service ; ATM ; Dijkstra`s Algorithm ; Dynamic Programming ; Network Calculus ; Min-Plus Algebra

Reference

• LCA-CONF-1998-001
• View record in Web of Science

Record created on 2004-08-31, modified on 2012-03-20