Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems
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.
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, ...
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 ...
We find that there lacks a formal algebraic framework in the research area of P2P information retrieval. Such a formal framework is indispensable and pivotal. On the one hand, no solid theoretical foundation can explain why the results of many ad-hoc comme ...
Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communication network. In this paper, we formally verify a typical application running on a fi ...
In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an efficient overlay tree, one that meets pe ...
Peer-to-peer (P2P) systems are strongly decentralized and asynchronous distributed settings involving a potentially large number of hosts. A common programing model for P2P infrastructures is that of a distributed hashtable (DHT), though which peers share ...
We consider a source that transmits to a receiver by routing the information packets over a communication network and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that the processing capabilities of t ...
FUSE is a lightweight failure notification service for building distributed systems. Distributed systems built with FUSE are guaranteed that failure notifications never fail. Whenever a failure notification is triggered, all live members of the FUSE group ...
This paper focuses on replication in DHT based structured overlay networks, and presents a theoretical framework for optimal replication in such networks with respect to query frequency. In particular, we determine the optimal replication factor for query- ...
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 ...
