Hostname: page-component-cb9f654ff-hqlzj Total loading time: 0 Render date: 2025-08-19T06:40:39.718Z Has data issue: false hasContentIssue false
  • English
  • Français

Some notes on the total service time in certain loss systems

Published online by Cambridge University Press:  14 July 2016

P. R. Parthasarathy  and
M. Sharafali
P. R. Parthasarathy*
Affiliation:
Indian Institute of Technology, Madras
M. Sharafali*
Affiliation:
Indian Institute of Technology, Madras
*
∗ Postal address: Department of Mathematics, Indian Institute of Technology, Madras 600036, India.
∗ Postal address: Department of Mathematics, Indian Institute of Technology, Madras 600036, India.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we discuss the total service rendered by all the servers in certain loss systems.

Keywords

MARKOV RENEWAL PROCESS

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 21 , Issue 3 , September 1984 , pp. 616 - 627
Copyright
Copyright © Applied Probability Trust 1984 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Çinlar, E. (1975) Markov renewal theory: A survey. Management Sci. 21, 727–752.Google Scholar
Saaty, T. L. (1961) Elements of Queueing Theory. McGraw-Hill, New York.Google Scholar
Takács, L. (1957) On certain sojourn time problems in the theory of stochastic processes. Acta Math. Acad. Sci. Hung. 8, 169–191.Google Scholar
Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar