Sciweavers

216 search results - page 14 / 44
» Overlay routing using coordinate systems
Sort
View
HOTOS
2007
IEEE
14 years 10 days ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
ICITA
2005
IEEE
14 years 2 months ago
A Structured Peer-to-Peer Method to Discover QoS Enhanced Alternate Paths
In the next generation Internet, the network should not only be considered as a communication medium, but also as an endless source of services available to the end-systems. These...
Thierry Rakotoarivelo, Patrick Sénac, Aruna...
PAM
2005
Springer
14 years 1 months ago
Internet Routing Policies and Round-Trip-Times
Abstract. Round trip times (RTTs) play an important role in Internet measurements. In this paper, we explore some of the ways in which routing policies impact RTTs. In particular, ...
Han Zheng, Eng Keong Lua, Marcelo Pias, Timothy G....
CIC
2004
13 years 9 months ago
Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication
Overlay topologies are now popular with many emerging peer-to-peer (P2P) systems, to efficiently locate and retrieve information. In contrast, the focus of this work is to use ove...
Gerald Fry, Richard West
JPDC
2006
133views more  JPDC 2006»
13 years 8 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr...