Advertisement

A multiserver queueing system with a interruptable semi-Markovian input flow of customers and customer removal from an infinite buffer

  • V. V. Chaplygin
Articles from the Russian Journal Informatsionnye Protsessy
  • 28 Downloads

Abstract

A queueing system with a interruptable semi-Markovian input flow of customers and customer removal from a buffer is considered. New customers arrive at servers or at the buffer only during time intervals when the access to the system is open. Customers are lost when the access to the system is closed at the instants of their arrivals. The intervals when the access to the system is open and closed alternate and their lengths are exponentially distributed. The first customer arriving at the system at an open-access interval removes all the customers from the buffer. Stationary characteristics of the system are found for the case when the buffer has an infinite capacity.

Keywords

Queueing System Semi Markovian Process Markovian Arrival Embed Markov Chain Finite Buffer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. V. Chaplygin, “Multiserver Queueing System with a Finite Buffer and Blocking of a Semi-Markovian Input Flow of Customers,” Inf. Protsessy 8(1), 1–9 (2008).Google Scholar
  2. 2.
    V. V. Chaplygin, “A Multiserver Queueing System with a Finite Buffer, Blocking of a Semi-Markovian Input Flow Customers, and Customer Removal from the Buffer,” Informatika Primenen. 2(3), 38–44 (2008).Google Scholar
  3. 3.
    A. V. Pechinkin and V. V. Chaplygin, “Stationary Characteristics of an SM/MSP/n/r Queueing System,” Avtom. Telemekh., No. 9, 85–100 (2004).Google Scholar
  4. 4.
    A. V. Pechinkin and V. V. Chaplygin, “Stationary Characteristics of a G/MSP/n/r Queueing System,” Vestn. RUDN, Ser. Priklad. Mat. Inform., No. 1, 119–143 (2003).Google Scholar
  5. 5.
    P. P. Bocharov and Ch. Apiche, “A G/MSP/1/r Queueing System,” Avtom. Telemekh., No. 2, 127–143 (2003).Google Scholar
  6. 6.
    Cinlar E. “Queues with Semi-Markovian Arrivals.” J. Appl. Prob. 4, 365–379 (1967).zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    V. V. Chaplygin, “An SM/MSP/1/r Queueing System,” Vestn. Bauman MGTU, Ser. Estestv. Nauki, No. 2, 60–74 (2004).Google Scholar
  8. 8.
    M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (Dover Publications, New York, 1994).Google Scholar
  9. 9.
    O. Semenova “SM/MSP/1 Queueing System with Markovian Arrival of Disasters,” in Queues, Flows, Systems, Networks (Proc. Int. Conf. Modern Mathematical Methods of Analysis and Optimization of Telecommunication Networks, Gomel, Sept. 23–25, 2003) (BSU, Minsk, 2003), Vol. 17, pp. 220–225.Google Scholar
  10. 10.
    O. V. Semenova, “Optimal Threshold Flow Control in an SM/MSP/1 Queueing System with a BMAP Flow of Negative Customers,” Vestn. Brest. Gos. Tekhn. Univ., Ser. Fiz., Mat., Khim., No. 5, 81–85 (2003).Google Scholar
  11. 11.
    O. V. Semenova, “Optimal Multithreshold Flow Control in an SM/MSP/1 Queueing System with a BMAP Flow of Negative Customers,” in Probability Theory, Mathematical Statistics and Their Applications. Materials of Scientific Conference (Belorus. Gos. Univ., Minsk, 2004), pp. 143–148.Google Scholar
  12. 12.
    H. Takagi and D. A. Wu, “Multiserver Queue with Semi-Markovian Batch Arrivals,” Comput. Commun. 27 549–556 (2004).CrossRefGoogle Scholar
  13. 13.
    H. Takagi, D. A. Wu, “Multiserver Queue with Semi-Markovian Batch Arrivals with Application to the MPEG Frame Sequence,” Internet Performance and Control of Network Systems III, Proc. SPIE 4865 178–189 (2002).Google Scholar
  14. 14.
    A. V. Pechinkin, I. A. Sokolov, and V. V. Chaplygin, “Multiserver Queueing Systems with Independent Failures and Recoveries of Servers,” in System and Methods of Informatics: Special Issue. Mathematical and Algorithmic Securing of Information-Telecommunicational Systems (Inst. Problem Informatiki RAN, Moscow, 2006) [in Russian].Google Scholar
  15. 15.
    A. V. Pechinkin, I. A. Sokolov, and V. V. Chaplygin, “A Multiserver Queueing System with a Finite Buffer and Unreliable Services,” Informatika Primenen. 1(1), 27–39 (2007).Google Scholar
  16. 16.
    A. V. Pechinkin, I. A. Sokolov, and V. V. Chaplygin, “Stationary Characteristics of a Multiserver Queueing System with Simultaneous Failures of Servers,” Informatika Primenen. 1(2), 28–38 (2007).Google Scholar
  17. 17.
    A. V. Pechinkin, I. A. Sokolov, and V. V. Chaplygin, “A Multiserver Queueing System with the Batch Failure of Servers,” Informatika Primenen. 3 (2009), (in press).Google Scholar
  18. 18.
    A. V. Pechinkin and S. I. Trishechkin, “An SM2/MSP/1/r System with the Discipline of Random Selection of Customer for Service and with a Common Buffer,” Avtom. Telemekh., No. 11, 160–180 (2003).Google Scholar
  19. 19.
    M. H. Lee, A. N. Dudin, and V. I. Klimenok, “The SM/M/N Queueing System with Broadcasting Service,” Math. Probl. Engineering 2006, 1–18 (2006).zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    A. N. Dudin, V. I. Klimenok, C. S. Kim, and M. H. Lee, “The SM/PH/N Queueing System with Broadcasting Service,” in Proc. 13th Int. Conf. on Analitical and Stochastic Modelling Techniques and Applications (ASMTA 2006), Bonn, Germany, May 28–31, 2006 (European Council for Modelling and Simulation, 2006), pp. 8–13.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2010

Authors and Affiliations

  • V. V. Chaplygin

There are no affiliations available

Personalised recommendations