ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 (N, n)-Preemptive Priority Queues
Cited 11 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
김길환
발행일
201107
출처
Performance Evaluation, v.68 no.7, pp.575-585
ISSN
0166-5316
출판사
Elsevier
DOI
https://dx.doi.org/10.1016/j.peva.2011.03.006
협약과제
11PI1600, 네트워크 기반 수요자 지향 융합서비스 공통플랫폼 기술 개발, 이병선
초록
In this paper, we propose a new priority discipline, called the (N,n)-preemptive priority discipline. Under this discipline, the preemption of the service of a low-class customer is determined by two thresholds N and n of the queue length of high-class customers. We consider M/G/1 priority queueing models with two customer classes under two different (N,n)-preemptive priority disciplines and derive the Probability Generating Functions (PGFs) of queue lengths of each class. We also show that, under the (N,n)-preemptive priority discipline, the QoS for high-class customers can be controlled within a certain bound, regardless of the restarting mode of a preempted service. © 2010 Elsevier B.V. All rights reserved.
키워드
(N,n)-preemptive priority, Priority queues, Threshold-based control
KSP 제안 키워드
Preemptive priority, Probability generating functions, priority queueing, queue length, queueing model