Abstract

An open‐loop window flow‐control scheme regulates the flow into a system by allowing at most a specified window size W of flow in any interval of length L. The sliding window considers all subintervals of length L, while the jumping window considers consecutive disjoint intervals of length L. To better understand how these window control schemes perform for stationary sources, we describe for a large class of stochastic input processes the asymptotic behavior of the maximum flow in such window intervals over a time interval [0, T] as T and Lget large, with T substantially bigger than L. We use strong approximations to show that when T ≫ L ≫ logT an invariance principle holds, so that the asymptotic behavior depends on the stochastic input process only via its rate and asymptotic variability parameters. In considerable generality, the sliding and jumping windows are asymptotically equivalent. We also develop an approximate relation between the two maximum window sizes. We apply the asymptotic results to develop approximations for the means and standard deviations of the two maximum window contents. We apply computer simulation to evaluate and refine these approximations.

Highlights

  • The Hungarian influence on probability theory, and mathematics more generally, seems to be greater than can be accounted for solely by chance

  • We study open-loop sliding and jumping window control schemes via asymptotics

  • It is natural to consider applications based on asymptotics

Read more

Summary

Introduction

The Hungarian influence on probability theory, and mathematics more generally, seems to be greater than can be accounted for solely by chance. J J(L,T,I) max(I(kL)- I((k- 1)L)" 1 < k < T/L), and let S S(L,T,I) be the random variable representing the maximum sliding window content as a function of L, T, and I, i.e.,. We consider 10 replications each of several renewal processes with 1, T 106 and various values of L These simulation experiments provide additional support for approximations (1)- (5). In [1] we compare the sliding window to a leaky-bucket-based flow-control scheme. There we conclude that the sliding window admits larger bursts than the leaky bucket for given peak rate and given sustainable rate To draw this conclusion, we carry out a specific construction: We generate a sample path of a stationary point process I and specify a window length L. Reibman and Berger [14] reach the same conclusions for sample video teleconferencing sequences

The Central Limit Theorem and Strong Approximations
The Role of L in the Brownian Motion Approximation
Discriminating Windows
NumericM Comparisons
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call