By Topic

A short tutorial on network calculus. I. Fundamental bounds in communication networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. -Y. Le Boudec ; ICA-DSC, EPFL, Lausanne, Switzerland ; P. Thiran

Network calculus is a collection of results based on MinPlus algebra, which applies to deterministic queuing systems found in communication networks. It can be used, for example, to understand the computations for delays used in the IETF guaranteed service, why re-shaping delays can be ignored in shapers or spacer-controllers, a common model for schedulers, etc. This short tutorial presents the basic results of network calculus and their application to some fundamental performance bounds in communication networks

Published in:

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on  (Volume:4 )

Date of Conference:

2000