552 search results - page 7 / 111 » Routing complexity of faulty networks |
DSN
2009
IEEE
13 years 10 months ago
2009
IEEE
The dependability of overlay services rely on the overlay network’s capabilities to effectively diagnose and recover faults (e.g., link failures, overlay node outages). However,...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
INFORMATICALT
2006
13 years 7 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
ICPP
2002
IEEE
14 years 13 days ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
APPINF
2003
13 years 9 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...