Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks

DOI10.1287/moor.19.1.1zbMath0809.90048OpenAlexW2039294751MaRDI QIDQ4294725

F. P. Kelly

Publication date: 19 June 1994

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

Full work available at URL: https://doi.org/10.1287/moor.19.1.1

zbMATH Keywords

queueing networkexpected rewardloss networkdynamic routing schemes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Markov and semi-Markov decision processes (90C40) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (3)

Optimization via trunk reservation in single resource loss systems under heavy traffic ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Optimal Routing in Closed Queueing Networks with State Dependent Queues

This page was built for publication: Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks