An improved algorithm for packet fair queuing scheduling

Author

Yu, Zhenxia ; Meng, Fang

Author_Institution

Comput. Sci. & Technol., Chengdu Univ. of Inf. Technol., Chengdu, China

fYear

2009

fDate

8-11 Aug. 2009

Firstpage

153

Lastpage

157

Abstract

In this paper, a scheduling algorithm suitable for weighted fair queuing scheduling has been studied. With the objective to find the best point of QoS between using network band and cell delay, a new scheduling algorithm based on GPS has been used. The new algorithm is characterized by using SHVC and SCFQ algorithm coordinately. As demonstrated by the simulated results, it is not only guarantees the delay of high-priority cell but also utilizes the broad band network more effectively. The new algorithm is feasible and effective, and better scheduling performance has been achieved.

Keywords

Global Positioning System; quality of service; queueing theory; scheduling; GPS; QoS; broad band network; cell delay; packet fair queuing scheduling; quality of service; simulation result; weighted fair queuing scheduling; Bandwidth; Clocks; Delay effects; Global Positioning System; Information technology; Processor scheduling; Quality of service; Round robin; Scheduling algorithm; Throughput; Quality of Service; Throughput; Time stampe; delay; virtual clock;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-4519-6

Electronic_ISBN

978-1-4244-4520-2

Type

conf

DOI

10.1109/ICCSIT.2009.5234976

Filename

5234976