Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Retransmission (data networks)

Related publications (16)

Beyond worst-case analysis, with or without predictions

Andreas Maggiori

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings. In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competiti ...

EPFL2023

XOR-Based Encoding With Instantaneous Decoding for the Broadcast Erasure Channel With Feedback: The Three-User Case

We study the case of a three-user broadcast erasure channel with multiple unicast traffic sessions, where feedback from the users is fed back to the transmitter in the form of positive acknowledgment (ACK)/negative acknowledgment (NACK) messages. The capac ...

Institute of Electrical and Electronics Engineers2014

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

We consider the N-user broadcast erasure channel with unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; ...

Institute of Electrical and Electronics Engineers2013

Energy Efficient Offloading of 3G Networks

Jean-Yves Le Boudec, Nikodin Ristanovic

A huge increase in the amount of data consumed by smartphone users is becoming a serious problem for mobile operators. In three years, mobile data traffic in the AT&T's network rose 5000%. The US operators invest 50 billion dollars in their data networks e ...

2011

Boosting Gossip for Live Streaming

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod

Gossip protocols are considered very effective to disseminate information in a large scale dynamic distributed system. Their inherent simplicity makes them easy to implement and deploy. However, whereas their probabilistic guarantees are often enough to di ...

2010

Castor: Scalable Secure Routing for Ad Hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Zoran Despotovic, Wojciech Galuba, Marcin Poturalski

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that ad ...

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

Self-Stabilizing Robot Formations over Unreliable Networks

Seth Gilbert

We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy is for the mobile robots to impl ...

2009

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks

Martin Vetterli, François Ingelrest

The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions nevertheless occur. Opportunistic routing limits these retransmissions by taking adv ...

Springer Berlin / Heidelberg2009

Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad, Tarik Tabet

In this paper, we present an efficient protocol for the delay-limited fading ARQ single relay half duplex channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to decode, both the ...

2007

On feedback for network coding

Christina Fragouli

In this paper we examine possible ways that feedback can be used, in the context of systems with network coding capabilities. We illustrate, through a number of simple examples, that use of feedback can be employed for parameter adaptation to satisfy QoS r ...

2007

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2007

Schemes and architectures for wireless ad hoc networks and cooperative communication

Tarik Tabet

The focus of this thesis is on the study of decentralized wireless multi-hop networks. We are particularly interested in establishing bounds on the traffic-carrying capabilities of wireless ad hoc networks and conditions on the scalability of such networks ...

EPFL2007

Distributed routing algorithms for sensor networks

Guillermo Barrenetxea Kobas

Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...

EPFL2006

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

Achievable Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad, Tarik Tabet

In this paper, we present an efficient protocol for the delay-limited fading Automatic Retransmission reQuest single relay channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to ...

2005

Real-time interaction over the Internet : quality of service and end-to-end adaptation for remote experimentation

Christophe Salzmann

This dissertation studied real-time interaction over the Internet (RTI2) in the context of remote experimentation where there is typically a person at the client side interacting with physical equipments at the server side. Remote experimentations of mecha ...

EPFL2005

Related publications (16)