Skip to main content
SpringerLink
Log in

Analysis of N-policy queues with disastrous breakdown

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

In the area of optimal design and control of queues, the N-policy has received great attention. A single server queueing system with system disaster is considered where the server waits till N customers accumulate in the queue and upon the arrival of Nth customer the server begins to serve the customers until the system becomes idle or the occurrence of disaster whichever happens earlier. The system size probabilities in transient state are obtained in closed form using generating functions and steady-state system size probabilities are derived in closed form using generating functions and continued fractions. Further, the mean and variance for the number of customers in the system are derived for both transient and steady states and these results are deduced for the specific models. Time-dependent busy period distribution is also obtained. Numerical illustrations are also shown to visualize the system effect.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Abate J, Whitt W (1988) Simple spectral representations for the \(M/M/1\) queue. Queueing Syst 3(4):321–346

    Article  Google Scholar 

  • Al-Hassan QM (2005) On inverses of tridiagonal matrices. J Discrete Math Sci Cryptogr 8(1):49–58

    Article  Google Scholar 

  • Arumuganathan R, Jeyakumar S (2005) Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times. Appl Math Model 29(10):972–986

    Article  Google Scholar 

  • Baumann H, Sandmann W (2012) Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes. Comput Oper Res 39(2):413–423

    Article  Google Scholar 

  • Bhagat A, Jain M (2013) Unreliable \(M^X/G/1\) retrial queue with multi-optional services and impatient customers. Int J Oper Res 17(2):248–273

    Article  Google Scholar 

  • Boucherie RJ, Boxma OJ (1996) The workload in the \(M/G/1\) queue with work removal. Probab Eng Inform Sci 10:261–277

    Article  Google Scholar 

  • Chen A, Renshaw E (1997) The \(M/M/1\) queue with mass exodus and mass arrivals when empty. J Appl Probab 34(1):192–207

    Article  Google Scholar 

  • Cohen JW (1982) The single server queue. North-Holland, Amsterdam

    Google Scholar 

  • Gelenbe E (1991) Product-form queueing networks with negative and positive customer. J Appl Probab 28(3):656–663

    Article  Google Scholar 

  • Heyman DP (1968) Optimal operating policies for \(M/G/1\) queueing system. Oper Res 16:362–382

    Article  Google Scholar 

  • Kella ONS, Chaudhary ML (1984) The threshold policy in the \(M/G/1\) queue with server vacations. Nav Res Log 36:111–123

    Article  Google Scholar 

  • Lee DH, Yang WS (2013) The N-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks. Appl Math Model 37(23):9722–9731

    Article  Google Scholar 

  • Lim DE, Lee DH, Yang WS, Chae KC (2013) Analysis of the GI/Geo/1 queue with N-policy. Appl Math Model 37(7):4643–4652

    Article  Google Scholar 

  • Nelson R (1995) Probability, stochastic processes and queueing theory. The mathematics of computer performance modeling, 3rd edn. Springer, New York

  • Parthasarathy PR, Sudhesh R (2008) Transient solution of a multiserver Poisson queue with N-policy. Comput Math Appl 55(3):550–562

    Article  Google Scholar 

  • Singh CJ, Jain M, Kumar B (2014) Analysis of \(M^x/G/1\) queueing model with balking and vacation. IJOR 19(2):154–173

    Article  Google Scholar 

  • Sudhesh R, Vijayashree KV (2013) Stationary and transient analysis of \(M/M/1\) G-queues. Int J Math Oper Res 5(2):282–299

    Article  Google Scholar 

  • Suhasini AVS, Srinivasa Rao K, Rajasekhara Reddy P (2014) Queueing model with non-homogeneous bulk arrivals having state-dependent service rates. IJOR 21(1):84–99

    Article  Google Scholar 

  • Vasiliadis G (2014) Transient analysis of the \(M/M/k/N/N\) queue using a continuous time homogeneous Markov system with finite state size capacity. Commun Stat Theory Methods 43(7):1548–1562

    Article  Google Scholar 

  • Yadin M, Naror P (1963) Queueing systems with a removable service station. Oper Res Q 14:393–405

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Bharathidasan Institute of Technology (BIT) Campus, Anna University, Tiruchirappalli, 620 024, Tamilnadu, India

    R. Sudhesh & R. Sebasthi Priya

  2. Department of Mathematics, University of Central Arkansas, Conway, AR, 72035, USA

    R. B. Lenin

Authors
  1. R. Sudhesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Sebasthi Priya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. B. Lenin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Sudhesh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sudhesh, R., Sebasthi Priya, R. & Lenin, R.B. Analysis of N-policy queues with disastrous breakdown. TOP 24, 612–634 (2016). https://doi.org/10.1007/s11750-016-0411-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-016-0411-6

Keywords

Mathematics Subject Classification

Search

Navigation