Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

Journal Article

Multi-Server Markovian Queue with Finite Waiting Space

O. P. Sharma and J. Dass
Sankhyā: The Indian Journal of Statistics, Series B (1960-2002)
Vol. 50, No. 3 (Dec., 1988), pp. 428-431
Stable URL: http://www.jstor.org/stable/25052561
Page Count: 4

You can always find the topics here!

Topics: Recurrence relations, Polynomials, Eigenvalues
Were these topics helpful?
See something inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Download ($43.95)
  • Add to My Lists
  • Cite this Item
Multi-Server Markovian Queue with Finite Waiting Space
Preview not available

Abstract

This paper studies the transient behaviour of an M/M/c/N queue. The state probabilities at finite time have been found in the closed form and are amenable to easy computability.

Page Thumbnails

  • Thumbnail: Page 
[428]
    [428]
  • Thumbnail: Page 
429
    429
  • Thumbnail: Page 
430
    430
  • Thumbnail: Page 
431
    431