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

Concept

Leaky bucket

Related publications (25)

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Seyed Mohammadhossein Tabatabaee

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Jean-Yves Le Boudec, Ehsan Mohammadpour

Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to so ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays for DRR were found by Boyer et al., who used a rigorous network calculus approach and characterized the ser ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round ...

IEICE-INST ELECTRONICS INFORMATION COMMUNICATION ENGINEERS2021

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays obtained with DRR were found by Boyer et al. They used a rigorous network calculus approach and characteriz ...

2021

Interleaved Weighted Round-Robin: A Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

IEEE2020

Numerical investigation of the jet velocity profile and its influence on the Pelton turbine performance

François Avellan, Ebrahim Jahanbakhsh, Audrey Paulette Solange Maertens, Sebastián Camilo Leguizamón Sarmiento, Siamak Alimirzazadeh

Numerical investigation of the unsteady flow patterns around the bucket can be helpful to improve the Pelton turbine efficiency. In fact, by studying the loss mechanisms in the flow, one can optimize the bucket design. For this purpose, an accurate investi ...

IOP Publishing2019

Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour, Maaz Mashood Mohiuddin

We compute bounds on end-to-end worst-case latency and on nodal backlog size for a per-class deterministic network that implements Credit Based Shaper (CBS) and Asynchronous Traffic Shaping (ATS), as proposed by the Time-Sensitive Networking (TSN) standard ...

IEEE2018

Ecological strategies and metabolic trade-offs of complex environmental biofilms

Tom Ian Battin, Hannes Markus Peter

Microorganisms aggregated into matrix-enclosed biofilms dominate microbial life in most natural, engineered, and medical systems. Despite this, the ecological adaptations and metabolic trade-offs of the formation of complex biofilms are currently poorly un ...

Nature Publishing Group2017

Flow Simulation of Jet Deviation by Rotating Pelton Buckets Using Finite Volume Particle Method

François Avellan, Ebrahim Jahanbakhsh, Christian Vessaz

The objective of the present paper is to perform numerical simulations of a high-speed water jet impinging on rotating Pelton buckets using the finite volume particle method (FVPM), which combines attractive features of smoothed particle hydrodynamics (SPH ...

2015

Distributed Rate Allocation in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user ...

Institute of Electrical and Electronics Engineers2014

Interference Channels with Bursty Traffic and Delayed Feedback

Suhas Diggavi, I-Hsiang Wang

In this paper we study interference management in wireless networks with bursty user traffic. In each time slot, whether a user is on or off for transmission is governed by its own Bernoulli random state. At each transmitter, the states of activities of ot ...

Ieee2013

On the Necessity of Traffic Shaping for PMU Measurement Data Streams

Jean-Yves Le Boudec, Peng Gao, Dan-Cristian Tomozei, Miroslav Popovic

We study the communication network of an on-campus active distribution network (ADN) that comprises phasor measurement units (PMUs) connected to medium-voltage transformers. Within stringent time delays and with minimal loss the PMUs periodically transfer ...

2013

Distributed Rate Allocation With Intersession Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, ...

IEEE2012

Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

Maciej Kurant

We consider a transmission of a delay-sensitive data stream (e. g., a video call) from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet ...

2011

A Fault-Tolerant Token-Based Atomic Broadcast Algorithm

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last 20 years. Token-based algorithms represent a large class of these algorithms. Interestingly, all the token-based atomic broadcast algorithms rely on a group membership service and none of the ...

2011

Modeling and Analysis of Distortion Caused by Markov-Model Burst Packet Losses in Video Transmission

Yi Zhang

This paper addresses the problem of distortion modeling for video transmission over burst-loss channels characterized by a finite state Markov chain. Based on a detailed analysis of the error propagation and the bursty losses, a Distortion Trellis model is ...

2009

Exploiting the Path Propagation Time in Multipath Transmission with FEC

We consider a transmission of a delay-sensitive data stream from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet. An effective and wel ...

2009

Modeling of distortion caused by Markov-model burst packet losses in video transmission

Yi Zhang

This paper addresses the problem of distortion modeling for video transmission over burst-loss channels characterized by a finite state Markov chain. A Distortion Trellis model is pro- posed, enabling us to estimate at the frame level the expected mean-squ ...

2009

Cooperative Dynamics of Loyal Customers in Queueing Networks

Max-Olivier Hongler, Olivier Gallay

We consider queueing networks (QN) with feedback loops roamed by ``intelligent'' agents, able to select their routing on the basis of their measured waiting times at the QN nodes. This is an idealized model to discuss the dynamics of customers who stay loy ...

2008