سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

Login
PapersConferencesJournals

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

Publish place: International Journal of Mathematical Modelling and Computations، Vol: 4، Issue: 2
Publish Year: 1393
Type: Journal paper
Language: English
View: 178

This Paper With 10 Page And PDF Format Ready To Download

DOWNLOAD Paper

Export:

Link to this Paper:
https://civilica.com/doc/1590112

Document National Code:

JR_IJMAC-4-2_007

Index date: 18 January 2023

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS 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.

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

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

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

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