Sciweavers

666 search results - page 49 / 134
» Describing and simulating internet routes
Sort
View
INFOCOM
1998
IEEE
14 years 4 days ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
CONEXT
2007
ACM
13 years 11 months ago
NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data
The distributed nature of the Internet makes it difficult for a single service provider to troubleshoot the disruptions experienced by its customers. We propose NetDiagnoser, a tr...
Amogh Dhamdhere, Renata Teixeira, Constantine Dovr...
TC
2002
13 years 7 months ago
Coordinated En-Route Web Caching
Web caching is an important technique for reducing Internet access latency, network traffic, and server load. This paper investigates cache management strategies for en-route web ...
Xueyan Tang, Samuel T. Chanson
NDSS
2006
IEEE
14 years 1 months ago
Induced Churn as Shelter from Routing-Table Poisoning
Structured overlays are an important and powerful class of overlay networks that has emerged in recent years. They are typically targeted at peer-to-peer deployments involving mil...
Tyson Condie, Varun Kacholia, Sriram Sank, Joseph ...
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 3 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled