Deciding the FIFO Stability of Networks in Polynomial Time

DOI10.1007/11758471_11MaRDI QIDQ3434546zbMATH OpenOpenAlexFDO

Authors Maik Weinard

Publication date 2 May 2007

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

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

Mathematics Subject Classification ID

Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Distributed Computing
• A simple proof for the stability of global FIFO queueing networks
• Instability of FIFO queueing networks
• scientific article; zbMATH DE number 1750590
• Stability of queueing networks and scheduling policies
• scientific article; zbMATH DE number 4115984
• scientific article; zbMATH DE number 3998937

Cited in

(8)

• Optimal consistent network updates in polynomial time
• Stability in heterogeneous dynamic multimedia networks
• scientific article; zbMATH DE number 2080866 (Why is no real title available?)
• scientific article; zbMATH DE number 4115984 (Why is no real title available?)
• scientific article; zbMATH DE number 1445332 (Why is no real title available?)
• Distributed Computing
• The robustness of stability under link and node failures
• On deciding stability of multiclass queueing networks under buffer priority scheduling policies

This page was built for publication: Deciding the FIFO Stability of Networks in Polynomial Time

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