Loading...
Please wait, while we are loading the content...
Similar Documents
Worst-case fair bin sort queuing (wbsq): an o(1) worst-case fair scheduler.
| Content Provider | CiteSeerX |
|---|---|
| Author | Dwekat, Zyad A. Rouskas, George N. |
| Abstract | Abstract—The design of packet schedulers involves a tradeoff between implementation complexity, on one hand, and delay and fairness guarantees, on the other. In this paper, we present worst-case fair bin sort queuing (WBSQ), a new scheduler that has good worst-case fairness and delay properties, yet has low complexity and is amenable to simple hardware implementation. WBSQ achieves this performance by combining features of BSFQ and WF 2 Q+. We establish the worst-case fairness and delay properties of WBSQ through both analysis and simulation. I. |
| File Format | |
| Access Restriction | Open |
| Content Type | Text |
