.tabbox {width:400px; margin-top: 15px;margin-bottom: 5px} .tabmenu {width:400px;height:28px;border-left:1px solid #CCC;border-top:1px solid #ccc;} .tabmenu ul {margin:0;padding:0;list-style-type: none;} .tabmenu li { text-align:center; float:left; display:block; width:99px; overflow:hidden; background-color: #f1f1f1; line-height:27px; border-right:#ccc 1px solid; border-bottom:#ccc 1px solid; display:inline;} .tabmenu .cli {text-align:center;float:left;display:block;width:99px;overflow:hidden;background-color: #fff;line-height:27px;border-right:#ccc 1px solid;border-bottom:#fff 1px solid;display:inline; cursor:pointer; color: #810505; font-weight:bold} #tabcontent {width:399px;background-color:#fff;border-left:#CCC 1px solid;border-right:#CCC 1px solid;border-bottom:#CCC 1px solid; height:60px;} #tabcontent ul {margin:0;padding:5px;list-style-type: none;} #tabcontent .hidden {display:none;} Search Browse by Issue Fig/Tab Adv Search
 HOME ABOUT JCST AUTHORS REVIEWERS PUBLISHED PAPERS FORTHCOMING PAPERS

• Articles •

### A Routing Algorithm with Candidate Shortest Path

1. Southwestern Jiaotong University; Emei;
• 出版日期:1986-05-10 发布日期:1986-05-10

### A Routing Algorithm with Candidate Shortest Path

Pan Qijing;

1. Southwestern Jiaotong University; Emei;
• Online:1986-05-10 Published:1986-05-10

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 contro...

Abstract: 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 contro...

 [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] 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] 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] P.M. Merlin and A Segall. A failsafe distributed routing protocol, IEEE Trans.on Communications.Com-27:9(1979), 1280-1287. [5] J. Hgouel and M. Schwartz, A distributed failsafe route table update algorithm, IBM Research Report,RC 9294, March (1982). [6] M. Schwartz, Routing and flow control in data networks, IBM Research Report, RC 8353, October(1980). [7] T.E. Stern, An Improved routing algorithm for distributed computer networks, IEEE International Symposium on Circuit and Systems, Workshop on Large Scale Networks and Systems, Houston, Texas, April(1980). [8] J.M. Taffe and F.H. moss, A responsive distributed routing algorithm for computer networks, IBM research Report RC 8479; September (1980). ……….
 No related articles found!
Viewed
Full text

Abstract

Cited

Shared
Discussed