Network Calculus: A Theory of Deterministic Queuing Systems for the Internet

✍ Scribed by Jean-Yves Le Boudec, Patrick Thiran (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2001
• Tongue: English
• Leaves: 279
• Series: Lecture Notes in Computer Science 2050
• Edition: 1
• Category: Library

✦ Synopsis

Network Calculus is a set of recent developments that provide deep insights into flow problems encountered in the Internet and in intranets. The first part of the book is a self-contained, introductory course on network calculus. It presents the core of network calculus, and shows how it can be applied to the Internet to obtain results that have physical interpretations of practical importance to network engineers. The second part serves as a mathematical reference used across the book. It presents the results from Min-plus algebra needed for network calculus. The third part contains more advanced material. It is appropriate reading for a graduate course and a source of reference for professionals in networking by surveying the state of the art of research and pointing to open problems in network calculus and its application in different fields, such as mulitmedia smoothing, aggegate scheduling, adaptive guarantees in Internet differential services, renegotiated reserved services, etc.

✦ Table of Contents

Network Calculus....Pages 3-81
Application of Network Calculus to the Internet....Pages 83-122
Basic Min-plus and Max-plus Calculus....Pages 125-157
Min-plus and Max-plus System Theory....Pages 159-182
Optimal Multimedia Smoothing....Pages 185-206
FIFO Systems and Aggregate Scheduling....Pages 207-225
Adaptive and Packet Scale Rate Guarantees....Pages 227-241
Time Varying Shapers....Pages 243-249
Systems with Losses....Pages 251-265

✦ Subjects

Computer Communication Networks; Operating Systems; Coding and Information Theory; Information Systems Applications (incl.Internet); Information Storage and Retrieval; Mathematics of Computing