### Abstract

Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE Symposium on Computers and Communications |

Pages | 1001-1006 |

Number of pages | 6 |

DOIs | |

State | Published - 2002 |

Event | 7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos, Italy Duration: Jul 1 2002 → Jul 4 2002 |

### Other

Other | 7th International Symposium on Computers and Communications, ISCC 2002 |
---|---|

Country | Italy |

City | Taormina-Giardini Naxos |

Period | 7/1/02 → 7/4/02 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications
- Computer Science Applications
- Software
- Mathematics(all)
- Signal Processing

### Cite this

*Proceedings - IEEE Symposium on Computers and Communications*(pp. 1001-1006). [1021794] https://doi.org/10.1109/ISCC.2002.1021794

**Fair queuing with round robin : A new packet scheduling algorithm for routers.** / Sen, Arunabha; Mohammed, Ibraz; Samprathi, Ravikanth; Bandyopadhyay, Subir.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - IEEE Symposium on Computers and Communications.*, 1021794, pp. 1001-1006, 7th International Symposium on Computers and Communications, ISCC 2002, Taormina-Giardini Naxos, Italy, 7/1/02. https://doi.org/10.1109/ISCC.2002.1021794

}

TY - GEN

T1 - Fair queuing with round robin

T2 - A new packet scheduling algorithm for routers

AU - Sen, Arunabha

AU - Mohammed, Ibraz

AU - Samprathi, Ravikanth

AU - Bandyopadhyay, Subir

PY - 2002

Y1 - 2002

N2 - Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.

AB - Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.

UR - http://www.scopus.com/inward/record.url?scp=84883893258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883893258&partnerID=8YFLogxK

U2 - 10.1109/ISCC.2002.1021794

DO - 10.1109/ISCC.2002.1021794

M3 - Conference contribution

AN - SCOPUS:84883893258

SN - 0769516718

SN - 9780769516714

SP - 1001

EP - 1006

BT - Proceedings - IEEE Symposium on Computers and Communications

ER -