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

DOI10.1287/moor.19.1.1zbMath0809.90048MaRDI 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 network; expected reward; loss network; dynamic routing schemes

Mathematics Subject Classification ID

90B18: Communication networks in operations research

90B06: Transportation, logistics and supply chain management

90B15: Stochastic network models in operations research

90C40: Markov and semi-Markov decision processes

60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)

Related Items

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