Sciweavers

1008 search results - page 128 / 202
» Routing in intermittent network topologies
Sort
View
CCGRID
2001
IEEE
15 years 10 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin
HOTNETS
2010
15 years 1 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
CN
2007
154views more  CN 2007»
15 years 6 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
ICC
2007
IEEE
127views Communications» more  ICC 2007»
16 years 22 days ago
Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, M...
TCAD
2008
100views more  TCAD 2008»
15 years 6 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu