Publication

Gossip-Based Peer Sampling

Related publications (34)

SoS: self-organizing substrates

Large-scale networked systems often, both by design or chance exhibit self-organizing properties. Understanding self-organization using tools from cybernetics, particularly modeling them as Markov processes is a first step towards a formal framework which ...

EPFL2006

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

Denial-of-service resilience in peer-to-peer file sharing systems

Willy Zwaenepoel, Dan Mihai Dumitriu

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immun ...

2005

A multiple core mode for protocol independent multicast

Francesc Font Torre de Mer

Internet communications have traditionally been based on point-to-point connections. This technique is called unicast and allows one sender and one receiver to communicate. The Internet saw the appearance of multicast protocols in the early 90's. Multicast ...

EPFL2004

Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism which tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks ...

2003

Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Patrick Eugster

Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism that tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks. ...

2003

Extremum feedback with partial knowledge

Jörg Widmer

A scalable feedback mechanism to solicit feedback from a potentially very large group of networked nodes is an important building block for many network protocols. Multicast transport protocols use it for negative acknowledgements and for delay and packet ...

2003

Lightweight Probabilistic Broadcast

Rachid Guerraoui, Sidath Handurukande, Patrick Eugster

The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong r ...

2003

Ruminations on Domain-Based Reliable Broadcast

Fernando Pedone

A distributed system is no longer confined to a single administrative domain. Peer-to-peer applications and business-to-business e-commerce systems, for example, typically span multiple local-area and wide-area networks, raising issues of trust, security, ...

2002

Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

2002

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.