Mean bandwidth allocation model of WRR for IP networks

Balogh, Tomáš; Medvecký, Martin

doi:10.1109/tsp.2012.6256272

Cited by 5 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The WRRRLbFQ algorithm uses this bandwidth allocation model already presented in [11]. In general, WRR and some other scheduling algorithms like WFQ, WF2Q+, etc.…”

Section: Wrr Bandwidth Allocation Modelmentioning

confidence: 99%

Weighted Round Robin and Rate Limiter based Fair Queuing for WRR

Balogh

Medvecký²

2015

IJCNIS

View full text Add to dashboard Cite

Abstract-In this paper we present a new packet scheduling method based on parallel usage of multiple WRR schedulers, rate limiters and output bandwidth calculation for modern NGN networks. The main idea of the presented method is to provide queueing fairness within queues. The method provides the same results in output bandwidth allocation as the compared algorithm, while within one queue flows with different packet size and arrival rates gets the same output bandwidth. With this method we are able to achieve the overall result of bandwidth assignment as algorithms like WRR, WFQ, WRRPQ and LLQ by only changing the mathematical model used to calculate the bandwidth assignment. We call this method Weighted Round Robin and Rate Limiter based Fair Queuing (WRRRLbFQ). We prove the model outcome with simulation results using NS2 simulator and compare the behavior with the WRR scheduler.

show abstract

“…The WRRRLbFQ algorithm uses this bandwidth allocation model already presented in [11]. In general, WRR and some other scheduling algorithms like WFQ, WF2Q+, etc.…”

Section: Wrr Bandwidth Allocation Modelmentioning

confidence: 99%

Weighted Round Robin and Rate Limiter based Fair Queuing for WRR

Balogh

Medvecký²

2015

IJCNIS

View full text Add to dashboard Cite

show abstract

“…They can split multipath traffic at the packet level and/or at the flow level [7], [8]. Among them, the main route selection methods are probabilistic routing and roundrobin routing [9]- [12]. However, to date, when using existing technologies, these schedulers have required configuration changes to the devices' control planes, resulting in costly deployment and maintenance.…”

mentioning

confidence: 99%

“…In previous works, 121 several proposed traffic splitters have achieved efficient load 122 balancing in the network. Among them, the most common 123 methods are to select the packet forwarding destinations 124 either probabilistically or with specified patterns [9]- [12]. 125 Other works have considered traffic at the packet level or the 126 flow level [7], [8].…”

mentioning

confidence: 99%

Implementation of P4-Based Schedulers for Multipath Communication

Motohashi

Nguyen

et al. 2022

IEEE Access

View full text Add to dashboard Cite

Multipath communication is a well-developed technology that enhances communication effectiveness and resilience. Moreover, it can flexibly utilize network resources through load balancing among available paths. However, traditionally, deploying such load balancing functions on network devices is costly due to the required configuration changes and complicated signaling mechanisms on the devices' control planes. Programming Protocol-independent Packet Processors (P4) has recently emerged as a programming language that enables programmability on the data plane, with the potential to relieve such issues in multipath communication. This work introduces and implements three P4-based multipath schedulers that can split traffic over several paths in wireless networks. The first is P4-based Random Splitting, which distributes traffic randomly. The second is P4-based Weighted Round Robin, with path scheduling based on weights in accordance with path capability. The last is P4-based Dynamic Weighted Round Robin (DWRR), which can improve bandwidth utilization by shifting the weights following dynamic changes in the available bandwidth (i.e., when congestion occurs). We have extensively evaluated the implementation of these three P4-based schedulers in a Mininet-WiFi/P4 environment with User Datagram Protocol (UDP) traffic. The results show that these schedulers can achieve multipath communication with the designed scheduling mechanisms.

show abstract