MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

International Journal of Mathematical Modelling & Computations

مقاله 7، دوره 4، 2 (SPRING)، فروردین 2014، صفحه 167-176   

نویسندگان

Deepak C. Pandey¹؛ Arun K. Pal²

¹G. B. Pant University of Ag. and Technology, Pantnagar, U. S. Nagar, India India

²Department of Maths, Stats and Comp. Science G. B. Pant University of Ag. and Technology, Pantnagar, U. S. Nagar, India India

چکیده

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-1 arrivals in the overall traffic mix is small.
 

کلیدواژه‌ها

Discrete-time queuing theory؛ priority scheduling؛ generating functions؛ delay analysis