Considering non-real-time traffic in real-time packet scheduling

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Real-time packet schedulers based on EDF policy have been extensively studied to support end-to-end bounded delay for real-time traffic. Since non-real-time traffic could hurt the schedulability of realtime traffic, we need a real-time packet scheduling method considering non-real-time traffic. In this paper, we propose a new admission control algorithm for EDF-based packet scheduling scheme. Proposed scheme consists of two packet schedulers: an EDF scheduler servicing real-time traffic and a Periodic Server (PS) scheduler servicing non-real-time traffic periodically. Proposed scheme provides good performance to non-real-time flows while guaranteeing the schedulability of real-time flows.

Cite

CITATION STYLE

APA

Ryu, Y. (2002). Considering non-real-time traffic in real-time packet scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2515, pp. 216–228). Springer Verlag. https://doi.org/10.1007/3-540-36166-9_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free