A priority based packet scheduler with deadline considerations
Yükleniyor...
Dosyalar
Tarih
2006
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE Computer Soc
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
QoS issues have become a focal point of research on Next Generation Networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper introduces a new kind of packet scheduler which tries to integrate an important QoS parameter (the delay) with the classical schedulers. The two sets of algorithms introduced; Static Priority with Deadline Considerations (SPD) and Dynamic Priority with Deadline Considerations (DPD); not only simplify the complexity and overhead of a classical Earliest Deadline First (EDF) or Static Priority (SP) algorithm, but also provide a better QoS based on the results of the simulations conducted.
Açıklama
Anahtar Kelimeler
Packet scheduling, QoS, Static priority, Earliest deadline first, Packet loss, Deadline, Bandwidth, Computer science, Delay, Jitter, Next generation networking, Performance evaluation, Regulators, Scheduling algorithm, Testing, Traffic control, DPD, SPD, Dynamic priority-deadline consideration algorithm, Quality of service, Static priority-deadline consideration algorithm, Packet switching, Queueing theory, Scheduling, Algorithms, Computational complexity, Computer simulation, Packet losses, Static priorities, Packet networks
Kaynak
4th Annual Communication Networks and Services Research Conference (CNSR'06)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
Sayı
Künye
Dağ, T. & Gökgöl, O. (2006). A priority based packet scheduler with deadline considerations. Paper presented at the 196-203. doi:10.1109/CNSR.2006.9
