Discrete-Time GeoX/G/1 Queue with Preemptive Repeat Different Priority

Authors:
Yutae Lee;Kye-Sang Lee
Affiliations:
Department of Information and Communication Engineering, Dongeui University, San 24 Kaya-dong, Busanjin-gu, Busan 614-714, Korea;Department of Information and Communication Engineering, Dongeui University, San 24 Kaya-dong, Busanjin-gu, Busan 614-714, Korea ylee@dongeui.ac.kr
Venue:
Queueing Systems: Theory and Applications
Year:
2003

Citing 5
Cited 1

Two competing discrete-time queues with priority

Queueing Systems: Theory and Applications
Discrete-time multiserver queues with priorities

Performance Evaluation
Queueing system with multiple delay and loss priorities for ATM networks

Information Sciences—Informatics and Computer Science: An International Journal
Discrete-Time Models for Communication Systems Including ATM

Discrete-Time Models for Communication Systems Including ATM
Discrete-time GeoX/G/1 queue with preemptive resume priority

Mathematical and Computer Modelling: An International Journal

Discrete-time modelling for performance analysis and optimisation of uplink traffic in IEEE 802.16 networks

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a discrete-time GeoX/G/1 queue accepting two classes of messages with preemptive repeat different priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes. The completion time and the stability condition for our system are investigated. By using the supplementary variable method and the generating function technique, we derive the joint system contents distributions at various observation instants and also compute the probability distribution for the unfinished work.