552 search results - page 5 / 111 » Routing complexity of faulty networks |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
CNSR
2005
IEEE
13 years 9 months ago
2005
IEEE
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
TON
2008
13 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
WIMOB
2007
IEEE
14 years 1 months ago
2007
IEEE
— In a Mobile Ad hoc NETwork (MANET), mobile devices cooperate to forward packets for each other without the assistance of dedicated routing infrastructures. Due to its networkin...