On the Distributed Bellman-Ford Algorithm and the Looping Problem

References

• Aho A., Hopcroft J., Ullman J.The Design and Analysis of Computer Algorithms (1974) (Addison-Wesley, Reading, MA) Google Scholar
• Ahuja R., Magnanti T., Orlin J.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bellman R. On a routing problem. Quart. Appl. Math. (1958) 16:87–90Crossref, Google Scholar
• Bertsekas D., Gallager R.Data Networks (1987) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bertsekas D., Tsitsiklis J.Parallel and Distributed Computation: Numerical Methods (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Cegrell T. A routing procedure for the TIDAS message-switching network. IEEE Trans. Comm. (1975) 23:575–585Crossref, Google Scholar
• Cicerone S., Di Stefano G., Frigioni D., Nanni U. A fully dynamic algorithm for distributed shortest paths. Theoret. Comput. Sci. (2003) 297:83–102Crossref, Google Scholar
• Garcia-Luna-Aceves J. A distributed, loop-free, shortest-path routing algorithm. Proc. IEEE INFOCOM 88 (1988) March 1988New Orleans(IEEE Computer Society Press, New York) 1125–1137Crossref, Google Scholar
• Garcia-Luna-Aceves J. Loop-free routing using diffusing computations. IEEE/ACM Trans. Networking (1993) 1:130–141Crossref, Google Scholar
• Garcia-Luna-Aceves J. A path-finding algorithm for loop-free routing. IEEE/ACM Trans. Networking (1997) 5:148–160Crossref, Google Scholar
• Humblet P. Another adaptive distributed shortest path algorithm. IEEE Trans. Comm. (1991) 39:995–1003Crossref, Google Scholar
• Jaffe J., Moss F. A responsive distributed routing algorithm for computer networks. IEEE Trans. Comm. (1982) 30:1758–1762Crossref, Google Scholar
• Johnson M. Updating routing tables after resource failure in a distributed computer network. Networks (1984) 14:379–391Crossref, Google Scholar
• Merlin P., Segall A. A failsafe distributed routing protocol. IEEE Trans. Comm. (1979) 27:1280–1287Crossref, Google Scholar
• Ramalingam G., Reps T. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms (1996) 21:267–305Crossref, Google Scholar
• Ramarao K., Venkatesan S. On finding and updating shortest paths distributively. J. Algorithms (1992) 13:235–257Crossref, Google Scholar
• Schwartz M.Telecommunication Networks: Protocols, Modeling, and Analysis (1986) (Addison-Wesley, Reading, MA) Google Scholar
• Shin K., Chen M.-S. Performance analysis of distributed routing strategies free of ping-pong-type looping. IEEE Trans. Comput. (1987) 36:129–137Crossref, Google Scholar
• Shin K., Chou C.-C. A simple distributed loop-free routing strategy for computer communication networks. IEEE Trans. Parallel and Distrib. Syst. (1993) 4:1308–1319Crossref, Google Scholar