Sciweavers

580 search results - page 14 / 116
» Choosing a random peer
Sort
View
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 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...
CCGRID
2010
IEEE
13 years 8 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
14 years 2 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
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 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...
CONEXT
2006
ACM
14 years 1 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