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 consider a multiserver queueing system with an infinite buffer and two types of customers. The flow of customers is described by two Markovian arrival processes (MAPs). Type 1 customers have absolute priority over type 2 customers. If the arriving type 1 customer encounters all servers busy, but some of them provide service to type 2 customers, service of one type 2 customer is terminated and type 1 customer occupies the released server. To avoid too frequent termination of service of type 2 customers, we suggest reservation of some number of servers for type 1 customers. Type 2 customers, who do not succeed to get a server upon arrival or are knocked out from a server, join the buffer or leave the system forever. During a waiting period in the buffer, type 2 customers can be impatient and may leave the system forever. The ergodicity condition of the system is derived in an analytically tractable form. The stationary distribution of the system states and the main performance measures are calculated. The Laplace-Stieltjes transform of the waiting time distribution of an arbitrary type 2 customer is derived. Numerical examples are presented. The problem of the optimal channel reservation is numerically solved

mathematical problems in engineering

<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo>/</mml:mo><mml:msub><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>/</mml:mo><mml:mi>N</mml:mi><mml:mo>/</mml:mo><mml:mi>∞</mml:mi></mml:math>Queueing System with Absolute Priority and Reservation of Servers

MAP+MAP/M2/N/∞Queueing System with Absolute Priority and Reservation of Servers