On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks

DOI10.1007/978-3-642-00393-6_9zbMath1169.68346OpenAlexW1894563787MaRDI QIDQ3616979

Matthias Auchmann, Guillaume Urvoy-Keller

Publication date: 26 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00393-6_9

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 (2)

Instability of LAS multiclass queueing networks ⋮ On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks

Cites Work

• Processor-sharing queues: Some progress in analysis
• On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks

This page was built for publication: On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks