Traffic with an FBM limit: convergence of the workload process
Highly-aggregated traffic in communication networks is often modeled as fractional Brownian motion (fBm). This is justified by the theoretical result that the sum of a large number of on-off inputs, with either on-times or off-times having a heavy-tailed distribution with infinite variance, converges to fBm, after rescaling time appropriately. For performance analysis purposes, the key question is whether this convergence carries over to the stationary buffer content process. In this paper it is shown that, in a heavy-traffic queueing environment, this property indeed holds
|Queueing theory (msc 60K25), Performance evaluation; queueing; scheduling (msc 68M20), Queues and service (msc 90B22), Gaussian processes (msc 60G15)|
|Logistics (theme 3), Energy (theme 4)|
|CWI. Probability, Networks and Algorithms [PNA]|
Dȩbicki, K.G, & Mandjes, M.R.H. (2002). Traffic with an FBM limit: convergence of the workload process. CWI. Probability, Networks and Algorithms [PNA]. CWI.