Skip to main content

Self-Similar Network Traffic Modeling Using Circulant Markov Modulated Poisson Process

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 92))

Abstract

Most of the classical self-similar traffic models are asymptotic in nature. Hence, they are not suitable for queuing based performance evaluation. In this paper, we propose a model for self-similar traffic using Circulant Markov modulated Poisson process (CMMPP). This model is to match the variance of self-similar traffic and that of CMMPP over a time-scale. The resultant CMMPP consists of several two-state CMMPPs. We conclude from the numerical examples that self-similar traffic can be well represented by the proposed model.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Anderson, A.T., Nielsen, B.F.: A Markovian approach for modeling packet traffic with long range dependence. IEEE J. Sel. Area Comm. 16(5), 719–732 (1998)

    Article  Google Scholar 

  2. Crovella, M., Bestavros, A.: Self-similarity in World Wide Web traffic: evidence and possible causes. IEEE/ACM Trans. Netw. 835–846 (1997)

    Google Scholar 

  3. De Cock, K., Van Gestel, T., De Moo, B.: Identification of circulant modulated poisson process a time domain approach, Proceeding of MTNS, 739–742 (1998)

    Google Scholar 

  4. Kasahara, S.: Internet traffic modelling: Markovian approach to self-similar traffic and prediction of loss probability for finite queues, special issue on internet technology. IEICE Trans. Comm. E84-B(8), 2134–2141 (2001)

    Google Scholar 

  5. Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Trans. Netw. 2, 1–15 (1994)

    Article  Google Scholar 

  6. Paxson, V., Floyd, S.: Wide area traffic: the failure of poisson modeling. IEEE/ACM Trans. Netw. 3, 226–244 (1995)

    Article  Google Scholar 

  7. Shao, S.K., Perati, M.R., Tsai, M.G., Tsao, H.W., Wu, J.: Generalized variance-based Markovian fitting for self-similar traffic modeling. IEICE Trans. Comm. E88-B(12), 4659–4663 (2005)

    Article  Google Scholar 

  8. Yoshihara, T., Kasahara, S., Takahashi, Y.: Practical time-scale fitting of self-similar traffic with Markov-modulated Poisson process. Telecommun. Syst. 17, 185–211 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ranadheer Donthi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Donthi, R., Renikunta, R., Dasari, R., Perati, M.R. (2014). Self-Similar Network Traffic Modeling Using Circulant Markov Modulated Poisson Process. In: Bandt, C., Barnsley, M., Devaney, R., Falconer, K., Kannan, V., Kumar P.B., V. (eds) Fractals, Wavelets, and their Applications. Springer Proceedings in Mathematics & Statistics, vol 92. Springer, Cham. https://doi.org/10.1007/978-3-319-08105-2_29

Download citation

Publish with us

Policies and ethics