Concept

Out-of-order delivery

Publications associées (13)

A Network Calculus Analysis of Asynchronous Mechanisms in Time-Sensitive Networks

Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...

EPFL2023

Destination buffer analysis for packets rejection obliteration in multi-channel networks

Georgia Fragkouli

In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...

2019

Energy Proportionality and Workload Consolidation for Latency-Critical Applications

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Mia Primorac

Energy proportionality and workload consolidation are important objectives towards increasing efficiency in large-scale datacenters. Our work focuses on achieving these goals in the presence of applications with microsecond-scale tail latency requirements. ...

2015

Is Your OpenFlow Application Correct?

Marco Canini, Peter Peresini

OpenFlow enables third-party programs to dynamically reconfigure the network by installing, modifying and deleting packet processing rules as well as collecting statistics from individual switches. But how can we know if such programs are correct? While th ...

2011

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

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

Reducing Buffer Space in Multipath Schemes

Maysam Yabandeh, Sajjad Zarifzadeh

One major drawback of multipath transferring schemes, which is inspired by the usage of different paths with diverse delays, is the emergence of reordering among packets of a flow. This reordering brings some substantial problems (like larger delay and buf ...

2008

On the Performance of Random Linear Network Coding in Relay Networks

Ramin Khalili

We compare the reliability performance gain of Random Linear Network Coding (RLNC) with Automatic Repeat Request (ARQ) for a wireless relay network taking into account overhead and complexity of feedback mechanism as well as overhead due to encoding vector ...

2008

Packet Media Streaming with Imprecise Rate Estimation

Pascal Frossard, Dan Jurca

We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...

2007

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today’s NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in ...

Hindawi Publications2007

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