TON
2010
13 years 9 months ago
2010
Abstract—In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using t...
ENDM
2002
13 years 11 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
SIGMETRICS
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...