Embedded Markov chain analysis of the superposition of renewal processes
For a superposition of i.i.d. renewal processes we derive in closed form the limiting distribution of an embedded counting process that describes the simultaneous presence of points from the individual renewal streams in consecutive inspection intervals of fixed given length.
Volume (Year): 82 (2012)
Issue (Month): 8 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Alsmeyer, Gerold, 1996. "Superposed continuous renewal processes A Markov renewal approach," Stochastic Processes and their Applications, Elsevier, vol. 61(2), pages 311-322, February.
- Mitov, Kosto V. & Yanev, Nikolay M., 2006. "Superposition of renewal processes with heavy-tailed interarrival times," Statistics & Probability Letters, Elsevier, vol. 76(6), pages 555-561, March.
- Kella, Offer & Stadje, Wolfgang, 2006. "Superposition of renewal processes and an application to multi-server queues," Statistics & Probability Letters, Elsevier, vol. 76(17), pages 1914-1924, November.
- Susan L. Albin, 1986. "Delays for Customers from Different Arrival Streams to a Queue," Management Science, INFORMS, vol. 32(3), pages 329-340, March.
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:82:y:2012:i:8:p:1497-1503. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.