Abstract
This paper presents a new self-similar traffic model derived from the arrival processes of M/G/∞ queue. It has a structure similar to that of a fractional ARIMA, with a driven process of fBm (fractional Brownian motion). The coefficients of the fBm are derived from the Pareto distribution of the active periods of the arrival process. When applied to a single server with self-similar input, the model results in an explicit buffer level equation which matches Norros’ storage model. So this method can be also served as a verification of Norros’ assumptions. The effectiveness of the proposed model has been verified by some practical examples.
Chapter PDF
Similar content being viewed by others
References
O. Narayan, “Exact Asymptotic Queue Length Distribution for Fractional Brownian Traffic,”, Advance in Performance Analysis, vol.1, pp. 39–63, no. 1, Oct. 1998.
L. Massoulie and A. Simonian, “Large Buffer Asymptotics for the Queue with FBM Input,”, unpulished, 1998.
W. E. Leland, M. S. Taqqu, W. W.llinger,, and D. V. Wilson. On the self-similar nature of ethernet traffic. IEEE/ACM Transactions on Networking, vol. 2: 1–14, March 1994.
I. Norros. A storage model with self-similar input. Queueing Systems, vol. 16: 387–396, 1994.
N. G. Duffield. Large deviatioins and overflow probabilities for the general single-server queue, with applications. Math. Proc. Camb. Phil. Soc., vol. 118: 363–374, 1995.
W. Stallings. Self-similarity upsets data traffic assumptions. IEEE Spectrum, vol. 34: 28–29, 1997.
B. Tsybakov and N. D. Georganas. Overflow probability in an atm queue with self-similar traffic. In ICC’97, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Daut, D.G., Yu, M. (2000). A New Self-Similar Traffic Model and Its Applications in Telecommunication Networks. In: Tsang, D.H.K., Kühn, P.J. (eds) Broadband Communications. BC 1999. IFIP — The International Federation for Information Processing, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35579-5_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-35579-5_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4685-3
Online ISBN: 978-0-387-35579-5
eBook Packages: Springer Book Archive