83 search results - page 15 / 17 » Fault-Tolerant Routing Algorithms for Hypercube Networks |
SPAA
2003
ACM
14 years 28 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
This paper considers the requirements for a scalable, easily manageable, fault-tolerant, and efficient data center network fabric. Trends in multi-core processors, end-host virtua...
NOMS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...