TY  - JOUR
TI  - Non-preemptive priority scheduler with multiple thresholds for network routers
AB  - The vast variety of applications available and being developed forcomputer networks have different quality of service requirements. Oneof the most significant ways to satisfy the needs of the applications is thepacket scheduling algorithms employed by the network routers. Byallocating router resources to the applications, packet schedulers try toimprove the quality of service needs of the applications. Thus, the delayscan be reduced or the reliability of the applications can be increased byreducing packet losses. Priority schedulers are able reduce the delay andlosses for high priority applications. On the other hand, for low priorityapplications they introduce the starvation problem. Low priorityapplication packets can face excessive delays and losses. In this paper, anon-preemptive priority scheduler with multiple thresholds (PRMT) isproposed. The PRMT scheduler needs only a single queue withpredefined threshold levels for different priority applications. The PRMTscheduler eliminates the starvation problem of low priority applicationswithout a significant impact on the high priority applications.
AU  - DAĞ, Tamer
DO  - 10.5505/pajes.2017.74318
PY  - 2018
JO  - Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi
VL  - 24
IS  - 2
SN  - 2147-5881
SP  - 246
EP  - 254
DB  - TRDizin
UR  - http://search/yayin/detay/305505
ER  -