Scaled time priority: an efficient approximation to waiting time priority

DOI10.1016/J.COMNET.2004.02.009MaRDI QIDQ1886613zbMATH OpenOpenAlexFDO

Authors Hoon-Tong Ngin, Chen-Khong Tham

Publication date 18 November 2004

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2004.02.009

zbMATH Keywords

Differentiated servicesQuality of serviceProportional delay

Mathematics Subject Classification ID

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

Recommendations

• Two schedulers to provide delay proportion and reduce queueing delay simultaneously
• scientific article; zbMATH DE number 2088499
• An algorithm for achieving proportional delay differentiation
• Controlling delay differentiation with priority jumps: analytical study
• Frame-bound priority scheduling in discrete-time queueing systems

Cited in

(3)

• scientific article; zbMATH DE number 2088499 (Why is no real title available?)
• Two schedulers to provide delay proportion and reduce queueing delay simultaneously
• An algorithm for achieving proportional delay differentiation

This page was built for publication: Scaled time priority: an efficient approximation to waiting time priority

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