Skip to main content
SpringerLink
Log in

A Finite MAP K /G K /1 Queueing System with Generalized Foreground-Background Processor-Sharing Discipline

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Queuing systems with Markov arrival process, several customer types, generalized foreground-background processor-sharing discipline with minimal served length or separate finite buffers for customers of different types, or a common finite buffer for customers of all types are studied. Mathematical relations are derived and used to compute the joint stationary distribution of the number of customers of all types in a system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Schrage, L., The Queue M=G=1 with Feedback to Lower Priority Queues, Manag. Sci., 1967, vol. 13, no. 7, pp. 466–474.

    Google Scholar 

  2. Yashkov, S.F., Foreground-Background Processor-Sharing Service Discipline for Customers with Minimal Served Length, Tekh. Sredstv Svyazi, Ser. ASU, 1978, no. 2, pp. 51–62.

  3. Pechinkin, A.V., Stationary Probabilities in a System with Foreground-Background Processor-Sharing Discipline, Izv. Akad. Nauk SSSR, Tekh. Kibern., 1980, no. 5, pp. 73–77.

    Google Scholar 

  4. Schassberger, R., The Steady-State Distribution of Spent Service Times Present in the M=G=1 Foreground-Background Processor-Sharing Queue, J. Appl. Prob., 1988, vol. 25, pp. 194–203.

    Google Scholar 

  5. Nagonenko, V.A. and Pechinkin, A.V., High Traffic Intensity in a System with Foreground-Background Processor Sharing Discipline, Izv. Akad. Nauk SSSR, Tekh. Kibern., 1980, no. 6, pp. 62–67.

    Google Scholar 

  6. Pechinkin, A.V. and Tatashev, A.G., Generalized Foreground-Background Processor Sharing Discipline, Izv. Akad. Nauk SSSR, Tekh. Kibern., 1981, no. 4, pp. 120125.

    Google Scholar 

  7. Yashkov, S.F., Analiz ocheredei v EVMs (Computer-aided Analysis of Queues), Moscow: Radio i Svyaz', 1989.

    Google Scholar 

  8. Pechinkin, A.V., Nestatsionarnye kharakteristiki SMO s distsiplinoi PRP (Time-Varying Characteristics of a Queueing System under FBPS Discipline), Sb. Veroyatnost' i ee prilozheniya. Mat. issledovaniya (Collected Papers on Probability and Its Application: Mathematical Investigation), Kishinev: Stiintsa, 1990, vol. 116.

    Google Scholar 

  9. Pechinkin, A.V., Stationary State Probabilities of a Queueing System with Markov Input Flow and FBPS Discipline, in Sb. Poisk signala v mnogokanal'nykh sistemakh (Search for Signals in Multichannel Systems), Tomsk: Tomsk. Gos. Univ., 1987, vol. 2, pp. 137–140.

    Google Scholar 

  10. Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Ross. Univ. Druzhby Narodov, 1995.

    Google Scholar 

  11. Lucantoni, D.M., New Results of the Single-Server Queue with a Batch Markov Arrival Process, Commun. Statist. Stochastic Models, 1991, vol. 7, pp. 1–46.

    Google Scholar 

  12. Lucantoni, D.M., Choudhury, G.L., and Whitt, W., The Transient BMAP=G=1 Queue, Commun. Statist. Stochastic Models, 1994, vol. 10, pp. 145–182.

    Google Scholar 

  13. Pechinkin, A.V., Stationary State Probabilities of theMAP=G=1=n System with Foreground-Background Processor Sharing Discipline, Vest. Ross. Univ. Druzhby Narodov, Ser. Prikl. Mat. Inform., 1998, no. 1, pp. 104–109.

    Google Scholar 

  14. Pechinkin, A.V., The BMAP=G=1= 1 System with Foreground-Background Processor Sharing Discipline, Avtom. Telemekh., 1999, no. 10, pp. 108–114.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Salerno, Italy

    C. D'Apice & R. Manzo

  2. Institute of Information Problems, Russian Academy of Sciences, Moscow

    A. V. Pechinkin

Authors
  1. C. D'Apice
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Manzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Pechinkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

D'Apice, C., Manzo, R. & Pechinkin, A.V. A Finite MAP K /G K /1 Queueing System with Generalized Foreground-Background Processor-Sharing Discipline. Automation and Remote Control 65, 1793–1799 (2004). https://doi.org/10.1023/B:AURC.0000047893.33693.d5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000047893.33693.d5

Keywords

Search

Navigation