Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-31T09:34:28.337Z Has data issue: false hasContentIssue false
  • English
  • Français

Time dependent analysis of multivariate marked renewal processes

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Jewgeni H. Dshalalow
Jewgeni H. Dshalalow*
Affiliation:
Florida Institute of Technology
*
∗ Postal address: Applied Mathematics Program, Division of Mathematical Sciences, College of Science and Liberal Arts, Florida Institute of Technology, Melbourne, FL 32901, USA. Email address: eugene@fit.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

The paper examines multivariate delayed marked renewal processes, of which one component is formed by a delayed compound Poisson process observed at epochs of some point process. In addition, the values of these observations (and other components) are watched when crossing their respective thresholds and the value of the original Poisson process at any moment of time, past the first passage time, is the objective of this investigation. The results (which are imperative for classes of semiregenerative processes) are given in closed analytical forms and illustrated on various stochastic models.

Keywords

Point processmarked renewal processPoisson compound processfluctuationsfirst excess level theoryfirst passage timesemiregenerative processqueueing processvacations

MSC classification

Primary: 60K10: Applications (reliability, demand theory, etc.) 60K15: Markov renewal processes, semi-Markov processes 60K25: Queueing theory

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 38 , Issue 3 , September 2001 , pp. 707 - 721
Copyright
Copyright © by the Applied Probability Trust 2001 

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

Doshi, B. (1990). Single-server queues with vacations. In Stochastic Analysis of Computer and Communication Systems, ed. Takagi, H. Elsevier, Amsterdam, pp. 217–265.Google Scholar
Dshalalow, J. H. (1994). On termination time processes. In Studies in Applied Probability (J. Appl. Prob. 31A), eds Galambos, J. and Gani, J. Applied Probability Trust, Sheffield, pp. 325–336.Google Scholar
Dshalalow, J. H. (1997). Queueing systems with state dependent parameters. In Frontiers in Queueing, ed. Dshalalow, J. D. CRC Press, Boca Raton, FL, pp. 61–116.Google Scholar
Dshalalow, J. H. (1997). On the level crossing of multi-dimensional delayed renewal processes. J. Appl. Math. Stoch. Anal. 10, 355–361.CrossRefGoogle Scholar
Dshalalow, J. H. (1998). Queues with hysteretic control by vacation and post-vacation periods. Queueing Systems 29, 231–268.Google Scholar
Dshalalow, J. H. (1998). Queueing processes in bulk systems under the D-policy. J. Appl. Prob. 35, 976–989.CrossRefGoogle Scholar
Dshalalow, J. H. (2001). Note on D-policy bulk queueing systems. J. Appl. Prob. 38, 280–283.Google Scholar
Dshalalow, J. H. (2001). New fluctuation analysis of D-policy bulk queues with multiple vacations. Submitted.Google Scholar
Federgruen, A., and So, K. C. (1991). Optimality of threshold policy in single-server queueing systems with server vacations. Adv. Appl. Prob. 23, 388–405.CrossRefGoogle Scholar
Jacob, M. J., and Madhusoodanan, T. P. (1987). Transient solution for a finite capacity M/G^a,b/1 queueing system with vacations to the server. Queueing Systems 2, 381–386.CrossRefGoogle Scholar
Lee, H. W., Lee, S. S., Park, J. O., and Chae, K. C. (1994). Analysis of MX/G/1 queue with N-policy and multiple vacations. J. Appl. Prob. 31, 476–496.Google Scholar
Lee, H. W., Lee, S. S., and Chae, K. C. (1996). A fixed-size batch service queue with vacations. J. Appl. Math. Stoch. Anal. 9, 205–219.CrossRefGoogle Scholar
Takagi, H. (1992). Time-dependent process of M/G/1 vacation models with exhaustive service. J. Appl. Prob. 29, 418–429.Google Scholar