Efficient routing and broadcasting algorithms in de bruijn networks

Authors:
Ngoc Chi Nguyen;Nhat Minh Dinh Vo;Sungyoung Lee
Affiliations:
Computer Engineering Department, Kyung Hee Univerity, Gyeonggi, Korea;Computer Engineering Department, Kyung Hee Univerity, Gyeonggi, Korea;Computer Engineering Department, Kyung Hee Univerity, Gyeonggi, Korea
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 4
Cited 1

Fault-Tolerant Routing in DeBruijn Comrnunication Networks

IEEE Transactions on Computers
Routing and Transmitting Problems in de Bruijn Networks

IEEE Transactions on Computers
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Optimal broadcasting in binary de Bruijn networks and hyper-deBruijn networks

IPPS '93 Proceedings of the 1993 Seventh International Parallel Processing Symposium

Analyzing locality over a P2P computing architecture

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent. Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algorithms can only work in dBG(2,k). In this paper, we investigate shortest path routing algorithms in the condition of existing failure, based on the Bidirectional de Bruijn graph (BdBG). And we also investigate broadcasting in BdBG for a degree greater than or equal to two.