A two-queue polling model with priority on one queue and heavy-tailed On/Off sources: a heavy-traffic limit

  title={A two-queue polling model with priority on one queue and heavy-tailed On/Off sources: a heavy-traffic limit},
  author={Rosario Delgado},
  journal={Queueing Systems},
  • R. Delgado
  • Published 1 June 2016
  • Mathematics
  • Queueing Systems
We consider a single-server polling system consisting of two queues of fluid with arrival process generated by a big number of heavy-tailed On/Off sources, and application in road traffic and communication systems. Class-j fluid is assigned to queue j, $$j=1,2$$j=1,2. Server 2 visits both queues to process or let pass the corresponding fluid class. If there is class-2 fluid in the system, it is processed by server 2 until the queue is empty, and only then server 2 visits queue 1, revisiting… 
Research on Two-level Priority Polling Access Control Protocol Based on Continuous Time
The results show that the protocol can distinguish the business with different priorities, the average waiting delay of users is lower, and the quality of service of the system is higher.
The reflected fBm process on a convex polyhedron as limit for the X−model with On/Off sources under heavy-traffic
We consider a X−model with fluid queues that can be approximated under heavy-traffic conditions by a two-dimensional reflected fractional Brownian motion (rfBm). Specifically, we prove a


A Two-Queue Polling Model with Two Priority Levels in the First Queue
This paper considers a single-server cyclic polling system consisting of two queues where the server is delayed by a random switch-over time between visits to successive queues, and studies the cycle time distribution, the waiting times for each customer type, the joint queue length distribution at polling epochs, and the steady-state marginal queue length distributions.
Multiple channel queues in heavy traffic. I
The queueing systems considered in this paper consist of r independent arrival channels and s independent service channels, where as usual the arrival and service channels are independent. Arriving
From results, it is concluded that significant cost reductions are possible by bounding the production runs of the low-priority item, which indicates the potential of the k-limited service discipline as priority rule in production environments.
Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies
A discrete-review control policy is constructed and proved to be asymptotically optimal in the heavy traffic limit and its cost performance approaches the bound associated with a single pooled resource.
Lévy-driven polling systems and continuous-state branching processes
This paper considers a ring of N ≥ 1 queues served by a single server in a cyclic order, and derives the steady-state distribution of the joint workload at embedded epochs, i.e. polling and switching instants.
A packet-switched network with On/Off sources and a fair bandwidth sharing policy: state space collapse and heavy-traffic
This work combines state space collapse (SSC) and an Invariance Principle to show that when N→+∞ the conveniently scaled workload and flow count processes converge, the workload limit process converges to a reflected fractional Brownian motion on a polyhedral cone.
Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge
Two heavy-traffic limit theorems (HTLT) for the diffusion-scaled, two-dimensional total workload process are proved: one for when the first station implements exhaustive service and the other for when gated service is employed.
Stability analysis of a two-station cascade queueing network
A two-station cascade network, where the first station has Poisson input and the second station has renewal input, with i.i.d. service times at both stations is considered, using a regenerative method.