English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We address the transient analysis of networks of queues with exponential service times. Such networks can easily have such a huge state space that their exact transient analysis is unfeasible. In this paper we propose an approximate transient analysis technique based on decomposing the queues of the network using a compact and approximate representation of the departure process of each queue. Namely, we apply time-inhomogeneous Markov arrival processes (IMAP) to describe the stream of clients leaving the queues. By doing so, the overall approximate model of the network is a time-inhomogeneous continuous time Markov chain (ICTMC) with significantly less number of states than there are in the original Markov chain. The proposed construction of the output IMAP of a queue is based on its transient state probabilities. We illustrate the approach first on a single M/M/1 queue and analyze the goodness of fitting of the departure process by numerical examples. Then we extend the approach to networks of queues and evaluate the precision of the resulting technique on several simple numerical examples by comparing the exact and the approximate transient probabilities of the queues.

Approximate Transient Analysis of Queuing Networks by Decomposition based on Time-Inhomogeneous Markov Arrival Processes