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 consider a GI/G/c/K-type retrial queueing system with constant retrialrate. The system consists of a primary queue and an orbit queue. The primaryqueue has $c$ identical servers and can accommodate the maximal number of $K$jobs. If a newly arriving job finds the full primary queue, it joins the orbit.The original primary jobs arrive to the system according to a renewal process.The jobs have general i.i.d. service times. A job in front of the orbit queueretries to enter the primary queue after an exponentially distributed timeindependent of the orbit queue length. Telephone exchange systems, MediumAccess Protocols and short TCP transfers are just some applications of theproposed queueing system. For this system we establish minimal sufficientstability conditions. Our model is very general. In addition, to the knownparticular cases (e.g., M/G/1/1 or M/M/c/c systems), the proposed model coversas particular cases the deterministic service model and the Erlang model withconstant retrial rate. The latter particular cases have not been considered inthe past. The obtained stability conditions have clear probabilisticinterpretation.

Stability Analysis of GI/G/c/K Retrial Queue with Constant Retrial Rate