Gaussian limits for scheduled traffic with super-heavy tailed perturbations

Victor F. Araman () and Peter W. Glynn ()
Additional contact information
Victor F. Araman: American University of Beirut
Peter W. Glynn: Department of Management Science and Engineering at Stanford University

Queueing Systems: Theory and Applications, 2023, vol. 105, issue 1, No 2, 5-15

Abstract: Abstract A scheduled arrival model is one in which the jth customer is scheduled to arrive at time jh but the customer actually arrives at time $$jh + \xi _j$$ j h + ξ j , where the $$\xi _j$$ ξ j ’s are independent and identically distributed. It has previously been shown that the arrival counting process for scheduled traffic obeys a functional central limit theorem (FCLT) with fractional Brownian motion (fBM) with Hurst parameter $$H \in (0,1/2)$$ H ∈ ( 0 , 1 / 2 ) when the $$\xi _j$$ ξ j ’s have a Pareto-like tail with tail exponent lying in (0, 1). Such limit processes exhibit less variability than Brownian motion, because the scheduling feature induces negative correlations in the arrival process. In this paper, we show that when the tail of the $$\xi _j$$ ξ j ’s has a super-heavy tail, the FCLT limit process is Brownian motion (i.e., $$H=1/2$$ H = 1 / 2 ), so that the heaviness of the tails eliminates any remaining negative correlations and generates a limit process with independent increments. We further study the case when the $$\xi _j$$ ξ j ’s have a Cauchy-like tail, and show that the limit process in this setting is a fBM with $$H=0$$ H = 0 . So, this paper shows that the entire range of fBMs with $$H \in [0,1/2]$$ H ∈ [ 0 , 1 / 2 ] are possible as limits of scheduled traffic.

Keywords: Scheduled arrival process; Fractional Brownian motion; Brownian motion; Heavy tails; Primary: 60F05; 60F17; 60G22; Secondary: 60J65 (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-023-09884-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:105:y:2023:i:1:d:10.1007_s11134-023-09884-w

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-023-09884-w

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().