Can I read On the latency and fairness characteristics of pre-order deficit round Robin on EtoBox?

On the latency and fairness characteristics of pre-order deficit round Robin by Salil S Kanhere; Harish Sethu is a Computer Science article available to read on EtoBox.

What is On the latency and fairness characteristics of pre-order deficit round Robin about?

In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to satisfy the Quality of Service (QoS) requirements of various applications. The latency bound of a scheduling discipline is an important QoS parameter, especially for real-time playback applications. Frame-based schedulers such as Deficit Round Robin (DRR), though extremely efficient with an O(1) dequeuing complexity, lead to high latencies due to bursty transmissions of each flow's traffic. In recent work by Tsao and Lin [Computer Networks 35 (2001) 287], the authors propose a novel scheme, called Pre-order DRR, which overcomes this limitation of DRR while still preserving a low work complexity. In Pre-order DRR, a priority queue module, appended to the original DRR scheduler, re-orders the packet transmission sequence and thus distributes the output more evenly among flows, reducing burstiness and improving the latency. In this paper, we use a novel technique to analytically derive the latency bound of Preorder DRR and we prove that our bound is a tight one. Our latency bound is significantly lower than the b

Who reads On the latency and fairness characteristics of pre-order deficit round Robin?

Author

Salil S Kanhere; Harish Sethu

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0140-3664)

Published

2004

Language

EN

Field

Computer Science (Physical Sciences)