Skip to search formSkip to main contentSkip to account menu

Weighted round robin

Known as: WRR, Weighted round robin queuing, Weighted round-robin scheduling 
Weighted round robin (WRR) is a network scheduling discipline. Each packet flow or connection has its own packet queue in a network interface… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Bandwidth managementDeficit round robinFair queuingGeneralized processor sharing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Weighted Round-Robin Load Balancing Using Software Defined Networking
  • 2016
  • Corpus ID: 212557727
In today's environment our networks have to handle enormous amount of traffic, serve thousands of clients. For a single server it… 
Review
2014
Review
2014
An analysis of the load scheduling algorithms in the cloud computing environment: A survey
Cloud Computing is a recent developmental paradigm in the field of computing offering huge power to next generation computers… 
2007
2007
An In-Out Combined Dynamic Weighted Round-Robin Method for Network Load Balancing
This study presents a new method [In–Out Combined Dynamic Weighted Round-Robin (CDWRR)] for balancing network loads in multiple… 
2004
2004
Adaptive scheduling using the revenue-based weighted round robin
This paper presents an adaptive resource allocation model that is based on the WRR queuing discipline. The model ensures QoS… 
2002
2002
A Modified Dynamic Weighted Round Robin Cell Scheduling Algorithm
In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay… 
2002
2002
A priority-based MAC scheduling algorithm for enhancing QoS support in Bluetooth piconet
Bluetooth is a personal wireless communication technology and is being applied in many scenarios. Current existing MAC (medium… 
2001
2001
Weighted round robin packet scheduler using relative service share
In this paper, we propose a new weighted round robin (WRR) algorithm for fixed length packets. Two well-known algorithms in the… 
Highly Cited
2001
Highly Cited
2001
A probabilistic priority scheduling discipline for multi-service networks
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as… 
2001
2001
Uniform weighted round robin scheduling algorithms for input queued switches
This paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired… 
2000
2000
Managing performance using weighted round-robin
  • Jie WangY. Levy
  • Proceedings ISCC . Fifth IEEE Symposium on…
  • 2000
  • Corpus ID: 9638008
IP networks will evolve from today's best-effort Internet into multi-class networks supporting quality of service requirements of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)