Skip to main content

Limit utilization and wait time distributions

  • Chapter
Exercises in Computer Systems Analysis

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

  • 208 Accesses

Abstract

In this chapter, two final problems are discussed. The first problem is the relation between the probabilities for the imbedded chain and for any time t. It is sufficient to study this problem with respect to the limit probabilities only, since these are intended for application.

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

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Everling, W. (1975). Limit utilization and wait time distributions. In: Exercises in Computer Systems Analysis. Lecture Notes in Computer Science, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021174

Download citation

  • DOI: https://doi.org/10.1007/BFb0021174

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07401-4

  • Online ISBN: 978-3-540-37910-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics