Analysis of shortest-path routing algorithms in a dynamic network environment

Zheng Wang, Jon CrowcroftACM SIGCOMM Computer Communication Review 1992 · DOI

Abstract

In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particularly those that attempt to adapt to traffic changes, frequently exhibit oscillatory behaviors and cause performance degradation. In this paper we first examine the problems from the perspective of control theory and decision making, and then analyze the behaviors of the shortest-path routing algorithms in details.
BibTeX
@article{wang1992analysis,
  author = {Zheng Wang and Jon Crowcroft},
  title = {{Analysis of shortest-path routing algorithms in a dynamic network environment}},
  journal = {ACM SIGCOMM Computer Communication Review},
  year = {1992},
  doi = {10.1145/141800.141805},
}

Loading related content...

Figure