Personne

Emina Soljanin

Cette personne n’est plus à l’EPFL

Publications associées (15)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Status update through M/G/1/1 queues with HARQ

Elie Najm, Emina Soljanin

We consider a system where randomly generated updates are to be transmitted to a monitor, but only a single update can be in the transmission service at a time. Therefore, the source has to prioritize between the two possible transmission policies: preempt ...

2017

Timely Updates over an Erasure Channel

Elie Najm, Emina Soljanin

Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. %Coded redundancy is employed to ensure the timely delivery of codupdate packets. We start by deriving the averag ...

2017

Simplex Queues for Hot-Data Download

Elie Najm, Emina Soljanin

In cloud storage systems, hot data is usually replicated over multiple disks/servers in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance of the system. Recent cloud storage research has proposed using avail ...

2017

Network Coding Fundamentals

Christina Fragouli, Emina Soljanin

Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first most natural q ...

2007

Network Coding Applications

Christina Fragouli, Emina Soljanin

2007

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

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

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