Asymptotic optimality of shortest path routing algorithms

DOI10.1109/TIT.1987.1057274MaRDI QIDQ3028855zbMATH OpenFDO

Authors Eli Gafni, Dimitri P. Bertsekas

Publication date 1987

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

adaptive shortest path routingcommunication networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Communication theory (94A05)

Recommendations

• Distributed asynchronous optimal routing in data networks
• Shortest-Path Routing in Arbitrary Networks
• A k shortest path algorithm for adaptive routing in communications networks
• An optimal adaptive routing algorithm
• A minimax approach to a simple routing problem

Cited in

(18)

• On asymptotically optimal routing in large wireless networks and geometrical optics analogy
• Asymptotic analysis of congested communication networks.
• Optimally routing data in fiber-optic networks with existing flow
• Optimal adaptive routing with efficient flapping prevention
• A coding-based approach to robust shortest-path routing
• Distributed asynchronous optimal routing in data networks
• A k shortest path algorithm for adaptive routing in communications networks
• Convergence of gradient projection routing methods in an asynchronous stochastic quasi-static virtual circuit network
• Worst Case Bounds for Shortest Path Interval Routing
• Shortest-Path Routing in Arbitrary Networks
• Time complexity of a path formulated optimal routing algorithm
• scientific article; zbMATH DE number 1505488 (Why is no real title available?)
• Adaptive Source Routing in High-Speed Networks
• New transience bounds for max-plus linear systems
• From the physics of interacting polymers to optimizing routes on the London underground
• The Value of Side Information in Shortest Path Optimization
• The choice of the best among the shortest routes in transparent optical networks
• Large margin shortest path routing

This page was built for publication: Asymptotic optimality of shortest path routing algorithms

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