
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Quantifying Resource Usage: A Large DeviationBased Approach
Gergely SERES Arpad SZLAVIK Janos ZATONYI Jozsef BíRO
Publication
IEICE TRANSACTIONS on Communications
Vol.E85B
No.1
pp.2534 Publication Date: 2002/01/01
Online ISSN:
DOI:
Print ISSN: 09168516 Type of Manuscript: INVITED PAPER (Special Issue on Internet Technology II  Traffic Control and Performance Evaluation in the Internet) Category: Keyword: QoS, effective bandwidth, Internet, large deviation theory, many sources asymptotics,
Full Text: PDF>>
Summary:
The provisioning of QoS in the Internet is gaining an increasing attention, thus the importance of methods capable of estimating the bandwidth requirement of traffic flows is constantly growing. This information can be used for a wide range of purposes. Admission control, QoS routing and load sharing all need the same basic information in order to be able to make decisions. This paper describes a number of methods that can be used to arrive at precise estimates of the bandwidth requirement focusing on those that are based on the theory of large deviations. A methodology is presented that allows the reformulation of earlier solutions based on the estimation of some form of an overflow probability so that their output becomes a bandwidthtype quantity, the format preferred by Internet control applications. The methodology provides two tracks for the conversion: an indirect method that encapsulates the overflow probabilitytype approach as an embedded calculation and a direct method that immediately results in the estimate of the bandwidth requirement. The paper introduces a novel method for the direct computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotic regime of the large deviation theory. The direct bandwidth estimator method reduces the computational complexity of the calculations, since it results directly in the bandwidth requirement, allowing the omission of the frequent and costly computation of the buffer overflow probability. The savings arising from the reduction in computational complexity are demonstrated in a numerical example.

