Routing with limited state information in queueing systems with blocking

DOI10.1109/9.299642MaRDI QIDQ4306770zbMATH OpenOpenAlexFDO

Authors Panayotis D. Sparaggis, Don Towsley, Christos G. Cassandras

Publication date 25 September 1994

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.299642

zbMATH Keywords

data communication networksoptimality of routing policiesqueueing systemsqueueing systems with blockinground robin policyrouting

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Circuits, networks (94C99)

Recommendations

• Optimality of the round-robin routing policy
• Optimal Routing Among ⋅/M/1 Queues with Partial Information
• Routing in queueing networks under imperfect information: stochastic dominance and thresholds
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Admission and routing control with partial information and limited buffers

Cited in

(8)

• Optimal control of multiclass parallel service systems
• Sample path methods in the control of queues
• Asymptotic optimality of the round-robin policy in multipath routing with resequencing
• Optimal Routing Among ⋅/M/1 Queues with Partial Information
• Optimality of the round-robin routing policy
• Admission and routing control with partial information and limited buffers
• scientific article; zbMATH DE number 7139895 (Why is no real title available?)
• A paradox in a queueing network with state-dependent routing and loss

This page was built for publication: Routing with limited state information in queueing systems with blocking

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