MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 155
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJMAC-4-2_007
تاریخ نمایه سازی: 28 دی 1401
چکیده مقاله:
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained. The effect of jumping mechanism is analysed which clearly shows that the queuing system provides better results when the fraction of class-۱ arrivals in the overall traffic mix is small.
کلیدواژه ها:
نویسندگان
Deepak C. Pandey
G. B. Pant University of Ag. and Technology, Pantnagar, U. S. Nagar, India India
Arun K. Pal
Department of Maths, Stats and Comp. Science G. B. Pant University of Ag. and Technology, Pantnagar, U. S. Nagar, India India