Sciweavers

580 search results - page 14 / 116
» Choosing a random peer
Sort
View
114
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 3 months ago
A Queueing System for Modeling a File Sharing Principle
We investigate in this paper the performance of a file sharing principle similar to the one implemented by eMule. For this purpose, we consider a system composed of N peers becomi...
Florian Simatos, Philippe Robert, Fabrice Guillemi...
135
Voted
CCGRID
2010
IEEE
15 years 4 months 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
EUROPAR
2009
Springer
15 years 10 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
110
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 3 months ago
LiquidXML: Adaptive XML Content Redistribution
We propose to demonstrate LiquidXML, a platform for managing large corpora of XML documents in large-scale P2P networks. All LiquidXML peers may publish XML documents to be shared...
Jesús Camacho-Rodríguez, Asterios Ka...
132
Voted
CONEXT
2006
ACM
15 years 9 months ago
Shortcuts in a virtual world
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
Moritz Steiner, Ernst W. Biersack