Publications related to Degraded two-message multicast over graphs

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

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 W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

On Broadcast with a Common Message over Networks

Satish Babu Korada, Dinkar Vasudevan

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

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

Visual Debugging of MPI Applications

Roger Hersch, Ali Al-Shabibi

We present the design and implementation of a debugging tool that displays a message-passing graph of the execution of an MPI application. Parts of the graph can be hidden or highlighted based on the stack trace, calling process or communicator of MPI call ...

Springer2008

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks

Panagiotis Papadimitratos, Reza Shokri, Amir Nayyeri

The privacy of users of mobile devices has been at stake, with emerging systems based on the mobile ad hoc networking technology raising additional concerns. The establishment of a connection between two nodes could readily reveal information to an eavesdr ...

2007

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer

Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...

2007

On the Throughput Improvement due to Limited Complexity Processing at Relay Nodes

Christina Fragouli

We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist config ...

2005

Replicated Processes in Manetho

Willy Zwaenepoel

This paper presents the processreplication protocol of Manetho, a system whose goal is to provide efficient, applicationtransparent fault tolerance to longrunning distributed computations. Manetho uses a new negative acknowledgment multicast protocol t ...

1992

Degraded two-message multicast over graphs

Graph Chatbot

Chat with Graph Search

On Degraded Two Message Set Broadcast

On degraded two-message set broadcast

On Broadcast with a Common Message over Networks

Visual Debugging of MPI Applications

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

On the Throughput Improvement due to Limited Complexity Processing at Relay Nodes

Replicated Processes in Manetho

On Degraded Two Message Set Broadcast

On degraded two-message set broadcast

On Broadcast with a Common Message over Networks

Replicated Processes in Manetho

On the Throughput Improvement due to Limited Complexity Processing at Relay Nodes

Visual Debugging of MPI Applications

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings