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

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

PANDEY DEEPAK C.; PAL ARUN K.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION Year:2014 | Volume:4 | Issue:2 Page(s): 167-176

Download Full-Text

View:

263

Download:

Cites:

Information Journal Paper

Title

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

Author(s)

PANDEY DEEPAK C. | PAL ARUN K. | Issue Writer Certificate

Keywords

DISCRETE-TIME QUEUING THEORY

PRIORITY SCHEDULING

GENERATING FUNCTIONS

DELAY ANALYSIS

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.

Cites

No record.

References

QUEUEING ANALYSIS OF AN ATM MULTIMEDIA MULTIPLEXER WITH NONPREEMPTIVE PRIORITY

Cite

APA: Copy

PANDEY, DEEPAK C., & PAL, ARUN 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 & COMPUTATION, 4(2), 167-176. SID. https://sid.ir/paper/328328/en

Vancouver: Copy

PANDEY DEEPAK C., PAL ARUN K.. MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION[Internet]. 2014;4(2):167-176. Available from: https://sid.ir/paper/328328/en

IEEE: Copy

DEEPAK C. PANDEY, and ARUN K. PAL, “MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS,” INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, vol. 4, no. 2, pp. 167–176, 2014, [Online]. Available: https://sid.ir/paper/328328/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops