On the loss process in a batch arrival queue

DOI10.1016/J.APM.2008.11.015zbMath1185.90043OpenAlexW2039773632MaRDI QIDQ967742

Andrzej Chydzinski, Mykola Bratiychuk

Publication date: 2 May 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2008.11.015

zbMATH Keywords

potential methodbatch arrival queueloss process

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (4)

Response time of the queue with the dropping function ⋮ Per-flow structure of losses in a finite-buffer queue ⋮ Burst Ratio of Packet Losses in Individual Network Flows ⋮ Transient and stationary losses in a finite-buffer queue with batch arrivals

Cites Work

• Consecutive customer losses in oscillating \(GI^X/M//n\) systems with state dependent services rates
• On the remaining service time upon reaching a given level in \(M/G/1\) queues
• The ballot theorem strikes again: packet loss process distribution
• Heuristics for Finite-Buffer Queues
• Equilibrium properties of the M/G/1 queue
• Technical Note—The Expected Remaining Service Time in a Single Server Queue
• Analysis of packet loss processes in high-speed networks
• On Ruin Problems for a Compound Poisson Process
• Explicit formulae and convergence rate for the system M ^α /G/1/N as N→∞
• The remaining service time upon reaching a high level in \(M/G/1\) queues

This page was built for publication: On the loss process in a batch arrival queue