Sciweavers

360 search results - page 22 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
P2P
2002
IEEE
112views Communications» more  P2P 2002»
15 years 4 months ago
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications
In this paper, we present the concept of Passive Distributed Indexing, a general-purpose distributed search service for mobile file sharing applications, which is based on peer-to...
Christoph Lindemann, Oliver P. Waldhorst
CCGRID
2010
IEEE
15 years 23 days ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
95
Voted
NCA
2009
IEEE
15 years 6 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu
98
Voted
PODC
2005
ACM
15 years 5 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
15 years 11 months ago
Sonnet: an efficient distributed content-based dissemination broker
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
Aoying Zhou, Weining Qian, Xueqing Gong, Minqi Zho...