Network heavy traffic modeling using α-stable self-similar processes

@article{citeulike:2284573, abstract = {We propose a new model for network heavy traffic approximation, based on \α-stable self-similar processes, namely the skewed linear fractional stable noise. The model demonstrates more flexibility than existing models in fitting different levels of burstiness and correlation in the data. Nonetheless, it is parsimonious in the number of parameters, which have a direct physical meaning. An algorithmic procedure for the estimation of the model parameters is presented, and an asymptotic lower bound of the residual queueing distribution is derived. Extensive simulations are presented, where the new model is fitted to bursty Ethernet data collected at Bellcore (now Telcordia) Laboratories. Furthermore, new measurements of aggregate Web and Webcasting traffic are introduced along with traffic generated by the fitted new model. Queueing simulations of a G/D/1 system confirm our analytical results regarding the tail of the queue distribution}, author = {Karasaridis, A. and Hatzinakos, D. }, booktitle = {Communications, IEEE Transactions on}, citeulike-article-id = {2284573}, doi = {10.1109/26.935161}, journal = {Communications, IEEE Transactions on}, keywords = {network, probability, traffic}, number = {7}, pages = {1203--1214}, posted-at = {2008-01-24 12:07:37}, priority = {2}, title = {Network heavy traffic modeling using \α-stable self-similar processes}, url = {http://dx.doi.org/10.1109/26.935161}, volume = {49}, year = {2001} }

TY - JOUR ID - citeulike:2284573 L3 - citeulike-article-id:2284573 TI - Network heavy traffic modeling using α-stable self-similar processes T2 - Communications, IEEE Transactions on JF - Communications, IEEE Transactions on VL - 49 IS - 7 SP - 1203 EP - 1214 N2 - We propose a new model for network heavy traffic approximation, based on α-stable self-similar processes, namely the skewed linear fractional stable noise. The model demonstrates more flexibility than existing models in fitting different levels of burstiness and correlation in the data. Nonetheless, it is parsimonious in the number of parameters, which have a direct physical meaning. An algorithmic procedure for the estimation of the model parameters is presented, and an asymptotic lower bound of the residual queueing distribution is derived. Extensive simulations are presented, where the new model is fitted to bursty Ethernet data collected at Bellcore (now Telcordia) Laboratories. Furthermore, new measurements of aggregate Web and Webcasting traffic are introduced along with traffic generated by the fitted new model. Queueing simulations of a G/D/1 system confirm our analytical results regarding the tail of the queue distribution KW - network KW - probability KW - traffic AU - Karasaridis, A AU - Hatzinakos, D PY - 2001/// UR - http://dx.doi.org/10.1109/26.935161 ER -