Showing papers by "József Bíró published in 1999"
05 Dec 1999
TL;DR: A novel approach to calculate tighter delay bounds than given in the former works of Parekh et al. (1993, 1994) is introduced, which not only allows better utilization of networks resources but supports basis for arbitrary weighting of sessions.
Abstract: This paper is concerned with GPS-based packet schedulers which are very important elements of guaranteed QoS networks. After recalling the basic properties of generalized processor sharing we introduce a novel approach to calculate tighter delay bounds than given in the former works of Parekh et al. (1993, 1994). This not only allows better utilization of networks resources but supports basis for arbitrary weighting of sessions. An efficient and numerically inexpensive algorithm for computing these bounds is also presented herein. Further we relax the rate-proportional weighting constraint and show that our delay bound calculation is applicable for any arbitrary (nonrate-proportional) weighted GPS system. Numerical examples demonstrate the flexibility of our algorithm in terms of adjusting delay and bandwidth easily between theoretical bounds. This approach is a very important step towards avoiding bandwidth-delay coupling which is a well-known problem of GPS-based rate-proportional servers.
25 citations
06 Jun 1999
TL;DR: The paper shows simple estimators which are based on Hoeffding's (1963) statistical inequalities for tail distribution, which use only limited information on the traffic characteristics and presents a possibly tighter upper bounds for the tail distribution using more accurate approximations.
Abstract: 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.
3 citations