On the duality between routing and scheduling systems with finite buffer space

DOI10.1109/9.237664zbMath0787.93009OpenAlexW2138808518MaRDI QIDQ3143015

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

Publication date: 20 December 1993

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

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

zbMATH Keywords

shortest queuesmallest residual capacity

Mathematics Subject Classification ID

Attainable sets, reachability (93B03)

Related Items (7)

Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue ⋮ Duality relations for queues with arrival and service control ⋮ Sample path methods in the control of queues ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Web server load balancing: a queueing analysis ⋮ Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers ⋮ Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques

This page was built for publication: On the duality between routing and scheduling systems with finite buffer space