Browse > Article

Fault free Shortest Path routing on the de Bruijin network  

Ngoc Nguyen Chi (경희대학교 컴퓨터공학과 실시간멀티미디어연구실)
Nhat Vo Dinh Minh (경희대학교 컴퓨터공학과 실시간멀티미디어연구실)
Zhung Yonil (경희대학교 컴퓨터공학과 실시간멀티미디어연구실)
Lee Sungyoung (경희대학교 컴퓨터공학과 실시간멀티미디어연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.29, no.11B, 2004 , pp. 946-955 More about this Journal
Abstract
It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.
Keywords
de Bruijn graph; shortest path; fault tolerant routing; fault free shortest path;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M.A. Sridhar, C.S. Raghavendra, 'Fault Tolerant networks Based on the de Bruijn Graph', IEEE Trans. on Comp., 40, Issue 10,1991 pp 1167 1174   DOI   ScienceOn
2 R.A. Rowley, B. Bose, 'Fault-tolerant ring embedding in de Bruijn networks', IEEE Trans. on Comp,42,12,1993 pp 1480 1486   DOI   ScienceOn
3 Yang, Z. Feng, 'DBG MANs and their routing performance', Comm., IEEE Proc.,147, Issue 1,2000 pp 32 40   DOI   ScienceOn
4 A.H. Esfahanian, G, Zimmerman, 'A distributed broadcast algorithm for binaryDe Bruijn networks', 1988. ConferenceProceedings. Seventh Annual International Phoenix Conference on Comp. and Comm.,March 1988
5 D.K. Pradhan and S.M. Reddy, 'A fault-tolerant communication architecture for distributed systems', IEEE Trans. Comp. 31 (1982), 863.870
6 R.A. Rowley, B. Bose, 'Distributed ring embedding in faulty De Bruijn networks', IEEE Trans. on Comp.,46,2,1997 pp 187 190   DOI   ScienceOn
7 Zhen Liu, Ting-Yi Sung, 'Routing and Transmitting Problem in de Bruijn Networks' IEEE Trans. on Comp.,45,9,1996, pp 1056 1062   DOI   ScienceOn
8 Alfred V. Aho, Margaret J. Corasick, 'Efficient String Matching:, Comm. of the ACM,. 18 Issue 6, June 1975
9 Jyh-Wen Mao and Chang-Biau Yang, 'Shortest path routing and fault tolerant routing on de Bruijn networks', Networks, Vol. 35, Issue 3, Pages 207-215 2000   DOI   ScienceOn
10 D. Nadig, S.S. Iyengar, D.N. Jayasimha, 'A New Architecture for Distributed Sensor Integration', IEEE Proceeding of Southeastcon '93, 4-7 April 1993 pp 8 p
11 K.N. Sivarajan, R. Ramaswami, 'Lightwave networks based on de Bruijn graphs', IEEF/ACM Trans. on Networking,2.1,1994 pp 70 79   DOI   ScienceOn
12 C. Hyatt, D.P. Agrawal, 'Bidirectional versus unidirectional networks: cost/performance trade-offs', Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on ,Jan. 1995, pp 123 133
13 A.H. Esfahanian and S.L. Hakimi, 'Fault-tolerant routing in de Bruijn ccommunication networks', IEEE Trans. Comp. C-34 (1985), 777.788
14 L.Kleinrock, Communication Nets; Stochastic Message Flow and Delay, McGraw-Hill (New York), 1964. Reprinted by Dover Publication, 1972
15 Samantham, R. Maheswara , and D.K. Pradhan, 'The De Bruijn Multi-processor Network: A Versatile Parallel Processing and Sorting Network for VLSI,' IEEE Trans. on Camp., Vo1.38, NO.4, 1989
16 A.Sengupta, A.Sen, and S.Bandyopadhyay, 'Fault tolerant distributed system design', IEEE Trans. Circuit Syst., Vol. CAS-35, pp. 168-172, Feb. 1988
17 S.K. Das, C.C.Y. Chen, 'A new parallel algorithm for breadth-fIrst search on interval graphs', Parallel Processing Symposium, 1992. Proceedings., Sixth International ,March 1992