Pseudo-conservation laws in cyclic-service systems with a class of limited service policies

DOI10.1007/BF02188705zbMath0755.60078OpenAlexW1999210374MaRDI QIDQ1197759

Deniz Sandhu, Kow C. Chang

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

Numerical resultsmean waiting timescyclic-service systemexpected amount of work left in the queues at the server departures

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Iterative approximation of \(k\)-limited polling systems ⋮ Exploring gate-limited analytical models for high-performance network storage servers

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-conservation laws in cyclic-service systems
• Multiqueue Systems with Nonexhaustive Cyclic Service
• Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
• A conservation law for a wide class of queueing disciplines

This page was built for publication: Pseudo-conservation laws in cyclic-service systems with a class of limited service policies