Publications by Christina Fragouli

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.

Replication is a widely used method to protect large- scale data storage systems from data loss when storage nodes fail. It is well known that the placement of replicas of the different data blocks across the nodes affects the time to rebuild. Several syst ...

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

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 detect ...

Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that opti ...

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the space spanned by th ...

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achie ...

We consider an n-relay Gaussian diamond network where a source communicates to a destination with the help of n half-duplex relays. Achieving rates close to the capacity of this network requires to employ all the n relays under an optimal transmit/receive ...

We examine the throughput benefits that network coding offers with respect to the average through- put achievable by routing, where the average throughput refers to the average of the rates that the indi- vidual receivers experience. We relate these benefi ...

Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking ca- pabilities as well as their popularity and portability. How- ever, existing game engines do not exploit the locality of players to improve game ...

We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that req ...

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

Designing a communication protocol for sensor networks often involves obtaining the "right" trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present th ...

We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of μ messages to several receivers over separate erasure channels. The sender can broad- cast a single message or ...

In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information ﬂows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminat ...

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

Loss tomography aims at inferring the loss rate of links in a network from end-to-end measurements. Previous work in [1] has developed optimal maximum likelihood estimators (MLEs) for link loss rates in a single-source multicast tree. However, only sub-opt ...

Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secre ...

Christina Fragouli

Chat with Graph Search

Effect of replica placement on the reliability of large scale data storage systems

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Joint Identity-Message Coding for Sensor Networks

Online Broadcasting with Network Coding

Subspace properties of network coding and their applications

Network coding for undirected information exchange

On the Complexity of Scheduling in Half-Duplex Diamond Networks

On Average Throughput Benefits and Alphabet Size in Network Coding

MicroPlay: A Networking Framework for Local Multiplayer Games

Efficient Broadcasting Using Network Coding

Function computation via subspace coding

Secure Network Coding With Erasures and Feedback

Algebraic Algorithms for Vector Network Coding

SenseCode: Network Coding for Reliable Sensor Networks

Delay with network coding and feedback

Transmission techniques for relay-interference networks

Distributed Rate Allocation for Network-coded Systems

Creating Shared Secrets out of Thin Air

Maximum likelihood estimation for multiple-source losss tomography with network coding

Secure Network Coding with Erasures and Feedback