1. Awerbuch, B., Bar-Noy, A., Gopal, M.: Approximate distributed Bellman-Ford algorithms. IEEE Trans. Commun. 42(8), 2515–2517 (1994)
2. Hedrick, C.: Routing Information Protocol. IETF (1988).
https://www.rfc-editor.org/rfc/rfc1058.txt
3. Malkin, G.: RIP version 2-carrying additional information. IETF (1994).
https://www.rfc-editor.org/rfc/rfc1723.txt
4. Noto, M., Sato, H.: A method for the shortest path search by extended Dijkstra algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 2316–2320. IEEE (2000)
5. Jianya, Y.Y.G.: An efficient implementation of shortest path algorithm based on Dijkstra algorithm. J. Wuhan Tech. Univ. Surv. Mapp. (Wtusm) 3(004) (1999)