An optimal fault-tolerant routing algorithm for weighted bidirectional double-loop networks

Dharmasena, Hettihe P.; Yan, Xiaofeng

doi:10.1109/tpds.2005.103

Cited by 10 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…has a solution t ≡ T (mod Q r), let t = t(e) = (Q r) e + T , where e is an integer which is big enough such that (8) and (9) hold. Since the diameter d(n; 1, s) of G(n; 1, s)=G(n(k, t, c); 1, s(k, t, c)) satisfies…”

Section: Lemmamentioning

confidence: 99%

See 1 more Smart Citation

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

Chen

Meng

et al. 2007

SCI CHINA SER A

View full text Add to dashboard Cite

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted great attention. A related and longtime unsolved problem is: for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained: (1) for any k 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k, e, c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k 0, an infinite family of singular k-tight optimal DLN can be constructed.

show abstract

Section: Lemmamentioning

confidence: 99%

“…If the links in DLN are changed into undirected edges, then DLN becomes an undirected double loop network, e.g., one can see the recent article [6] . With respect to an optimal (fault tolerant) routing algorithm and a reliable broadcasting in DLN or an undirected DLN, one can see [7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

Chen

Meng

et al. 2007

SCI CHINA SER A

View full text Add to dashboard Cite

show abstract

“…We have designed REIK network which has constant congestion to safeguard the critical routing functions under Byzantine attacks from peer collusion [2,5]. The inverse Kautz network provides multiple entry points and multiple routes between node pair.…”

Section: Introductionmentioning

confidence: 99%

An efficient overlay network based on many rings which embed inverse Kautz digraphs

Xiang

Jin

Shi

et al. 2010

2010 2nd International Conference on Future Computer and Communication

View full text Add to dashboard Cite

The current work deals with the problem of resource management in P2P networks. The topological properties of the overlay network are critical factors that dominate the performance of P2P networks. The inverse Kautz digraph is a good topology to construct the overlay network. We discuss an efficient DHT-based overlay network (MREIK) with Byzantine fault tolerance. MREIK based on many rings which embeds inverse Kautz digraphs, to enable multi-path P2P routing. Each node maintains a maximum limited number of 2d + 3 entries in its routing table, and any resource is distributed at an exit node based on the longest prefix matching rule. It supports both exact and similarity resources search efficiently. MREIK reduces REIK with one ring maintenance cast and provides high quality routing service.

show abstract

Optimal Routing of Tight Optimal Bidirectional Double-Loop Networks

Liu

Wang

2019

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

An optimal fault-tolerant routing algorithm for weighted bidirectional double-loop networks

Cited by 10 publications

References 16 publications

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

An efficient overlay network based on many rings which embed inverse Kautz digraphs

Optimal Routing of Tight Optimal Bidirectional Double-Loop Networks

Contact Info

Product

Resources

About