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

PDF
  • Deepak C. Pandey1,
  • Arun K. Pal2,
  1. G. B. Pant University of Ag. and Technology, Pantnagar, U. S. Nagar, India India
  2. Department of Maths, Stats and Comp. Science G. B. Pant University of Ag. and Technology, Pantnagar, U. S. Nagar, India India

Revised: 15-04-2016

Accepted: 15-04-2016

Published in Issue 21-03-2014

How to Cite

Pandey, D. C., & Pal, A. K. (2014). MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS. International Journal of Mathematical Modelling & Computations, 4(2), 167-176. https://oiccpress.com/ijm2c/article/view/11217

Abstract

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.
PDF