Sampling at subexponential times, with queueing applications

From MaRDI portal
Publication:1593601

DOI10.1016/S0304-4149(98)00064-7zbMath0961.60080OpenAlexW2077501147MaRDI QIDQ1593601

Claudia Klüppelberg, Karl Sigman, Soren Asmussen

Publication date: 17 January 2001

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-4149(98)00064-7




Related Items (42)

Branching processes with immigration in atypical random environmentMoments and tails in monotone-separable stochastic networks.AN IDENTIFICATION PROBLEM IN AN URN AND BALL MODEL WITH HEAVY TAILED DISTRIBUTIONSOn regenerative estimation of extremal index in queueing systemsTail asymptotics for processor-sharing queuesLog-convexity of counting processes evaluated at a random end of observation time with applications to queueing modelsTandem queues with subexponential service times and finite buffersThe queue length in an \(M/G/1\) batch arrival retrial queueThe DFR Property for Counting Processes Stopped at an Independent Random TimeExternalities in the M/G/1 queue: LCFS-PR versus FCFSRefined tail asymptotic properties for the \(M^X/G/1\) retrial queueTail asymptotics for the \(M_1,M_2/G_1,G_2/1\) retrial queue with non-preemptive priorityProcessor sharing: a survey of the mathematical theoryHeavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 typeTail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service timesA General Class of Closed Fork and Join Queues with Subexponential Service TimesTails of random sums of a heavy-tailed number of light-tailed termsTail asymptotics for the fundamental period in the MAP\(/G/1\) queueTail Asymptotics for the Waiting Time in an M/G/1/ROS Vacation Queue with Regularly-Varying ServiceSUBEXPONENTIAL INTERVAL GRAPHS GENERATED BY IMMIGRATION–DEATH PROCESSESA sufficient condition for the subexponential asymptotics of GI/G/\(1\)-type Markov chains with queueing applicationsOn Exceedance Times for Some Processes with Dependent IncrementsAsymptotics for the First Passage Times of Lévy Processes and Random WalksAccelerated consistent estimation of a high load probability in \(M/G/1\) and \(GI/G/1\) queuesPacket reordering in networks with heavy-tailed delaysGlobal and local asymptotics for the busy period of an M/G/1 queueTail behaviour of the busy period of a GI/GI/1 queue with subexponential service timesAccuracy of transformed kernel density estimates for a heavy-tailed distributionThe supremum of a Gaussian process over a random intervalRegularly varying tail of the waiting time distribution in M/G/1 retrial queueHeavy tails in multi-server queueTail asymptotics for the queue length in an M/G/1 retrial queueSojourn time asymptotics in processor-sharing queuesSubexponential asymptotics of hybrid fluid and ruin modelsStrong, weak and false inverse power lawsThe Renewal-Based Asymptotics and Accelerated Estimation of a System with Random Volume CustomersTails for (max, plus) recursions under subexponentialityA Two‐Queue Polling Model with Regularly Varying Service and/or Switchover TimesNegative ageing properties for counting processes arising in virtual age modelsImproved algorithms for rare event simulation with heavy tailsReduced-load equivalence for queues with Gaussian inputTail behaviour of the area under the queue length process of the single server queue with regularly varying service times



Cites Work


This page was built for publication: Sampling at subexponential times, with queueing applications