A New Approach for Routing in Arrangement Graphs and its Performance Evaluation
作者： Peter M. Yamakawa , Hiroyuki Ebara , Hideo Nakano
DOI: 10.1007/3-540-59175-3_114
关键词: Routing table 、 Static routing 、 Mathematical optimization 、 Link-state routing protocol 、 Equal-cost multi-path routing 、 Multipath routing 、 Dynamic Source Routing 、 Topology 、 Destination-Sequenced Distance Vector routing 、 Computer science 、 Path vector protocol
摘要: We consider only the case of faulty links, but it can be extended to nodes by following a similar procedure. Our algorithm has two novel features: looks for not optimal paths also near-optimal paths, and intends find an node mainly. believe that is useful tool improving efficiency routing algorithms, specially when information every possesses limited. show mathematical expression probability messages via path any pair nodes. source destination are at maximun distance illustrate our results. It shown routes with very high probability, enhance excellent properties communication (n, k)-arrangement graph.
springer.com
sci-hub.st 参考文章(10)
Balakrishnan Krishnamurthy, Dov Harel, Sheldon B. Akers, The Star Graph: An Attractive Alternative to the n-Cube. international conference on parallel processing. pp. 393- 400 ,(1987)
Pradip K. Srimani, Sumit Sur, A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network. international conference on parallel processing. pp. 267- 270 ,(1991)
Pradhan, Reddy, A Fault-Tolerant Communication Architecture for Distributed Systems IEEE Transactions on Computers. ,vol. 31, pp. 863- 870 ,(1982) , 10.1109/TC.1982.1676101
Khaled Day, Anand Tripathi, Arrangement graphs: a class of generalized star graphs Information Processing Letters. ,vol. 42, pp. 235- 241 ,(1992) , 10.1016/0020-0190(92)90030-Y
Esfahanian, Hakimi, Fault-Tolerant Routing in DeBruijn Comrnunication Networks IEEE Transactions on Computers. ,vol. 34, pp. 777- 788 ,(1985) , 10.1109/TC.1985.1676633
P.F. Corbett, Rotator graphs: an efficient topology for point-to-point multiprocessor networks IEEE Transactions on Parallel and Distributed Systems. ,vol. 3, pp. 622- 626 ,(1992) , 10.1109/71.159045
P.T. Gaughan, S. Yalamanchili, Adaptive routing protocols for hypercube interconnection networks IEEE Computer. ,vol. 26, pp. 12- 23 ,(1993) , 10.1109/2.211888
M.-S. Chen, K.G. Shin, Depth-first search approach for fault-tolerant routing in hypercube multicomputers IEEE Transactions on Parallel and Distributed Systems. ,vol. 1, pp. 152- 159 ,(1990) , 10.1109/71.80143
M.-S. Chen, K.G. Shin, Adaptive fault-tolerant routing in hypercube multicomputers IEEE Transactions on Computers. ,vol. 39, pp. 1406- 1416 ,(1990) , 10.1109/12.61061
J. Wu, K. Yao, Multicasting in injured hypercubes using limited global information international parallel and distributed processing symposium. pp. 548- 555 ,(1993) , 10.1109/SPDP.1993.395486