This 1987 book is a self-contained text on the probabilistic modelling method. It provides the reader with an understanding of the available results as well as with examples of their application. The only background assumed is a knowledge of basic calculus. The necessary fundamentals of probability are presented followed by an introduction to stochastic processes. The remainder of the book is devoted to the treatment of various single-station and their application to uni-programmed and multi-programmed systems and local and wide-area networks. Both exact and approximate solution methods are discussed, with as much emphasis on explaining the ideas and providing information, as on derivations and proofs. This book will still be of use for anyone with an interest in the history of computer science.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: October 1987
- format: Paperback
- isbn: 9780521314220
- length: 202 pages
- dimensions: 229 x 152 x 12 mm
- weight: 0.3kg
- availability: Available
Table of Contents
1. Introduction to probability theory
2. Stochastic processes
3. Simple queueing methods
4. General service times and different scheduling strategies
5. Queueing networks
6. Packet-switching networks
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×