Optimal broadcasting in binary de Bruijn networks and hyper-deBruijn networks

Ganesan, Elaiyasuriyan; Pradhan, Dhiraj K.

doi:10.1109/ipps.1993.262803

Cited by 6 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, his algorithm can tolerate only one failure node in binary de Bruijn networks and it cannot achieve shortest path if there is failure node on the path. Broadcasting problems on dBG have been investigated as local broadcasting [6] and arc-disjoint spanning trees [7] [8]. Nonetheless, the above can only work in a binary de Bruijn network (dBG (2,k)).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Routing and Broadcasting Algorithms in de Bruijn Networks

Nguyen

Lee

2004

Parallel and Distributed Processing and Applications

View full text Add to dashboard Cite

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 1 .

show abstract

Section: Introductionmentioning

confidence: 99%

“…• Apply type RL2: the maximum match string [5] between A 01000 and D 01021 is 1 (path length: 6), between B 11000 and D 01021 is 1 (path length: 7), and between C 21000 and D 01021 is 2 (same as case R) → min is 3, node C.…”

Section: Introductionmentioning

confidence: 99%

Efficient Routing and Broadcasting Algorithms in de Bruijn Networks

Nguyen

Lee

2004

Parallel and Distributed Processing and Applications

View full text Add to dashboard Cite

show abstract

“…Some typical broadcasting applications are synchronizing different processors in a distributed computing network, and reconfiguring multiprocessor architecture. Recently, broadcasting problems on dBG have been investigated as local broadcasting [3] and arc-disjoint spanning trees based broadcasting [4] [5].…”

Section: Introductionmentioning

confidence: 99%

An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d,k)

Nguyen

Lee

2004

Parallel and Distributed Computing: Applications and Technologies

View full text Add to dashboard Cite

Abstract. Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorithms can only work in binary dBG. In this paper, we investigate broadcasting in bidirectional dBG for a degree greater than or equal to two. A distributed broadcast algorithm for one-to-all broadcasting in the all port communication is proposed for dBG (d,k) 1 .

show abstract

The hyper-deBruijn networks: scalable versatile architecture

Ganesan

Pradhan

1993

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Both Hypercube and deBruijn networks possess desirable properties. It should be understood, though, that some of the attractive features of one are not found in the other. The architecture proposed in this paper is a combination of these architectures, providing some of the desirable properties of both the networks such as admitting many computationally important networks, flexibility in terms of connections per node as well as level of fault-tolerance. Also the network allows a simple VLSI layout, scalability as well as decomposability. Thus, these networks can be a potential candidate for VLSI multiprocessor networks. The proposed network possesses logarithmic diameter, optimal connectivity, and simple routing algorithms amendable to networks with faults. Importantly, in addition to being pancyclic, these hyper-deBruijn networks admit most computationally important subnetworks including rings, multidimensional meshes, complete binary trees, and mesh of trees with perfect dilation.Techniques for optimal one-to-all (OTA) broadcasting in these networks are presented. As an intermediate result, this technique provides the fastest OTA broadcasting in binary deBruijn networks as well. The recent renewed interest in binary deBruijn networks makes this later result valuable.

show abstract

Optimal broadcasting in binary de Bruijn networks and hyper-deBruijn networks

Cited by 6 publications

References 12 publications

Efficient Routing and Broadcasting Algorithms in de Bruijn Networks

Efficient Routing and Broadcasting Algorithms in de Bruijn Networks

An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d,k)

The hyper-deBruijn networks: scalable versatile architecture

Contact Info

Product

Resources

About