|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ЦЭМИ РАН |
||
Asymptotic Upperb Bounds for Overflow Proability inthe case of Heterogeneous Trafficтезисы доклада
- Авторы: Khokhlov Yury, Sidorova Oksana, Suslov Lev
- Сборник: Book o Abstract, ASMDA 2023 Conference and Demographics Workshop
- Тезисы
- Год издания: 2023
- Издательство: Global Nest
- Местоположение издательства: Greece
- Первая страница: 73
- Последняя страница: 73
- Аннотация: One of the most important tasks in analyzing of telecommunications system is to assess the quality of service of this system. For this purpose the probability of a system buffer overflow is often used. It is rarely possible to calculate it explicitly, so one or another estimate of this characteristic is used. In our report we consider a system whose input load is the sum of some average load with intensity m and the sum of independent fractional Brownian motion and stable Levy motion. The system has one service device with service intensity of C>0. When r=C-m>0 there is a stationary mode. Let Q be the maximum load in stationary mode, b be the buffer size. We are interested in the value P(Q>b) for large b. We propose some upper asymptotic estimates. These upper bounds have a power order. The proof method is based on Slepyan’s theorem (1962) and some ideas from the paper by K. Debicki, Z. Michna, T. Rolski (1998). This research was carried out in accordance with scientific program of the Moscow Center for Fundamental and Applied Mathematics and Faculty of Computational Mathematics and Cybernetics in Moscow University.
- Добавил в систему: Хохлов Юрий Степанович