Skip to main content

Evaluation of Steady-State Probability of Pareto/M/1/K Experiencing Tail-Raising Effect

  • Conference paper
High-Speed Networks and Multimedia Communications (HSNMC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2720))

Abstract

To resolve the problem of evaluating for the steady-state probability of Pareto/M/1/K showing the tail-raising effect, we propose an empirical model of the steady-state probability and justified by evaluating the mean queue length and delay by simulations.

This work was supported in part by the Korea Science and Engineering Foundation (KOSEF) through the Ultrafast Fiber-Optic Networks Research Center at Kwangju Institute of Science and Technology (KJIST), Gwangju, 500-712, Korea.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Harris, C.M., Brill, P.H., Fischer, M.J.: Internet-type queues with heavytailed interarrival times and computational methods for their analysis. INFORMSJournal on Computing 12(4), 261–271 (2000)

    Article  Google Scholar 

  2. Choi, B.D., Kim, B., Wee, I.S.: Asymptotic behavior of loss probability inGI/M/1/K queue as K tends to infinity, Queueing Systems, vol. 36, pp. 437–442 (2000)

    Google Scholar 

  3. Koh, Y., Kim, K.: Loss probability behavior of Pareto/M/1/K queue. IEEE Communications Letters 7, 39–41 (2003)

    Article  Google Scholar 

  4. Devadhar, S.Y., Gerla, M., Yu, J.: The significance of finite buffer edge effects in histogram measurements of queues. Telecommunication Systems, 177–193 (2001)

    Google Scholar 

  5. Bolch, G., Greiner, S., Meer, H., Trivedi, S.: Queueing Networks and MarkovChains: Modeling and Performance Evaluation with Computer Science Application. John Wiley & Sons, Chichester (1998)

    Google Scholar 

  6. Gordon, J.: Pareto process as a model of self-similar packet traffic. IEEE GLOBECOM 3, 2232–2235 (1995)

    Google Scholar 

  7. Kreyszig, E.: Advanced engineering mathematics. 4th edn. John Wiley & Sons, Chichester (1976)

    Google Scholar 

  8. Wall, L., Christiansen, T., Schwartz, R.L.: Programming Perl. 2nd edn. O‘Reilly (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koh, Y., Kim, K. (2003). Evaluation of Steady-State Probability of Pareto/M/1/K Experiencing Tail-Raising Effect. In: Freire, M.M., Lorenz, P., Lee, M.MO. (eds) High-Speed Networks and Multimedia Communications. HSNMC 2003. Lecture Notes in Computer Science, vol 2720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45076-4_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45076-4_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40542-9

  • Online ISBN: 978-3-540-45076-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics