Concept

Sliding window protocol

Related publications (43)

Knowing When to Slide :: Efficient Scheduling for Sliding Window Processing

Karl Aberer, Sebastian Michel, Ali Salehi, Mehdi Riahi

We consider sliding window query execution scheduling in stream processing engines. Sliding windows are an essential building block to limit the query focus at a particular part of the stream, based either on value count or time ranges. These so called sli ...

IEEE Computer Society2009

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

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

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

2009

Loss-resilient window-based congestion control

Pascal Frossard, Christophe De Vleeschouwer

This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window-based congestion control to support non-congestion related losses. We invest ...

2008

Sliding mode control for coordination in multi-agent systems with directed communication graphs

Giancarlo Ferrari Trecate

This paper focuses on the control of a team of agents designated either as leaders or followers and exchanging information over a directed communication network. The goal is to drive each follower to a target position that depends on its neighbors. To this ...

2007

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

Sanket Dusad

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

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the pac ...

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

On feedback for network coding

Christina Fragouli

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

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

Pascal Frossard, Christophe De Vleeschouwer

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

How Fast Can a Very Robust Read Be?

Rachid Guerraoui, Marko Vukolic

This paper studies the time complexity of reading unauthenticated data from a distributed storage made of a set of failure-prone base objects. More specifically, we consider the abstraction of a robust read/write storage that provides wait-free access to u ...

2006

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.