Application of network calculus to guaranteed service networks

DOI10.1109/18.669170MaRDI QIDQ4400325zbMATH OpenOpenAlexFDO

Authors Jean-Yves Le Boudec

Publication date 18 October 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/27/files/LeBoudec98.pdf

zbMATH Keywords

arrival curvesasynchronous transfer modeeffective bandwidthlossless multiplexingmin-plus algebranetwork calculusvariable bit rate

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Recommendations

• Network calculus. A theory of deterministic queueing systems for the Internet
• scientific article; zbMATH DE number 1393308
• A Min-Plus Calculus for End-to-End Statistical Service Guarantees

Cited in

(10)

• An algorithmic toolbox for network calculus
• Concave piecewise linear service curves and deadline calculations
• Fractal teletraffic delay bounds in computer networks
• Optimal allocation of rates in guaranteed service networks
• Applying real-time interface and calculus for dynamic power management in hard real-time systems
• Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition
• Asymptotic identity in min-plus algebra: a report on CPNS
• Estimation and monitoring of traffic intensities with application to control of stochastic systems
• Characterization and algorithm for max-plus supereigenvector problem by parametric programming
• Bandwidth allocation, delay bound analysis, and controller synthesis for event-triggered control systems

This page was built for publication: Application of network calculus to guaranteed service networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400325)