V. Kumar and E. Cole (USA)
: Quality of Service, Generalized Processor Sharing, Weighted Fair Queuing, Wireless Channels, Packet Fair Queuing.
: Generalized Processor Sharing algorithms are a new initiative for fair scheduling algorithms in modern day routers and other network components [1, 2]. Most generalized processor sharing algorithms focus on scheduling in wireline networks, which inherently have less bit error rate and channel failures [1, 2, 3]. However, wireless network channels are highly error prone and an extension of generalized sharing algorithms directly to such networks would not be feasible [5, 6]. Compensations based models are proposed for accommodating the wireless channel deviations into the generalized processor sharing scheme. Lag/lead based compensation would be given to any flow that experiences channel failures [5, 6]. A generalized processor sharing scheme is highly theoretical and needs approximation models for realizations in packet networks. Especially in compensation based models (for wireless channels) such approximations need careful considerations. Moreover, compensation schemes in TCP/IP packet networks have to consider for the fact that these networks are ‘time out’ based [3]. Request/acknowledgement packets are expected to arrive within a pre-specified time period. A model to accommodate for controlling compensation depending on the period of channel loss is presented in this paper.
Important Links:
Go Back
