552 search results - page 1 / 111 » Routing complexity of faulty networks |
PODC
2005
ACM
13 years 10 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
ICDCSW
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2-D) meshes with faulty nodes contained in a set of disjoint faulty blocks. ...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
— Broadcasting is a data communication task in which one processor sends the same message to all other processors. Routing is a task where a source processor sends a message to a...
ISCAPDCS
2004
13 years 6 months ago
2004
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...