Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A routing algorithm with candidate shortest path

  • 29 Accesses


An improved algorithm based on the next node routing principle is proposed in this paper. In this algorithm there is a column added to the classical routing table, in which the candidate shortest distance to the destination node is the entry. When a link fails, the new shortest path in the nodes connected directly with the failure link can be found immediately (it is just the candidate shortest path before failure). For all other nodes in which routing tables should be changed, the required number of control messages and time for convergence are also less than Tajibnapis‖ algorithm and Predecessor algorithm. The message looping problem does not exist in duplex loop networks and is radically improved in mesh networks. These statements are proved by the analysis and simulation in this paper. From the simulation results of a 30-node mesh network, when one link goes down, the total number of control messages generated during convergence with this algorithm on the average is about 30% of Tajibnapis‖ algorithm. The iterations required is 50% of Tajibnapis‖ algorithm. The memory space required and computation complexity in nodes are almost the same as the two algorithms mentioned above and the algorithm implementation is as easy as well.

This is a preview of subscription content, log in to check access.


  1. [1]

    W.D. Tajibnapis, A correctness proof of a topology Information maintenance protocol for distributed computer networks,Communications of the ACM.20: 7(1979).

  2. [2]

    J. M. McQuillan, I. Richer and E. C. Rosen, The new routing algorithm for the ARPANET,IEEE Trans. on Communications,20:5(1980), 711–719.

  3. [3]

    M. Schwartz and Tak-kin Yum, Distributed routing in computer communication networks, the 21st IEEE Conference on Decision and Control, Orlando, Florida, Dec., 8–10(1982).

  4. [4]

    P. M. Merlin and A Segall, A failsafe distributed routing protocol,IEEE Trans on Commmunications, Com-27:9(1979), 1280–1287.

  5. [5]

    J. Hgouel and M. Schwartz, A distributed failsafe route table update algorithm, IBM Research Report, RC 9294, March (1982).

  6. [6]

    M. Schwartz, Routing and flow control in data networks, IBM Research Report, RC 8353, October (1980).

  7. [7]

    T. E. Stern, An Improved routing algorithm for distributed computer networks, IEEE International Symposium on Circuit and Systems, Worshoop on Large Scale Networks and Systems, Houston, Texas, April (1980).

  8. [8]

    J.M. Taffe and F.H. moss, A responsive distributed routing algorithm for computer networks, IBM research Report RC 8479 September (1980).

  9. [9]

    M. Schwartz and Y. E. Stern, Routing technique used in computer communication networks,IEEE Trans. on Communications, Com-28:4(1980), 539–552.

  10. [10]

    J. Hagouel, Issues in routing for large and dynamic networks, PHD Thesis, Columbia University(1983).

  11. [11]

    Chi-yuan Chin and Kai Hwang, A new probabilistic routing algorithm for packet—switched computer networks, National Computer Conference(1983).

  12. [12]

    T. Cegrell A routing procedure for the TIDS message switching networks,IEEE Trans on Communications, Com-23:6(1975), 575–585.

  13. [13]

    D. E. Sprole and F. Meilor, Routing, flow and congestion control in datapac network,IEEE Trans. on Communications, Com-29:4(1981).

  14. [14]

    M. Schwartz, Computer Communication Network Design and Analysis, Prentice-Hall(1977), Chap. 2.

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Pan, Q. A routing algorithm with candidate shortest path. J. of Compt. Sci. & Technol. 1, 33–52 (1986). https://doi.org/10.1007/BF02979461

Download citation


  • Short Path
  • Destination Node
  • Control Message
  • Link Failure
  • Link Cost