552 search results - page 2 / 111 » Routing complexity of faulty networks |
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
NOMS
2006
IEEE
13 years 11 months ago
2006
IEEE
— The importance of the routers in the network and the vulnerability in the nature of the link state routing protocol highlight the necessity of effective routing protection agai...
ISPA
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
ISCAPDCS
2007
13 years 6 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...