May 19, 2015 · System performance is studied in the heavy-traffic regime, in which one of the queues becomes critically loaded with the other queue remaining ...

We study a k-limited polling model in heavy-traffic (HT). The main challenge is that at most customers can be served in queue i per cycle.

We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in ...

Jan 4, 2016 · This technique enables us to present the first study rigorously proving HT asymptotics for polling models with a non-branching service strategy.

ABSTRACT. We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers dur-.

Open problems for critically loaded k-limited polling systems · Author · Abstract · Suggested Citation · Download full text from publisher · More about this item.

Critically loaded k-limited polling systems. VALUETOOLS'15: Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and ...

Apr 1, 2022 · We present two open problems and a strong conjecture fork-limited systems in HT in order to stimulate research in these directions. 2 Problem ...

A recent study of polling system belongs to [19] analysed the performance of a tandem queue modelled as a polling system in an aluminium manufacturing process.

Open problems for critically loaded k-limited polling systems; Journal: Queueing Systems; Volume | Issue number: 100 | 3-4; Pages (from-to): 281-283; Document ...