Publication

The essence of P2P: A reference architecture for overlay networks

Related publications (61)

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.

Information flow decomposiiton for network coding

Christina Fragouli, Emina Soljanin

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

Institute of Electrical and Electronics Engineers2006

SoS: self-organizing substrates

Anwitaman Datta

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

Probabilistic Graphical Models for Human Interaction Analysis

Dong Zhang

The objective of this thesis is to develop probabilistic graphical models for analyzing human interaction in meetings based on multimodel cues. We use meeting as a study case of human interactions since research shows that high complexity information is mo ...

IDIAP2006

Probabilistic Graphical Models for Human Interaction Analysis

Dong Zhang

École Polytechnique Fédérale de Lausanne2006

Probabilistic graphical models for human interaction analysis

Dong Zhang

EPFL2006

Analysis of peer-to-peer file dissemination

Jochen Mundinger

In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server S to a potentially large group of N end users via the Internet. A number of algorithms and protocols have been suggested, implemented ...

2006

Analysis of Peer-to-Peer File Dissemination amongst Users of Different Upload Capacities

Jochen Mundinger

In recent years, overlay networks have proven an effective way of disseminating a file from a single source to a group of end users via the Internet. A number of algorithms and protocols have been suggested, implemented and studied. In particular, much att ...

2006

Cost-Aware Processing of Similarity Queries in Structured Overlays

Manfred Hauswirth, Roman Schmidt

Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the same schema and value representations and data quality problems due to spelling ...

2006

The essence of P2P: A reference architecture for overlay networks

Karl Aberer, Manfred Hauswirth, Sarunas Girdzijauskas

The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide varie ...

2005

The essence of P2P: A reference architecture for overlay networks

Karl Aberer, Manfred Hauswirth, Sarunas Girdzijauskas

The success of the peer-to-peer idea has created a huge diversity of approaches. A wide variety of structures and architectures have been proposed. The terminology and abstractions used, however, are quite confusing since the P2P paradigm has interested re ...

2005