Concept

Overlay network

Related publications (526)

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.

On de Bruijn Routing in Distributed Hash Tables: There and Back Again

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

We show in this paper that de Bruijn networks, despite providing efficient search while using constant routing table size, as well as simplicity of the understanding and implementation of such networks, are unsuitable where key distribution will be uneven, ...

2004

On the role of feedback in large sensor networks

Michael Christoph Gastpar

Feedback can considerably simplify the task of approaching and achieving the performance limits predicted by information theory. This paper determines some of the potential offered by feedback in a typical sensor network situation that could be termed moni ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2004

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

GridVine: Building Internet-Scale Semantic Overlay Networks

Karl Aberer, Manfred Hauswirth, Philippe Cudré-Mauroux, Tim van Pelt

This paper addresses the problem of building scalable semantic overlay networks. Our approach follows the principle of data independence by separating a logical layer, the semantic overlay for managing and mapping data and metadata schemas, from a physical ...

2004

Scalability in adaptive multi-metric overlays

Dejan Kostic

Increasing application requirements have placed heavy emphasis on building overlay networks to efficiently deliver data to multiple receivers. A key performance challenge is simultaneously achieving adaptivity to changing network conditions and scalability ...

IEEE Comput. Soc2004

GosSkip: a Gossip-based Structured Overlay Network for Efficient Content-based Filtering

Rachid Guerraoui, Anne-Marie Kermarrec, Sidath Handurukande

It is appealing to implement publish/subscribe systems in a peer to peer (P2P) manner to circumvent the scalability issues of broker-based (semi-decentralized) systems and simplify the deployment. While existing P2P generic infrastructures provide a scalab ...

2004

Protocol overheads in networks

Prasenjit Dey

To increase network capacity, it may not be sufficient to just increase the capacity of the networks. It may be necessary to reduce the network overhead bits, to leave more room for the data bits, to increase the network capacity. As network functions beco ...

EPFL2004

Connectivity vs Capacity in Dense Ad Hoc Networks

Patrick Thiran, Olivier Dousse

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuat ...

2004

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

Experimental evaluation results of an advanced DHT-based peer-to-peer system

Karl Aberer, Manfred Hauswirth, Roman Schmidt

P-Grid is a decentralized DHT-based peer-to-peer system with logarithmic search complexity. As it is intended to provide a platform for distributed information management beyond mere file-sharing it supports an update functionality with lazy consistency gu ...

2004