ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1203.6574
38
7

Tail asymptotics for cumulative processes sampled at heavy-tailed random times with applications to queueing models in Markovian environments

29 March 2012
H. Masuyama
ArXivPDFHTML
Abstract

This paper considers the tail asymptotics for a cumulative process {B(t);t≥0}\{B(t); t \ge 0\}{B(t);t≥0} sampled at a heavy-tailed random time TTT. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality P(B(T)>bx)∼P(M(T)>bx)∼P(T>x){\sf P}(B(T) > bx) \sim {\sf P}(M(T) > bx) \sim {\sf P}(T>x)P(B(T)>bx)∼P(M(T)>bx)∼P(T>x) as x→∞x \to \inftyx→∞, where M(t)=sup⁡0≤u≤tB(u)M(t) = \sup_{0 \le u \le t}B(u)M(t)=sup0≤u≤t​B(u) and bbb is a certain positive constant. The main results of this paper can be used to obtain the subexponential asymptotics for various queueing models in Markovian environments. As an example, using the main results, we derive subexponential asymptotic formulas for the loss probability of a single-server finite-buffer queue with an on/off arrival process in a Markovian environment.

View on arXiv
Comments on this paper