On the optimality of semidynamic routing schemes

DOI10.1016/0020-0190(81)90144-7zbMath0476.68033OpenAlexW2038970077MaRDI QIDQ1159981

Ashok K. Agrawala, Satish K. Tripathi

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90144-7

zbMATH Keywords

resource allocationrouting algorithmperformance measurement

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

A case study of an adaptive load balancing algorithm ⋮ Task allocation in multiserver systems -- a survey of results. ⋮ Optimization of static traffic allocation policies

Cites Work

• Unnamed Item
• A simple dynamic routing problem
• A Minimum Delay Routing Algorithm Using Distributed Computation
• A Combinatorial Method in the Theory of Queues

This page was built for publication: On the optimality of semidynamic routing schemes