Showing papers by "Laurent Viennot published in 2006"
Proceedings Article•
01 Jan 2006TL;DR: In this paper, the authors explore an evolution model derived from stable roommates theory that accounts for heterogeneity between nodes and show that most P2P applications can be modeled using stable matching theory.
Abstract: This paper aims at giving insight on the stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the will of getting the best service available. This is the case for most existing P2P networks. We explore an evolution model derived from stable roommates theory that accounts for heterogeneity between nodes. We show that most P2P applications can be modeled using stable matching theory. This is the case whenever preference lists can be deduced from the exchange policy. In many cases, the preferences lists are characterized by an interesting acyclic property. This leads us to the notion of acyclic preferences. We show that P2P networks with acyclic preferences possess a unique stable state with good convergence properties.
45 citations
13 Sep 2006
TL;DR: PrefixStream is presented, an algorithm that addresses the problem of multicasting a stream of packets in a large scale peer-to-peer environment by using reciprocity in packet forwarding, and promotes disjoint clustering.
Abstract: In this paper, we consider the problem of multicasting a stream of packets in a large scale peer-to-peer environment. In that context peers should have incentive to cooperate. We present PrefixStream, an algorithm that addresses this problem by using reciprocity in packet forwarding. Each node thus has incentive to forward since recipients send back other packets of the stream. To achieve this efficiently, PrefixStream strips the content across two sets of clustered trees built upon the symmetric de Bruijn graph. This both allows to banish nodes that do not respect reciprocity of exchanges and gives resilience to node failures. Furthermore, it reduces the forwarding load of every node to the stream bandwidth (every node uploads as much as it downloads) even when the size of its cluster varies. Conversely to previously proposed hierarchical schemes, PrefixStream promotes disjoint clustering. This enables loose maintenance and network latencies optimization. We sketch the design of PrefixStream and analyze its performances.
12 citations
26 Jun 2006
TL;DR: The purpose is to show that the PageRank can be decomposed into two terms, internal and external PageRank, which allow a better comprehension of thePageRank sig- nification inside and outside a site.
Abstract: Started in 1998, the search engine Google estimates page importance using several parameters. PageRank is one of those. Precisely, PageRank is a distribution of probability on the Web pages that depends on the Web graph. Our purpose is to show that the PageRank can be decomposed into two terms, internal and external PageRank. These two PageRanks allow a better comprehension of the PageRank sig- nification inside and outside a site. A first application is a local algorithm to estimate the PageRank inside a site. We will also show quantitative results on the possibilities for a site to boost its own PageRank.
9 citations
Posted Content•
TL;DR: It is shown that P2P networks with acyclic preferences possess a unique stable state with good convergence properties, and can be modeled using stable matching theory.
Abstract: This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the best service available. This is the case for most existing P2P networks. We explore an evolution model derived from stable roommates theory that accounts for heterogeneity between nodes. We show that most P2P applications can be modeled using stable matching theory. This is the case whenever preference lists can be deduced from the exchange policy. In many cases, the preferences lists are characterized by an interesting acyclic property. We show that P2P networks with acyclic preferences possess a unique stable state with good convergence properties.
2 citations
19 Feb 2006
TL;DR: A general architecture framework for solving the problems of publishing, storing indexes and answering request in the case of a file sharing application and enabling keyword searching based on the assumption that few words are associated with each file is sketches.
Abstract: A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient indexing is still an open problem. Numerous work on structured overlay networks such as distributed hash tables offer a promising framework. However, balancing the load of publishing, storing indexes and answering request still remains a challenging task. We sketch a general architecture framework for solving these problems in the case of a file sharing application. Our design goals include reducing the work of file providers (they should not bare all the publishing process) and enabling keyword searching based on the assumption that few words are associated with each file.
1 citations
01 Jan 2006
TL;DR: PrefixStream is presented, an anal- gorithm that addresses the problem of multicasting a stream ofpackets in a largescale peer- to-peer environment by using reciprocity in packetforwarding and reduces the forwarding load of every node even when the size of its cluster varies.
Abstract: Inthispaper, we consider theproblemof multicasting a streamofpackets ina largescale peer- to-peer environment. Inthatcontext peersshouldhave incentive tocooperate. We present PrefixStream, anal- gorithm thataddresses thisproblem byusingreciprocity inpacketforwarding. Eachnodethushasincentive to forward since recipients sendbackotherpackets ofthe stream. Toachieve this efficiently, PrefixStream strips the content across twosetsofclustered treesbuilt uponthe symmetric deBruijn graph. Thisbothallows tobanish nodesthatdonotrespect reciprocity ofexchanges and gives resilience tonodefailures. Furthermore, itreduces theforwarding loadofeverynodetothestreambandwidth (every nodeuploads asmuchasitdownloads) evenwhen thesizeofitscluster varies. Conversely topreviously proposed hierarchical schemes, PrefixStream promotes disjoint clustering. Thisenables loosemaintenance and networklatencies optimization. We sketch thedesign of PrefixStream andanalyze itsperformances.