Person

Christina Fragouli

This person is no longer with EPFL

Related publications (178)

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.

Towards Reliable Broadcasting using ACKs

Patrick Thiran, Christina Fragouli, Mathilde Durvy

We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network codi ...

2007

Subspace properties of randomized network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contributi ...

2007

Loss Tomography in General Topologies with Network Coding

Christina Fragouli

Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the en ...

2007

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

Information flow decomposiiton for network coding

Christina Fragouli, Emina Soljanin

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

Institute of Electrical and Electronics Engineers2006

Information Flow Decomposition for Network Coding

Christina Fragouli, Emina Soljanin

2006

A Network Coding Approach to Energy Efficient Broadcasting: from Theory to Practice

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We show that network coding allows to realize energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critic ...

2006

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

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

2006

Network Coding: An Instant Primer

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main b ...

2006

An Analysis of Finite-Memory Random Linear Coding on Packet Streams

Christina Fragouli

We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the ...

2006