Abstract

In guaranteed Quality of Service (QoS) packet networks like future QoS Internet quantifying resource usage is a key issue for traffic management. Within this the estimated bandwidth requirements of traffic flows are apparently important building blocks of decisions made by connection admission control, QoS routing and resource reservation protocols. This paper focuses on bandwidth requirement estimators under the framework of bufferless fluid flow multiplexing (bffm) which is a suitable modeling approach for scenarios with high network utilization with large number of traffic flows multiplexed. The bandwidth requirement estimates proposed have acceptable accuracy and are parsimonious, that is they need very few pieces of information on traffic flows which are either measurable in straightforward manner or known a priori and propagated through the nodes of networks. These properties are essential for efficient implementations.

Keywords: QoS; Bufferless multiplexing; Bandwidth requirement estimators

Article Outline

1. Introduction

2. Bufferless fluid flow multiplexing

3. Approximations of probability generating function (PGF)

3.1. Approximations based on Hoeffding’s result

3.2. An improved Hoeffding-type approximation

3.3. A new PGF approximation based on stochastic ordering

4. Computationally feasible approximations of equivalent capacities

4.1. Refined P_sat and WLR approximations based on Bahadur and Rao’s results

4.2. Equivalent capacity estimators

5. Numerical examples and comparisons

5.1. Comparison of PGF approximations

5.2. Comparison of bandwidth requirement estimates

6. Conclusions

Acknowledgements

References

Vitae