Concepedia

Dynamics of distributed shortest-path routing algorithms

W.T. Zaumen, J. J. Garcia-Luna Aceves

1991 · 58 citations · 12 references

Open access

Concepts

ComputingComputer ScienceComputer SystemsAlgorithmsComputer NetworksDistributed SystemsCommunication NetworksDistributed AlgorithmsDistributed ComputingRoutingRouting AlgorithmsShortest Path AlgorithmsDistributed RoutingDistributed Routing AlgorithmsDistributed Shortest Path AlgorithmsMessage RoutingRouting TheoryShortest Path Routing

Abstract

The dynamics of shortest-path routing algorithms bss.ed on distance vectors and link states are investigated.

References

12

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

Natural Sciences, Computer Science, Mathematics +6

Termination detection for diffusing computations

Edsger W. Dijkstra, Carel S. Schölten · Information Processing Letters · 1980 · 687 citations

Computing, Computer Engineering, Computer Science +5

The New Routing Algorithm for the ARPANET

John M. McQuillan, I. Richer, Eric Rosen · IRE Transactions on Communications Systems · 1980 · 683 citations

Computing, Computer Science, Computer Systems +15

A Failsafe Distributed Routing Protocol

Philip M. Merlin, A. Segall · IRE Transactions on Communications Systems · 1979 · 210 citations

Computing, Communication, Computer Science +17

A loop-free extended Bellman-Ford routing protocol without bouncing effect

C. Cheng, Richard D Riley, S. P. R. Kumar et al. · 1989 · 192 citations

Computing, Computer Science, Computer Systems +17