Premium
A delay‐oriented prioritization policy based on non‐congestive queuing
Author(s) -
Papastergiou G.,
Georgiou C.,
Mamatas L.,
Tsaoussidis V.
Publication year - 2011
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1215
Subject(s) - computer science , network packet , prioritization , computer network , weighted fair queueing , queueing theory , scheduling (production processes) , queuing delay , queue , mathematical optimization , mathematics , management science , economics
In this paper, we depart from our previously proposed Non‐Congestive Queuing (NCQ) mechanism and propose a new scheduling discipline that allows for efficient interoperation of dedicated systems (such as sensor and voice networks) with the Internet. More precisely, our approach provides delay guarantees to applications that do not contribute noticeably to congestion because of their tiny packet sizes and low transmission rates. In addition, our approach uses a second level of prioritization that conditionally favors, in terms of delay, applications with slightly longer packets as well. Based on the NCQ concept, Non‐Congestive Queuing Plus (NCQ+) promotes applications that require comparatively small service times, as long as their total service times cause insignificant delays to other packets in the queue. Therefore, we prioritize packets, and in turn corresponding flows, according to their impact on total delay. We evaluate NCQ+ using ns‐2‐based experiments. Results show that whenever prioritization buffer resources are sufficient, NCQ+ can provide non‐detectable delays to sensor applications and conditionally improve the performance of VoIP applications, while maintaining the impact on the performance of the other flows insignificant. Copyright © 2011 John Wiley & Sons, Ltd.