Publication

Worst Case Burstiness Increase due to FIFO Multiplexing

Jean-Yves Le Boudec
2002
Reports

Abstract

We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem arises in scenarios where aggregate multiplexing is performed, such as differentiated services or front ends to optical switches. We obtain an exact result for a fluid model and for piecewise linear concave arrival curves, which are common in practice and correspond to combinations of leaky buckets. Our results show that previous methods do not obtain tight bounds, unlike our finding here.

Official source

https://infoscience.epfl.ch/entities/publication/b368bb06-8755-4098-b074-25b744c53e5b

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Jean-Yves Le Boudec
2002
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/b368bb06-8755-4098-b074-25b744c53e5b

About this result

Related concepts (24)

Leaky bucket

The leaky bucket is an algorithm based on an analogy of how a bucket with a constant leak will overflow if either the average rate at which water is poured in exceeds the rate at which the bucket leaks or if more water than the capacity of the bucket is poured in all at once. It can be used to determine whether some sequence of discrete events conforms to defined limits on their average and peak rates or frequencies, e.g. to limit the actions associated with these events to these rates or delay them until they do conform to the rates.

Token bucket

The token bucket is an algorithm used in packet-switched and telecommunications networks. It can be used to check that data transmissions, in the form of packets, conform to defined limits on bandwidth and burstiness (a measure of the unevenness or variations in the traffic flow). It can also be used as a scheduling algorithm to determine the timing of transmissions that will comply with the limits set for the bandwidth and burstiness: see network scheduler.

Differentiated services

Differentiated services or DiffServ is a computer networking architecture that specifies a mechanism for classifying and managing network traffic and providing quality of service (QoS) on modern IP networks. DiffServ can, for example, be used to provide low-latency to critical network traffic such as voice or streaming media while providing best-effort service to non-critical services such as web traffic or s. DiffServ uses a 6-bit differentiated services code point (DSCP) in the 8-bit differentiated services field (DS field) in the IP header for packet classification purposes.

Related publications (14)

Worst Case Burstiness Increase due to FIFO Multiplexing

Chat with Graph Search

Heterogeneity in cilia patterning enables multiple flow functions within a single cell

3D Geomechanical Modelling of CO2 Storage with Focus on Fault Stability

Three-dimensional fluid-driven stable frictional ruptures