Three remedied algorithms for Advanced Waiting Time Scheduler

  • Authors:
  • Affiliations:
  • Venue:
  • ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The advanced waiting time priority scheduler (AWTP),modified from the waiting time priority scheduler (WTP),was proposed to achieve proportional delaydifferentiation. AWTP not only achieves more accuratedelay proportion than the WTP scheduler no matter inshort or long timescales, but also greatly reduces theoverall queuing delay when the traffic load is moderate.In this paper, we find that AWTP can not steadily keepthe delay ratio under different traffic load distributionsbecause its scheduling sometimes ignores consideringpacket waiting time. Thus, three remedied algorithms,named Minus-WTP (MWTP), Existing-WTP (EWTP), andCounting-WTP (CWTP), are proposed to resolve thisproblem. All remedies simultaneously consider the packetwaiting time and packet transmission time. Simulationresults reveal that these modifications inherit the merit ofAWTP and actually alleviate this side effect.