Publications related to Computation in Multicast Networks: Function Alignment and Converse Theorems

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 the Capacity of Non-Coherent Network Coding

Mahdi Jafari, Christina Fragouli, Suhas Diggavi

The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N >= 1 receivers can also be achieved using pack ...

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

Identity Aware Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit---for instance, in many cases, sensors are used to detec ...

2009

Latency-aware Leader Election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem of electing a leader that is eventually not only correct (as aptured by the fa ...

ACM2009

Latency-aware leader election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the prob- lem of electing a leader that is eventually not only correct (as captured by the ...

ACM Press2009

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

Multicast Parametric Sampling of 320 Gb/s Return-to-Zero Signal

Camille Sophie Brès

Technology for simultaneous demultiplexing of subrate tributaries is described and applied to 320-Gb/s return-tozero input. The parametric architecture is scalable with respect to processed input rate and relies on cascaded all-optical multicasting and sub ...

Institute of Electrical and Electronics Engineers2009

Achievable Flows on Orthogonal Information Networks

Dinkar Vasudevan

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

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

Query Driven Operator Placement for Complex Event Detection over Data Streams

Karl Aberer, Sebastian Michel, Oana Anca Jurca, Alexandre Herrmann

We consider the problem of efficiently processing subscription queries over data streams in large-scale interconnected sensor networks. We propose a scalable algorithm for distributed data stream processing, applicable on top of any platform granting acces ...

2008

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

Computation in Multicast Networks: Function Alignment and Converse Theorems

Graph Chatbot

Chat with Graph Search

On the Capacity of Non-Coherent Network Coding

Identity Aware Sensor Networks

Latency-aware Leader Election

Latency-aware leader election

On Degraded Two Message Set Broadcast

Multicast Parametric Sampling of 320 Gb/s Return-to-Zero Signal

Achievable Flows on Orthogonal Information Networks

Network Resource Allocation for Competing Multiple Description Transmissions

Methods for hardware reduction and overall performance improvement in communication system

Query Driven Operator Placement for Complex Event Detection over Data Streams

Network Resource Allocation for Competing Multiple Description Transmissions

Latency-aware leader election

Latency-aware Leader Election

Multicast Parametric Sampling of 320 Gb/s Return-to-Zero Signal

Achievable Flows on Orthogonal Information Networks

On the Capacity of Non-Coherent Network Coding

Identity Aware Sensor Networks

On Degraded Two Message Set Broadcast

Methods for hardware reduction and overall performance improvement in communication system

Query Driven Operator Placement for Complex Event Detection over Data Streams