Sciweavers

91 search results - page 9 / 19
» Scalable computation of acyclic joins
Sort
View
TPDS
2008
80views more  TPDS 2008»
13 years 7 months ago
Scalable and Efficient End-to-End Network Topology Inference
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
ECTEL
2006
Springer
13 years 11 months ago
Interoperability for Peer-to-Peer Networks: Opening P2P to the Rest of the World
Due to the information growth, distributed environments are offered as a feasible and scalable solution where Peerto-Peer networks have become more relevant. They bring many advan...
Ingo Brunkhorst, Daniel Olmedilla
DMIN
2008
158views Data Mining» more  DMIN 2008»
13 years 9 months ago
Mining User Movement Behavior Patterns in a Mobile Service Environment
Abstract - The rapid advances of wireless and web technologies enable the mobile users to request various kinds of services via mobile devices at anytime and anywhere. To provide t...
Yen-Ssu Chou, Tzung-Shi Chen
CCS
2009
ACM
14 years 2 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...