A minimum-hop routing algorithm based on distributed information

DOI10.1016/0169-7552(89)90011-1MaRDI QIDQ4207595zbMATH OpenOpenAlexFDO

Authors J. J. Garcia-Luna-Aceves

Publication date 1989

Published in Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-7552(89)90011-1

zbMATH Keywords

networkdistributed algorithmsroutingshortest-pathminimum-hop

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99) Theory of operating systems (68N25)

Recommendations

• Another adaptive distributed shortest path algorithm
• A distributed adaptive routing algorithm
• On the distributed Bellman-Ford algorithm and the looping problem
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• Distributed algorithms for computing shortest pairs of disjoint paths

Cited in

(8)

• On the distributed Bellman-Ford algorithm and the looping problem
• Updating routing tables after resource failure in a distributed computer network
• scientific article; zbMATH DE number 1505488 (Why is no real title available?)
• A minimum interference routing algorithm with reduced computational complexity
• scientific article; zbMATH DE number 1717206 (Why is no real title available?)
• A coding-based approach to robust shortest-path routing
• scientific article; zbMATH DE number 599010 (Why is no real title available?)
• A loop-free shortest-path routing algorithm for dynamic networks

This page was built for publication: A minimum-hop routing algorithm based on distributed information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4207595)