Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30566-8_79 | ISPA |
Keywords | Field | DocType |
broadcasting algorithm,failure mode,bidirectional de bruijn graph,shortest path,efficient routing,fault tolerant routing,local broadcasting,spanning tree,de bruijn graph | Broadcasting,Shortest path problem,Computer science,Parallel algorithm,Theoretical computer science,De Bruijn graph,Fault tolerance,Spanning tree,De Bruijn sequence,K shortest path routing,Distributed computing | Conference |
Volume | ISSN | ISBN |
3358 | 0302-9743 | 3-540-24128-0 |
Citations | PageRank | References |
3 | 0.41 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ngoc Chi Nguyen | 1 | 8 | 1.87 |
| Nhat Minh Dinh Vo | 2 | 33 | 6.05 |
| Sungyoung Lee | 3 | 2932 | 279.41 |