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/

Zendy Plus

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

Zendy Tools

Zendy Open

We focus on the numerical analysis of a coupled queueing system with Poisson arrivals and exponentially distributed service times. Such a system consists of multiple queues served by a single server. Service is synchronised meaning that there is a departure from every queue upon service completion and there is no service whenever one of the queues is empty. It was shown before that the terms in the Maclaurin series expansion of the steady-state distribution of this queueing system when the service rate is sent to 0 (overload) can be calculated efficiently. In the present paper we extend this approach to lower loads. We focus on a sequence of Taylor series expansions of the stationary distribution around increasing service rates. For each series expansion, we use Jacobi iteration to calculate the terms in the series expansion where the initial solution is the approximation found by the preceding series expansion. As the generator matrix of the queueing system at hand is sparse, the numerical complexity of a single Jacobi iteration is O(NMK), where N is the order of the series expansion, K is the number of queues and M is the size of the state space. Having a good initial solution reduces the number of Jacobi iterations considerably, meaning that we can find a sequence of good approximations of the steady state probabilities fast

A Taylor series approach for coupled queueing systems with intermediate load