
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
MingYang Su, GenHuey Chen, DyiRong Duh, "A ShortestPath Routing Algorithm for Incomplete WKRecursive Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 4, pp. 367379, April, 1997.  
BibTex  x  
@article{ 10.1109/71.588608, author = {MingYang Su and GenHuey Chen and DyiRong Duh}, title = {A ShortestPath Routing Algorithm for Incomplete WKRecursive Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {4}, issn = {10459219}, year = {1997}, pages = {367379}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.588608}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A ShortestPath Routing Algorithm for Incomplete WKRecursive Networks IS  4 SN  10459219 SP367 EP379 EPD  367379 A1  MingYang Su, A1  GenHuey Chen, A1  DyiRong Duh, PY  1997 KW  Graphtheoretic interconnection network KW  incomplete WKrecursive network KW  multistage graph representation KW  routing KW  shortestpath routing algorithm KW  WKrecursive network. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The WKrecursive networks own two structural advantages: expansibility and equal degree. A network is
Designing shortestpath routing algorithms for incomplete networks is in general more difficult than for complete networks. The reason is that most incomplete networks lack a unified representation. One of the contributions of this paper is to demonstrate a useful representation, i.e., the multistage graph representation, for the incomplete WKrecursive networks. On the basis of it, a shortestpath routing algorithm is then proposed. With
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the ncube," Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] G.H. Chen and D.R. Duh, "Topological Properties, Communication, and Computation on WKRecursive Networks," Networks, vol. 24, no. 6, pp. 303317, 1994.
[3] N. Deo and C. Pang, "ShortestPath Algorithms: Taxonomy and Annotation," Networks, vol. 14, pp. 275323, 1984.
[4] D.R. Duh and G.H. Chen, “Topological Properties of WKRecursive Networks,” J. Parallel and Distributed Computing, vol. 23, pp. 468474, 1994.
[5] D.R. Duh and G. H. Chen, "On the Rabin Number Problem," manuscript.
[6] R. Fernandes, "Recursive Interconnection Networks for Multicomputer Networks," Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 7679, 1992.
[7] R. Fernandes and A. Kanevsky, "Hierarchical WKRecursive Topologies for Multicomputer Systems," Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 315318, 1993.
[8] R. Fernandes and A. Kanevsky, "Substructure Allocation in Recursive Interconnection Networks," Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 319322, 1993.
[9] R. Fernandes, D.K. Friesen, and A. Kanevsky, "Efficient Routing and Broadcasting in Recursive Interconnection Networks," Proc. Int'l Conf. Parallel Processing, pp. 5158, 1994.
[10] R. Fernandes, D.K. Friesen, and A. Kanevsky, “Embedding Rings in Recursive Networks,” Proc. IEEE Symp. Parallel and Distributed Processing, pp. 273280, 1994.
[11] A. Iazzetta, C. Sanges, and U. Scafuri, "Special Multicast Wormhole Routing for WKNetworks," manuscript.
[12] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604608, May 1988.
[13] S. Latifi and N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 97102, Jan. 1994.
[14] S. Latifi and N. Bagherzadeh, "On ClusteredStar Graph and Its Properties," manuscript.
[15] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[16] S. Ponnuswamy and V. Chaudhary, "Embedding of Cycles in Rotator and Incomplete Rotator Graphs," Proc. Int'l Symp. Parallel and Distributed Processing, pp. 603610, Oct. 1994.
[17] C.P. Ravikumar, A. Kuchlous, and G. Manimaran, "Incomplete Star Graph: Aan Economical FaultTolerant Interconnection Network," Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 8390, 1993.
[18] M.Y. Su, "On the Study of Incomplete WKRecursive Network," Ph.D. dissertation, Dept. of Computer Science and Information Engineering, National Taiwan Univ., Taipei, Taiwan, Jan. 1997.
[19] G.D. Vecchia and C. Sanges, “A Recursively Scalable Network VLSI Implementation,” Future Generation Computer Systems, vol. 4, no. 3, pp. 235243, 1988.
[20] G.D. Vecchia and C. Sanges, "An Optimized Broadcasting Technique for WKRecursive Topologies," Future Generation Computer Systems, vol. 4, no. 3, pp. 353357, 1989/90.