On the calculation of sample-path backlog bounds in queueing systems over finite time horizons

摘要: The ability to calculate backlog bounds is of key importance for buffer sizing in packet-switched networks. In particular, it critical capture the statistical multiplexing gains which, turn, calls stochastic bounds. network calculus (SNC) a promising methodology compute such So far literature SNC-based apply only an arbitrary, but fixed single point time. Yet, from engineering perspective, one would rather like have sample path bound, i.e., bound that applies (with certain violation probability) all While, general, are hard obtain we investigate this paper how can be computed over finite time horizons. show simple extension known SNC results lead suboptimal by deriving alternative (based on extreme value theory) bounding Interestingly, none two methods completely dominates other. For new method also discuss evolved into corresponding analysis analogous existing SNC.