Publications related to On the Complexity of Scheduling in Half-Duplex Diamond Networks

Structure of optimal schedules in diamond networks

We consider Gaussian diamond networks with n half-duplex relays. At any point of time, a relay can either be in a listening (L) or transmitting (T) state. The capacity of such networks can be approximated to within a constant gap (independent of channel SN ...

Ieee2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

Ieee2014

Functional Forwarding of Channel State Information

Michael Christoph Gastpar

Based on the recent compute-and-forward technique [1], a novel communication strategy is proposed under which functions of the channel state information are forwarded along the network. Those functions are chosen such that on the one hand, they can be effi ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Network Neutrality Inference

Ovidiu Sebastian Mara, Zhiyong Zhang

When can we reason about the neutrality of a network based on external observations? We prove conditions under which it is possible to (a) detect neutrality violations and (b) localize them to specific links, based on external observations. Our insight is ...

2014

Network Neutrality Inference

Ovidiu Sebastian Mara, Zhiyong Zhang

When can we reason about the neutrality of a network based on external observations? We prove conditions under which it is possible to (a) detect neutrality violations and (b) localize them to specific links, based on external observations. Our insight is ...

2014

Cooperative Relaying at Finite SNR-Role of Quantize-Map-and-Forward

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

This paper contributes to the design and analysis of Quantize-Map-and-Forward (QMF) relaying by optimizing its performance for small relay networks. QMF was proved to achieve the capacity of arbitrary networks within a bounded gap, as well as the optimal d ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

Biomechanics of DNA structures visualized by 4D electron microscopy

Ulrich Lorenz

We present a technique for in situ visualization of the biomechanics of DNA structural networks using 4D electron microscopy. Vibrational oscillations of the DNA structure are excited mechanically through a short burst of substrate vibrations triggered by ...

2013

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

On the Complexity of Scheduling in Half-Duplex Diamond Networks

Graph Chatbot

Chat with Graph Search

Structure of optimal schedules in diamond networks

Triangle Network Secrecy

Triangle Network Secrecy

Functional Forwarding of Channel State Information

Network Neutrality Inference

Network Neutrality Inference

Cooperative Relaying at Finite SNR-Role of Quantize-Map-and-Forward

Is the Network Turing-Complete?

Biomechanics of DNA structures visualized by 4D electron microscopy

Network Coding with Computation Alignment

Structure of optimal schedules in diamond networks

Triangle Network Secrecy

Functional Forwarding of Channel State Information

Triangle Network Secrecy

Is the Network Turing-Complete?

Network Neutrality Inference

Network Neutrality Inference

Cooperative Relaying at Finite SNR-Role of Quantize-Map-and-Forward

Biomechanics of DNA structures visualized by 4D electron microscopy

Network Coding with Computation Alignment