Comparison of simple tail distribution estimators

In teletraffic theory an important and useful performance measure is the tail distribution of aggregate traffic. Generally it is very hard and computationally expensive to determine the exact distribution of the aggregate traffic, even if we know the exact distribution of each traffic source. therefore, efficient estimators should be developed. In the paper, we show simple estimators which are based on Hoeffding´s (1963) statistical inequalities for tail distribution. The estimators to be presented are very simple, they use only limited information on the traffic characteristics. the properties of these bounds are performed and are also compared by the accuracy and the regions of parameters where they overperform each other. Finally, we present a possibly tighter upper bounds for the tail distribution using more accurate approximations