Approximate sorting of packet-scheduling in high-speed networks

DOI10.1007/BF02948980zbMath1010.68021OpenAlexW2082873865MaRDI QIDQ5959352

Jing Li Zhou, Hui Zha, Sheng Sheng Yu, Youcheng Wang

Publication date: 3 April 2002

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948980

zbMATH Keywords

scheduling algorithmdeficit round robinpacket schedulingvirtual round robinweighted round robin

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service

This page was built for publication: Approximate sorting of packet-scheduling in high-speed networks