About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Recurrence and Regeneration in Non-Markovian Networks of Queues
Abstract
Closed networks of queues with priorities among job classes provide a framework for modeling a wide variety of complex congestion phenomena. Steady state estimation procedures based on underlying regenerative process structure are available only for non- Markovian networks in which all service interruptions are of the preempt-repeat type and all service time distributions have positive density on the positive half-line. Using“new better than usedn distributional assumptions and sample path structure of the underlying job stack process, we establish criteria for recurrence and regeneration that avoid these restrictions. Regenerative simulation methods follow from these results. © 1987, Taylor & Francis Group, LLC. All rights reserved.