Sciweavers

473 search results - page 16 / 95
» Local Search in Unstructured Networks
Sort
View
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
15 years 10 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
WWW
2004
ACM
15 years 10 months ago
Dynamic search in peer-to-peer networks
This work* specifically addresses the search issues in unstructured peer-to-peer (P2P) systems that involve the design of an efficient search algorithm, the proposed dynamic searc...
Hsinping Wang, Tsungnan Lin, Chia Hung Chen, Yenna...
SASO
2007
IEEE
15 years 4 months ago
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, A...
ACSAC
2010
IEEE
14 years 1 months ago
Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
Baris Coskun, Sven Dietrich, Nasir D. Memon
DEXAW
2005
IEEE
125views Database» more  DEXAW 2005»
14 years 11 months ago
Exploiting Local Popularity to Prune Routing Indices in Peer-to-Peer Systems
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
Stéphane Bressan, Achmad Nizar Hidayanto, Z...