Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes

Benjamin Melamed and Micha Yadin
Additional contact information
Benjamin Melamed: AT&T Bell Laboratories, Holmdel, New Jersey
Micha Yadin: Technion, Haifa, Israel

Operations Research, 1984, vol. 32, issue 4, 926-944

Abstract: This paper proposes a methodology for computing numerical bounds on cumulative-time (i.e., the time spent in a specified set of states before entering another specified set of states) distributions over discrete state Markov processes. The methodology uses randomization procedures to compute results for appropriately defined transient Markov processes; the transient distribution computed is equivalent to the requisite cumulative-time distribution. A queueing application of the methodology to delay times in queueing networks is outlined and its efficacy is appraised by comparing the results with a sojourn time for a problem with a known distribution.

Keywords: 114 randomization procedures; 115 queueing networks; 683 sojourn time distributions (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.4.926 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:32:y:1984:i:4:p:926-944

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().