Loss-bounded analysis for differentiated services

DOI10.1016/S0196-6774(02)00270-5MaRDI QIDQ4419482zbMATH OpenFDO

Authors Yishay Mansour, Alex Kesselman

Publication date 13 August 2003

Published in Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

Online algorithmsDiffServCompetitive analysisBuffer schedulingLoss-bounded analysis

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Loss-bounded analysis for differentiated services
• Competitive queue policies for differentiated services
• Improved competitive guarantees for QoS buffering
• A simple FIFO-based scheme for differentiated loss guarantees
• Improved competitive guarantees for QoS buffering

Cited in

(6)

• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• An optimal lower bound for buffer management in multi-queue switches
• An experimental study of new and known online packet buffering algorithms
• A simple FIFO-based scheme for differentiated loss guarantees
• Loss-bounded analysis for differentiated services
• Lower and upper bounds on FIFO buffer management in QoS switches

This page was built for publication: Loss-bounded analysis for differentiated services

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