Sciweavers

1008 search results - page 87 / 202
» Routing in intermittent network topologies
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
IPTPS
2005
Springer
15 years 12 months ago
Quickly Routing Searches Without Having to Move Content
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
Brian F. Cooper
IPPS
2003
IEEE
15 years 11 months ago
A Low Cost Fault Tolerant Packet Routing for Parallel Computers
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be ...
Valentin Puente, José A. Gregorio, Ram&oacu...
CONEXT
2005
ACM
15 years 8 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
PERCOM
2009
ACM
16 years 7 months ago
Mobile Ad Hoc Networks: the DHT paradigm
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
Marcello Caleffi