DISCRETE-TIME GI/D-MSP/۱/K QUEUE WITH N THRESHOLD POLICY

Publish Year: 1392
نوع سند: مقاله ژورنالی
زبان: English
View: 137

This Paper With 12 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_IJMAC-3-2_001

تاریخ نمایه سازی: 28 دی 1401

Abstract:

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary variable and the imbedded Markov chain techniques.Various performance measures such as the loss probability, mean queue length and mean waiting time in the queue along with some numerical results have been presented. The proposed model has potential applications in the areas of computer andtelecommunication systems.

Keywords:

Discrete Markovian service process , N threshold policy , Finite buffer , Queue , Supplementary variable

Authors

Veena Goswami

KIIT University India Professor & Dean , School of Computer Application,KIIT University, Bhubaneswar

P. Vijaya Laxmi

Andhra University India Assistant Professor, Department of Applied Mathematics, Andhra University, Visakhapatnam