Recherche

Afficher tous les résultats pour

Accueil

Personne

Christina Fragouli

Cette personne n’est plus à l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (117)

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

On achievable information rates in single-source non-uniform demand networks

Christina Fragouli, Emina Soljanin

A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where the receivers would like to receive from the source a rate that is (approximately) equal to their min-cut ...

2006

On conditions for constant throughput in wireless networks

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2006

Network Coding: An Instant Primer

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

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

Scaling laws for line networks: from zero-error to min-cut capacity

Urs Niesen, Christina Fragouli

2006

Information Flow Decomposition 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 ...

2006

Pulse communication

Christina Fragouli

2006

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

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

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 the benefits of network coding for wireless applications

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

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

Topology inferene using network coding

Suhas Diggavi, Christina Fragouli

2006

Coding Schemes for Line Networks

Mohammad Amin Shokrollahi, Christina Fragouli

We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose codi ...

2005

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...

2005

Silence is golden and time is money: power-aware communication for sensor networks

Christina Fragouli

2005

A Network Coding Approach to Network Monitoring (Invited Paper)

Christina Fragouli

Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network ...

2005

On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes

Urs Niesen, Christina Fragouli

We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fix ...

2005

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

Page 6 sur 6