Eligibility-based round robin for fair and efficient packet scheduling in wormhole switching networks
Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging to different users. When multiple users contend for channel bandwidth, fairness in bandwidth sharing becomes a key requirement. In fact, enforcing a fair sharing of channel bandwidth improves flow isolation, thus preventing misbehaving flows from affecting the performance of other flows. This paper presents a novel packet scheduling algorithm, called Eligibility-Based Round Robin (EBRR), devised to provide fair queueing in interconnection networks. In fact, EBRR meets the constraints imposed by wormhole switching, which is the most popular switching technique in interconnection networks of parallel systems. It can also be applied to packet switching Wide Area Networks (WANs), such as IP and ATM. We show that EBRR has O(1) complexity and better delay and fairness properties than existing algorithms of comparable complexity. In this paper, we also investigate the means for assessing the fairness of a scheduler: We show that using the Relative Fairness Bound as a fairness measure may lead to erroneous results. We then propose an alternative measure, called the Generalized Relative Fairness Bound, that allows fairness to be assessed more precisely.
fairness packet scheduling wormhole switching networks quality of service