Publication

Network Resource Allocation for Competing Multiple Description Transmissions

Related publications (285)

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

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

EPFL2007

Non-cooperative behavior in wireless networks

Mark Felegyhazi

Existing cellular networks are centrally managed and require a tremendous initial investment. With the advancement of new wireless technologies, the operators of traditional networks have to face new competition. New technologies make it possible to provid ...

EPFL2007

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

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

Analog Genetic Encoding for the Evolution of Circuits and Networks

Dario Floreano, Claudio Mattiussi

This paper describes a new kind of genetic representation called analog genetic encoding (AGE). The representation is aimed at the evolutionary synthesis and reverse engineering of circuits and networks such as analog electronic circuits, neural networks, ...

2007

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows

Jean-Yves Le Boudec, Gianluca Rizzo

We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...

2007

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows

Jean-Yves Le Boudec, Gianluca Rizzo

2007

Generalization of the RIN result to heterogeneous networks of aggregate schedulers and leaky bucket constrained flows

Jean-Yves Le Boudec, Gianluca Rizzo

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

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Reza Shokri

Wireless ad hoc networks are so vulnerable to passive attacks and eavesdropping adversaries due to their shared medium which makes network traffic easy to capture and analyze. Therefore, security and privacy protections are of extreme importance for protoc ...

IEEE2007