• Home
  • Search
  • Asymptotic optimality of shortest path routing algorithms
  • Open Access IconOpen Access
  • Cite Icon19
  • https://doi.org/10.1109/tit.1987.1057274Copy DOI Icon

Asymptotic optimality of shortest path routing algorithms

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Many communication networks use adaptive shortest path routing. By this we mean that each network link is periodically assigned a length that depends on its congestion level during the preceding period, and all traffic generated between length updates is routed along a shortest path corresponding to the latest link lengths. We show that in certain situations, typical of networks involving a large number of small users and utilizing virtual circuits, this routing method performs optimally in an asymptotic sense. In other cases, shortest path routing can be far from optimal.

Similar Papers
  • Conference Article
  • Citations8

Autonomous routing algorithms for networks with wide-spread failures

  • Oct 01, 2009
  • Wajahat Khan +2
  • Conference Article
  • Citations29

Optimal-Capacity, Shortest Path Routing in Self-Organizing 5G Networks using Machine Learning

  • Apr 01, 2019
  • Chetana V Murudkar +1
  • Conference Article
  • Citations2

Energy aware routing in high capacity overlays in wireless sensor networks

  • Mar 01, 2008
  • Shariful Hasan Shaikot +1
  • Conference Article
  • Citations5

Shortest Path Algorithm for Pore-scale Simulation of Water-alternating-gas Injection

  • Sep 08, 2008
  • Proceedings
  • M.I.J Van Dijke +2
  • Book Chapter
  • Citations19

Optimization of OSPF Routing in IP Networks

  • Jan 01, 2009
  • Andreas Bley +7
  • Conference Article
  • Citations5

Multiperiod Planning with Controlled Shortest Path Routing

  • Dec 01, 2010
  • Clara Kronberger +2
  • Conference Article
  • Citations1

A comparison of load-distributive path routing and shortest path routing in wireless ad hoc networks

  • Jun 01, 2014
  • Iffat Habib +2
  • Research Article
  • Citations4

Cost reduction of reliable networks using load balanced routing

  • Mar 01, 2010
  • IEEE Communications Letters
  • Marija Antic +1
  • Conference Article
  • Citations1

Practical Approach to Identifying Additive Link Metrics with Shortest Path Routing

  • Dec 01, 2015
  • Xiong Wang +4
  • Research Article
  • Citations180

Distributed energy-efficient cooperative routing in wireless networks

  • Oct 01, 2008
  • IEEE Transactions on Wireless Communications
  • Ahmed S Ibrahim +2
  • Research Article

Adaptive Routing for Meshed QKD Networks of Flexible Size Using Deep Reinforcement Learning

  • Feb 16, 2026
  • Photonics
  • Tim Johann +2
  • Research Article
  • Citations30

The time-dependent shortest path and vehicle routing problem

  • Aug 28, 2021
  • INFOR: Information Systems and Operational Research
  • Rabie Jaballah +3
  • Conference Article
  • Citations3

Improved Route Selection Strategy Based on K Shortest Path

  • Jun 01, 2019
  • Guanghao Huang +3
  • Conference Instance
  • Citations6

A green framework for energy efficient management in TDMA-based wireless mesh networks

  • Oct 22, 2012
  • Ahmed Amokrane +3
  • Research Article
  • Citations169

Negative-cycle detection algorithms

  • Jun 01, 1999
  • Mathematical Programming
  • Boris V Cherkassky +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.