Nearly optimal FIFO buffer management for two packet classes.

DOI10.1016/S1389-1286(03)00197-XzbMath1059.68515OpenAlexW2054429147MaRDI QIDQ1398880

Zvi Lotker, Boaz Patt-Shamir

Publication date: 7 August 2003

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1389-1286(03)00197-x

zbMATH Keywords

Competitive analysisThroughputQuality of ServiceBuffer overflowsClasses of service

Mathematics Subject Classification ID

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

Related Items (4)

An optimal lower bound for buffer management in multi-queue switches ⋮ Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms ⋮ Buffer management for colored packets with deadlines ⋮ Lower and upper bounds on FIFO buffer management in QoS switches

This page was built for publication: Nearly optimal FIFO buffer management for two packet classes.