Transient solution of a multiserver Poisson queue with N-policy

Authors:
P. R. Parthasarathy;R. Sudhesh
Affiliations:
Department of Mathematics, Indian Institute of Technology Madras, Chennai - 600 036, India;School of Science and Humanities, VIT University, Vellore - 632 014, India
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 4
Cited 2

Data networks

Data networks
Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
A queue with service interruptions in an alternating random environment

Operations Research
Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy

Computers and Operations Research

Near optimal buffer allocation in remanufacturing systems with N-policy

Computers and Industrial Engineering
Time dependent analysis of M/M/1 queue with server vacations and a waiting server

Proceedings of the 6th International Conference on Queueing Theory and Network Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

We consider an M/M/c queueing system, where the server idles until a fixed number N of customers accumulates in a queue and following the arrival of the N-th customer, the server serves exhaustively the queue. We obtain the exact transient solution for the state probabilities of this N-policy queue by a direct approach. Further we obtain the time-dependent mean, variance of this system and its busy period distribution.