Fair Round Robin Research Articles

Packet Loss Optimization in Router Forwarding Tasks Based on the Particle Swarm Algorithm

Software-defined networks (SDNs) are computer networks where parameters and devices are configured by software. Recently, artificial intelligence aspects have been used for SDN programs for various applications, including packet classification and forwarding according to the quality of service (QoS) requirements. The main problem is that when packets from different applications pass through computer networks, they have different QoS criteria. To meet the requirements of packets, routers classify these packets, add them to multiple weighting queue systems, and forward them according to their priorities. Multiple queue systems in routers usually use a class-based weighted round-robin (CBWRR) scheduling algorithm with pre-configured fixed weights for each priority queue. The problem is that the intensity of traffic in general and of each packet class occasionally changes. Therefore, in this work, we suggest using the particle swarm optimization algorithm to find the optimal weights for the weighted fair round-robin algorithm (WFRR) by considering the variable densities of the traffic. This work presents a framework to simulate router operations by determining the weights and schedule packets and forwarding them. The proposed algorithm to optimize the weights is compared with the conventional WFRR algorithm, and the results show that the particle swarm optimization for the weighted round-robin algorithm is more efficient than WFRR, especially in high-intensity traffic. Moreover, the average packet-loss ratio does not exceed 7%, and the proposed algorithms are better than the conventional CBWRR algorithm and the related work results.

Fair round robin binary countdown to achieve QoS guarantee and fairness in WLANs

How to guarantee both quality of service (QoS) and fairness in wireless local area networks (WLANs) is a challenging issue. To touch this issue, a fair medium access control (MAC) scheme called fair round robin binary countdown (FRRBC) adopting the eminent concepts of allowance and binary countdown is proposed in this paper. FRRBC can guarantee QoS for both audio and video with the aid of adaptive adjustment on system parameters and some extra rules designed according to delay bounds. Using multiple mapping functions from allowances to fixed-bit binary numbers to indicate different priorities, FRRBC not only provides guaranteed system performance but also achieves good fairness. Finally, we demonstrate that FRRBC can significantly outperform the enhanced distributed channel access (EDCA) (IEEE 802.11 WG in IEEE Standard for Information technology--Telecommunications and information exchange between systems--Local and metropolitan area networks--Specific requirements--Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. Amendment 8: Medium Access Control (MAC) Quality of Service Enhancements, 2005) and the synchronized medium access control (SYN-MAC) (Wu HY et al. in Mobile Netw Appl 11:627---637, 2005) because of its superiority to offer guaranteed QoS for both audio and video, low delay jitter, low blocking ratio, and good fairness. Of course, FRRBC can be illustrated to be a better choice than the enhanced distributed elastic round robin (EDERR) (Ferng HW, Liau HY in IEEE Trans Mobile Comput 8(7):880---894, 2009).

Constructing fair round robin tournaments with a minimum number of breaks

Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2 n − 2 , teams of the same club never play at home simultaneously, and they play against each other in the first round. We also consider a fairness constraint related to different playing strengths of teams competing in the tournament.

Performance analysis of downlink OFDMA resource allocation with limited feedback

Opportunistic resource allocation in orthogonal frequency division multiple access (OFDMA) with limited feedback improves the performance of wireless networks and it has been considered in several studies. However, the performances of reduced feedback schemes have not been characterized analytically. In this paper, the analysis of the resource allocation in downlink OFDMA with limited feedback is presented. OFDMA system with a practical resource fair round robin allocation and erroneous feedback channel is considered. The performances of the resource allocation based on three feedback methods are analyzed and compared. A resource-wise signal-to-noise ratio (SNR) quantization based feedback method is considered and two feedback strategies are based on the best-M method, where the M best resource blocks are informed to the transmitter. Analytical bit error probability (BEP) expressions are derived for binary phase-shift keying (BPSK) modulation for each feedback strategy. Furthermore, an asymptotic BEP performance for large SNR values is derived for the best-M feedback schemes. The outage capacity results are derived for the considered feedback schemes to illustrate performance with slow link adaptation. Numerical results based on the analysis are compared to those obtained by computer simulations to validate the correctness of the proposed analysis.

Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness

Round robin based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low complexity round robin scheduler, called Fair Round Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the stratified round robin scheduler, a recently proposed scheme that arguably provides the best quality-of-service properties among all existing round robin based low complexity packet schedulers. FRR offers better short-term fairness than stratified round robin and other existing round robin schedulers.

Improving the performance of active buffer management with per-flow information

This letter proposes a new technique to improve the performance of active queue management (AQM) with per-flow information such as balanced random early detection (BRED). The technique is virtual buffer occupancy, which represents not the actual buffer occupancy but the buffer occupancy as it would be if packets were serviced in a fair round robin fashion. In AQM using virtual buffer occupancy, packets of flow i are dropped based on the virtual buffer occupancy of flow i. We show that BRED using virtual buffer occupancy achieves fairer bandwidth allocation than original BRED.

An efficient collision-free protocol for prioritized access-control of cable or radio channels

We describe and analyze an efficient collision-free channel-access protocol for cable or radio networks with an arbitrary spatial (one-, two- or three-dimensional) fixed node configuration. The protocol is robust and provides distributed access-control under a myriad of possible priority disciplines, including Fixed, Fair Round-Robin and Prioritized Round-Robin disciplines. The protocol optimally employs available information on network topology, to provide performance characteristics (throughput and delay) that are at least as good as and in most cases much better than those of other published protocols that employ less information. The performance advantage is especially significant for networks with a large number of nodes.