A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals

DOI10.1016/J.CAMWA.2005.11.018zbMath1109.90022OpenAlexW2002425444MaRDI QIDQ2494770

Tsuyoshi Katayama, Kaori Kobayashi

Publication date: 30 June 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.11.018

zbMATH Keywords

Compound Poisson processExhaustive serviceTime-limited servicePolling systemExponential timerNonpreemptive disciplineStructured batch arrival

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Stability of token passing rings
• Stability, monotonicity and invariant quantities in general polling systems
• Workloads and waiting times in single-server systems with multiple customer classes
• Waiting time analysis for a queueing system with time-limited service and exponential timer
• Application of level crossing analysis to discrete state processes in queueing systems
• A single-server queue with vacations and gated time-limited service
• Structured priority queueing systems with applications to packet-radio networks
• Pseudo-conservation laws in cyclic-service systems
• The queueing system M^X/G/1 and its ramifications
• Efficient visit orders for polling systems
• On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals

This page was built for publication: A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals