Sciweavers

249 search results - page 49 / 50
» Distributed querying of Internet distance information
Sort
View
IPTPS
2005
Springer
15 years 2 months ago
Clustering in P2P Exchanges and Consequences on Performances
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
Stevens Le-Blond, Jean-Loup Guillaume, Matthieu La...
MOBIQUITOUS
2008
IEEE
15 years 3 months ago
Context-aware fault tolerance in migratory services
Mobile ad hoc networks can be leveraged to provide ubiquitous services capable of acquiring, processing, and sharing real-time information from the physical world. Unlike Internet...
Oriana Riva, Josiane Nzouonta, Cristian Borcea
CSCW
2004
ACM
15 years 2 months ago
High-performance telepointers
Although telepointers are valuable for supporting real-time collaboration, they are rarely seen in commercial groupware applications that run on the Internet. One reason for their...
Jeff Dyck, Carl Gutwin, Sriram Subramanian, Chris ...
VLDB
2004
ACM
180views Database» more  VLDB 2004»
15 years 2 months ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
WWW
2003
ACM
15 years 10 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...