Busy period, virtual waiting time and number of customers in G^ |M^|1| B system

DOI10.1007/S11134-010-9170-5zbMATH Open1203.60136OpenAlexW2139760873MaRDI QIDQ975792FDOQ975792

T. V. Kadankova, V. F. Kadankov

Publication date: 11 June 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-010-9170-5

zbMATH Keywords

busy periodfirst exit timelinear componentresolvent sequencetime until the first customer lossvalue of overshoot

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Stopping times; optimal stopping problems; gambling theory (60G40)

Cites Work

• Exit problems for spectrally negative Lévy processes and applications to (Canadized) Russian options
• Busy period analysis for \(M/G/1\) and \(G/M/1\) type queues with restricted accessibility
• Busy periods of Poisson arrival queues with loss
• Consecutive customer losses in regular and oscillating \(M^{X}/ G /1/ n\) systems
• On the distribution of the time of the first exit from an interval and the value of a jump over the boundary for processes with independent increments and random walks
• Queues with Delays in Two-State Strategies and Lévy Input
• Title not available (Why is that?)
• On the first meeting or crossing of two independent trajectories for some counting processes.
• Title not available (Why is that?)
• Two-boundary problems for a random walk
• Title not available (Why is that?)
• Intersections of an Interval By a Difference of a Compound Poisson Process and a Compound Renewal Process
• The remaining service time upon reaching a high level in \(M/G/1\) queues
• On losses inM^X/GI/1/nqueues
• Exit problems for the difference of a compound Poisson process and a compound renewal process
• On limit theorems for the first exit time from a strip for stochastic processes. II
• Title not available (Why is that?)
• THE GI/E_k/1 QUEUE WITH FINITE WAITING ROOM
• A Two-Sided Exit Problem for a Difference of a Compound Poisson Process and a Compound Renewal Process with a Discrete Phase Space

Cited In (2)

• Queueing system \(\text{G}^{\kappa}|\text{G}|1\) with customers arriving in batches
• On functionals of a marked Poisson process observed by a renewal process

   Recommendations

• Queueing system \(\text{G}^{\kappa}|\text{G}|1\) with customers arriving in batches 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The Virtual Waiting Time for the Batch Arrival Queueing Systems 👍 👎

This page was built for publication: Busy period, virtual waiting time and number of customers in \(G^{\delta }|M^{\kappa}|1| \text B\) system

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