SPD (Static Priority with Deadline considerations) packet scheduling algorithm for achieving better QoS

Basit Öğe Kaydı
dc.authorid0000-0001-7020-3741
dc.contributor.authorDağ, Tameren_US
dc.date.accessioned2019-08-31T12:10:23Z
dc.date.accessioned2019-08-05T16:05:02Z
dc.date.available2019-08-31T12:10:23Z
dc.date.available2019-08-05T16:05:02Z
dc.date.issued2007
dc.departmentIşık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering, Department of Computer Engineeringen_US
dc.description.abstractProviding quality of service (QoS) to applications with different traffic characteristics based on their needs is an important research area for today's and tomorrow's high speed networks. Various techniques have been proposed to achieve good QoS for diverse application types. Among these techniques, packet scheduling algorithms decide on how to process packets at network nodes; however they have limited support for better QoS. In order to supply the various QoS requirements for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper proposes a new kind of packet scheduling algorithm, Static Priority with Deadline Considerations (SPD), which integrates an important QoS parameter (the delay) into the classical static priority packet scheduling algorithm and analyses the packet losses by considering the two different components of losses; buffer overflows and deadline violations. The proposed algorithm not only reduces the complexity of the static priority algorithm by introducing degree sorting but also solves the starving problem and provides fairness to applications with different priorities.en_US
dc.description.versionPublisher's Versionen_US
dc.identifier.citationDağ, T. (2007). SPD (static priority with deadline considerations) packet scheduling algorithm for achieving better QoS. Paper presented at the 3rd International Conference on Networking and Services,ICNS 2007, 57-57. doi:10.1109/ICNS.2007.111en_US
dc.identifier.doi10.1109/ICNS.2007.111
dc.identifier.endpage57
dc.identifier.isbn9781509088379
dc.identifier.scopus2-s2.0-47049100896
dc.identifier.scopusqualityN/A
dc.identifier.startpage57
dc.identifier.urihttps://hdl.handle.net/11729/1996
dc.identifier.urihttps://dx.doi.org/10.1109/ICNS.2007.111
dc.indekslendigikaynakScopusen_US
dc.institutionauthorDağ, Tameren_US
dc.institutionauthorid0000-0001-7020-3741
dc.language.isoenen_US
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.publisherIEEEen_US
dc.relation.ispartof3rd International Conference on Networking and Services,ICNS 2007en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDeadlineen_US
dc.subjectPacket lossen_US
dc.subjectPacket schedulingen_US
dc.subjectQoSen_US
dc.subjectStatic priorityen_US
dc.subjectScheduling algorithmen_US
dc.subjectBandwidthen_US
dc.subjectQuality of serviceen_US
dc.subjectRegulatorsen_US
dc.subjectDelayen_US
dc.subjectJitteren_US
dc.subjectSortingen_US
dc.subjectApplication softwareen_US
dc.subjectTelecommunication trafficen_US
dc.subjectAlgorithm design and analysisen_US
dc.subjectSchedulingen_US
dc.subjectPacket scheduling algorithmen_US
dc.subjectBuffer overflowen_US
dc.subjectDeadline violationen_US
dc.subjectDegree sortingen_US
dc.titleSPD (Static Priority with Deadline considerations) packet scheduling algorithm for achieving better QoSen_US
dc.typeConference Objecten_US
dspace.entity.typePublication

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
1996.pdf
Boyut:
237.03 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Publisher's Version
İndir

Koleksiyon

Bildiri Koleksiyonu | Bilgisayar Mühendisliği Bölümü
Scopus İndeksli Yayınlar Koleksiyonu