A short tutorial on network calculus. II. Min-plus system theory applied to communication networks

Author

Boudec, Jean-Yves Le ; Thiran, Patrick ; Giordano, Silvia

Author_Institution

ICA-DSC, EPFL, Lausanne, Switzerland

Volume

4

fYear

2000

fDate

2000

Firstpage

365

Abstract

For pt. I see ibid., vol.4, p.93-6 (May 2000). We model some queuing systems arising in guaranteed service networks (such as RSVP/IP or ATM) as nonlinear min-plus systems that can be bounded by linear systems. We apply this method to the window flow control problem previously studied by Chang (1997), Agrawal and Rajan (1996), to the optimal smoothing of video through a network offering guaranteed service. We revisit the greedy shaper, and we also show how the same method enables us to compute the losses in a shaper by modelling it as a linear min-plus system. Finally, we describe the time-varying shaper

Keywords

asynchronous transfer mode; calculus of communicating systems; losses; queueing theory; system theory; telecommunication networks; telecommunication traffic; visual communication; ATM networks; RSVP/IP networks; communication networks; greedy shaper; guaranteed service networks; linear min-plus system; losses computation; min-plus system theory; network calculus; nonlinear min-plus systems; optimal smoothing; queuing systems; shaper modelling; time-varying shaper; video traffic; window flow control problem; Algebra; Calculus; Circuits; Communication networks; Differential equations; Linear systems; Optimal control; Queueing analysis; Smoothing methods; Tutorial;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on

Conference_Location

Geneva

Print_ISBN

0-7803-5482-6

Type

conf

DOI

10.1109/ISCAS.2000.858764

Filename

858764