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

Authors:
Zheng Wang;Jon Crowcroft
Affiliations:
-;-
Venue:
ACM SIGCOMM Computer Communication Review
Year:
1992

Citing 4
Cited 20

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The revised ARPANET routing metric

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Shortest path first with emergency exits

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A correctness proof of a topology information maintenance protocol for a distributed computer network

Communications of the ACM

Load-sensitive routing of long-lived IP flows

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The average diameter of binary tree structures

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
An Adaptive and Aggressively Bounded Convergence Algorithm for Enhancing and Measuring the Performance of applications Running on Networks with Heavy-Tailed Distributions

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth

Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks

Decision Support Systems
Stability of end-to-end algorithms for joint routing and rate control

ACM SIGCOMM Computer Communication Review
Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability of multi-path dual congestion control algorithms

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Routing optimization in IP networks utilizing additive and concave link metrics

IEEE/ACM Transactions on Networking (TON)
OSPF-based model of adaptive routing and possibility for stable network operations

AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Stability of multi-path dual congestion control algorithms

IEEE/ACM Transactions on Networking (TON)
Large-scale network parameter configuration using an on-line simulation framework

IEEE/ACM Transactions on Networking (TON)
Minimum disruption service composition and recovery in mobile ad hoc networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Modeling external network behavior by using internal measurements

Journal of Parallel and Distributed Computing
Mutually controlled routing with independent ISPs

NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Research: On the use of a stochastic estimator learning algorithm to the ATM routing problem: a methodology

Computer Communications
A fault tolerant model to attain reliability and high performance for distributed computing on the Internet

Computer Communications
Network management game

ACM SIGCOMM Computer Communication Review
Internet on the move: challenges and solutions

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

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.