Heavy traffic analysis of a polling model with retrials and glue periods

DOI10.1080/15326349.2018.1530601zbMATH Open1411.90085arXiv1707.03876OpenAlexW2964104210MaRDI QIDQ4634191FDOQ4634191

Authors: Murtuza Ali Abidini, Jacques Resing, Jan-Pieter L. Dorsman 

Publication date: 7 May 2019

Published in: Stochastic Models (Search for Journal in Brave)

Abstract: We present a heavy traffic analysis of a single-server polling model, with the special features of retrials and glue periods. The combination of these features in a polling model typically occurs in certain optical networking models, and in models where customers have a reservation period just before their service period. Just before the server arrives at a station there is some deterministic glue period. Customers (both new arrivals and retrials) arriving at the station during this glue period will be served during the visit of the server. Customers arriving in any other period leave immediately and will retry after an exponentially distributed time. As this model defies a closed-form expression for the queue length distributions, our main focus is on their heavy-traffic asymptotics, both at embedded time points (beginnings of glue periods, visit periods and switch periods) and at arbitrary time points. We obtain closed-form expressions for the limiting scaled joint queue length distribution in heavy traffic and use these to accurately approximate the mean number of customers in the system under different loads.

Full work available at URL: https://arxiv.org/abs/1707.03876

Recommendations

• Performance analysis of polling systems with retrials and glue periods
• Analysis of the waiting time distribution for polling systems with retrials and glue periods
• Polling systems with periodic server routing in heavy traffic: renewal arrivals
• scientific article; zbMATH DE number 1031398
• Polling systems with periodic server routeing in heavy traffic: distribution of the delay

zbMATH Keywords

heavy trafficpolling modelretrials

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)

Cites Work

• Probability with Martingales
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polling systems with zero switchover times: A heavy-traffic averaging principle
• Polling systems in heavy traffic: a Bessel process limit
• On eigenvalues of matrices dependent on a parameter
• Polling systems and multitype branching processes
• Mathematical methods to study the polling systems
• Title not available (Why is that?)
• Towards a unifying theory on branching-type polling systems in heavy traffic
• Polling systems with periodic server routeing in heavy traffic: distribution of the delay
• A new method for deriving waiting-time approximations in polling systems with renewal arrivals
• Distribution of the delay in polling systems in heavy traffic
• Performance analysis of polling systems with retrials and glue periods
• Continuity and Location of Zeros of Linear Combinations of Polynomials
• The multitype Galton-Watson process with ρ near 1

Cited In (5)

• A two-class queueing system with constant retrial policy and general class dependent service times
• Strategic joining in a single-server retrial queue with batch service
• Performance analysis of polling systems with retrials and glue periods
• HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
• Analysis of the waiting time distribution for polling systems with retrials and glue periods

This page was built for publication: Heavy traffic analysis of a polling model with retrials and glue periods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634191)