Departure process in a mixed fork–join synchronization network
✍ Scribed by Muhammad El-Taha
- Book ID
- 104008466
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 511 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
In this article we consider a mixed fork-join synchronization Markovian queueing network consisting of two input buffers, B 1 and B 2 , fed by arrivals from two populations. The first is a finite population of size K and second population is infinite. The first population feeds the first buffer and the second population feeds the second finite buffer. As soon as there is one part in each buffer, two parts one from each buffer are joined and exit immediately. We provide model analysis, performance measures, and characterization of the departure process; in particular we provide the marginal distribution of inter-departure times.
📜 SIMILAR VOLUMES
A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes fr
The purpose of this paper is to describe a quantitative method of trophic dynamic analysis derived from a systems ecology theoretical foundation. This method was devised to provide a solution for the problem of how to deal with mixed trophic and non-trophic processes in cyclic ecosystem networks, a