Shortest paths and loop-free routing in dynamic networks

Baruch Awerbuch

doi:10.1145/99508.99550

ScienceGate Book Chapters

JOURNAL ARTICLE

Shortest paths and loop-free routing in dynamic networks

Baruch Awerbuch

Year: 1990 Pages: 177-187

DOI: 10.1145/99508.99550

Get Full-Text PDF Get Analytical Report

Abstract

In this paper, we survey the existing methods for designing shortest paths routing algorithms for dynamic networks. We compare them based on worst-case communication and message complexity, and suggest new approach that yields a protocol with linear time and polynomial communication.

Keywords:

Computer science Routing (electronic design automation) Loop (graph theory) Routing protocol Adaptive routing Link-state routing protocol Shortest path problem Static routing Path vector protocol Distributed computing Equal-cost multi-path routing Computer network Theoretical computer science Mathematics Graph

Metrics

Cited By

0.55

FWCI (Field Weighted Citation Impact)

Refs

0.72

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Distributed systems and fault tolerance

Physical Sciences → Computer Science → Computer Networks and Communications

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Shortest paths and loop-free routing in dynamic networks

Abstract

Metrics

Topics

Related Documents

Shortest paths and loop-free routing in dynamic networks

A loop-free shortest-path routing algorithm for dynamic networks

Engineering a New Loop-Free Shortest Paths Routing Algorithm

Shortest Paths and Vehicle Routing in Dynamic Roadway Networks

Shortest paths for routing information over temporally dynamic communication networks