Multi timescale bandwidth profile and its application for burst-aware fairness

03/19/2019
by   Szilveszter Nádas, et al.
0

We propose a resource sharing scheme that takes into account the traffic history over several predefined time scales and provides fair resource sharing considering the traffic history. Our concept builds on a simplified version of core-stateless resource sharing, where we only use a few Drop Precedences (DPs). For packet marking we introduce Multi timescale bandwidth profile. Additionally, we provide basic dimensioning concepts for the proposed schema and present its simulation based performance analysis.

READ FULL TEXT

page 2

page 5

research
04/16/2019

AllocTC-Sharing: A New Bandwidth Allocation Model for DS-TE Networks

DiffServ-aware MPLS-TE (DS-TE) allows bandwidth reservation for Traffic ...
research
11/12/2022

Optimizing Bandwidth Sharing for Real-time Traffic in Wireless Networks

We consider the problem of enhancing the delivery of real-time traffic i...
research
11/15/2017

A Stochastic Resource-Sharing Network for Electric Vehicle Charging

We consider a distribution grid used to charge electric vehicles subject...
research
08/22/2021

A Round-Robin Packet Scheduler for Hierarchical Max-Min Fairness

Hierarchical link sharing addresses the demand for fine-grain traffic co...
research
09/04/2018

Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks

The performance of computer networks relies on how bandwidth is shared a...
research
09/27/2021

HTBQueue: A Hierarchical Token Bucket Implementation for the OMNeT++/INET Framework

The hierarchical token bucket (HTB) algorithm allows to specify per-flow...
research
02/17/2022

Improving Performance Bounds for Weighted Round-Robin Schedulers under Constrained Cross-Traffic

Weighted round robin (WRR) is an effective, yet particularly easy-to-imp...

Please sign up or login with your details

Forgot password? Click here to reset