Record Details

Revisiting WFQ: minimum packet lengths tighten delay and fairness bounds

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Revisiting WFQ: minimum packet lengths tighten delay and fairness bounds
 
Creator SAHOO, ANIRUDHA
MANJUNATH, D
 
Subject packet networks
throughput
scheduling
 
Description In this paper we consider the bounds on the sample path discrepancy between the 'idealized' generalized processor sharing (GPS) and the 'practical' weighted fair queueing (WFQ) scheduling disciplines. We show that when both the minimum packet lengths and the weights are non zero, the discrepancy bounds can possibly be tighter than that in (A. Greenberg, et al., 1992) and (A. Parekh, et al., 1993) This new upper bound on the delay discrepancy is then used to provide an upper bound on the discrepancy in the instantaneous throughput, which can also be significantly tighter than those in (A. Greenberg, et al., 1992) and (A. Parekh, et al., 1993).
 
Publisher IEEE
 
Date 2008-11-19T11:29:33Z
2011-11-25T12:19:42Z
2011-12-26T13:07:05Z
2011-12-27T05:55:07Z
2008-11-19T11:29:33Z
2011-11-25T12:19:42Z
2011-12-26T13:07:05Z
2011-12-27T05:55:07Z
2007
 
Type Article
 
Identifier IEEE Communications Letters 11(4), 366-68
0885-8950
http://dx.doi.org/10.1109/LCOM.2007.348303
http://hdl.handle.net/10054/65
http://dspace.library.iitb.ac.in/xmlui/handle/10054/65
 
Language en