Publication

Multiple source multiple destination topology inference using network coding

Related publications (44)

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.

Raptor Network Video Coding

Pascal Frossard, Nikolaos Thomos

In this paper, we consider the problem of streaming video information on lossy packet networks with path and source diversity, such as wireless mesh networks or more generally overlay architectures. We propose to distribute the video information between se ...

2007

An Analytic Finite Capacity Queueing Network Model Capturing Congestion and Spillbacks

Michel Bierlaire, Carolina Osorio Pizano

Analytic queueing network models constitute a flexible tool for the study of network flow. These aggregate models are simple to manipulate and their analytic aspect renders them suitable for use within an optimization framework. Analytic queueing network m ...

2007

An analytic finite capacity queueing network model capturing congestion and spillbacks

Michel Bierlaire, Carolina Osorio Pizano

2007

Generic emergent overlays in arbitrary peer identifier spaces

Karl Aberer, Wojciech Galuba

Unstructured overlay networks are driven by simple protocols that are easy to analyze and implement. The lack of structure, however, leads to weak message delivery guarantees and poor scaling. Structured overlays impose a global overlay topology that is th ...

2007

Network Monitoring: it depends on your points of view

Christina Fragouli, Suhas Diggavi

End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given so ...

2007

Loss Tomography in General Topologies with Network Coding

Christina Fragouli

Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the en ...

2007

Subspace properties of randomized network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contributi ...

2007

Node Cooperation in Hybrid Ad hoc Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

A hybrid ad hoc network is a structure-based network that is extended using multi-hop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station t ...

2006

Distributed processing over adaptive networks

Ali H. Sayed

Distributed adaptive algorithms are proposed based on incremental and diffusion strategies. Adaptation rules that are suitable for ring topologies and general topologies are described. Both distributed LMS and RLS implementations are considered in order to ...

2006

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

EPFL2005