Dynamic Priority Packet Scheduler with Deadline Considerations (DPD)

No Thumbnail Available

Date

2010

Journal Title

Journal ISSN

Volume Title

Publisher

INT INST Informatics & Systemics

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Organizational Units

Journal Issue

Abstract

Providing 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 Dynamic Priority with Deadline Considerations (DPD) 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.

Description

Keywords

Packet Scheduling, QoS, Static Priority, Packet Loss, Deadline

Turkish CoHE Thesis Center URL

Fields of Science

Citation

0

WoS Q

N/A

Scopus Q

N/A

Source

Volume

Issue

Start Page

67

End Page

72