A robust method for fitting the (/spl sigma//spl I.oarr/, /spl rho//spl I.oarr/) model to a traffic source
A communication network, which offers a deterministic QoS guarantee to VBR traffic sources, must use a traffic regulation scheme to reserve network resources for each source. The key component of a traffic regulation scheme is the traffic characterization model used to characterize the traffic of ea...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A communication network, which offers a deterministic QoS guarantee to VBR traffic sources, must use a traffic regulation scheme to reserve network resources for each source. The key component of a traffic regulation scheme is the traffic characterization model used to characterize the traffic of each source. The (/spl sigma//spl I.oarr/, /spl rho//spl I.oarr/)model is so far the most popular traffic model used in communication networks. In order to achieve high network utilization, parameters of the traffic model should be selected carefully, such that the model specifies the actual traffic as accurately as possible. We present a novel method for selecting the parameters of a (/spl sigma//spl I.oarr/, /spl rho//spl I.oarr/)model for a VBR traffic source. Our method strives for accuracy, implementation simplicity and execution speed as the design goals. Our approach consists of two parts: 1) constructing the empirical envelope of the source from the traffic, and 2) finding the model parameters from the empirical envelope. We present novel solutions for these two problems. Our method for constructing the empirical envelope is faster and more accurate than the presently existing methods and can be employed in real-time applications. Our method for finding the (/spl sigma//spl I.oarr/, /spl rho//spl I.oarr/)model parameters from the empirical envelope is based on the 'divide and conquer' and sequential programming optimization techniques, and finds a near optimum result. The performance and accuracy of our methods were experimentally compared to other available methods. The results showed that the overall performance, specifically the speed and the accuracy of our methods, are significantly better than the current methods found in the literature. |
---|---|
DOI: | 10.1109/ITRE.2003.1270609 |