or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Sample-Path Analysis of Queueing Systems (International Series in Operations Research & Management Science)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Sample-Path Analysis of Queueing Systems (International Series in Operations Research & Management Science) [Hardcover]

Muhammad El-Taha (Author), Shaler Stidham Jr. (Author)

List Price: $229.00
Price: $131.73 & this item ships for FREE with Super Saver Shipping. Details
You Save: $97.27 (42%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 2 left in stock--order soon (more on the way).
Want it delivered Wednesday, February 1? Choose One-Day Shipping at checkout. Details

Book Description

International Series in Operations Research & Management Science August 31, 1998
Sample-Path Analysis of Queueing Systems uses a deterministic (sample-path) approach to analyze stochastic systems, primarily queueing systems and more general input-output systems. Among other topics of interest it deals with establishing fundamental relations between asymptotic frequencies and averages, pathwise stability, and insensitivity. These results are utilized to establish useful performance measures. The intuitive deterministic approach of this book will give researchers, teachers, practitioners, and students better insights into many results in queueing theory. The simplicity and intuitive appeal of the arguments will make these results more accessible, with no sacrifice of mathematical rigor. Recent topics such as pathwise stability are also covered in this context. The book consistently takes the point of view of focusing on one sample path of a stochastic process. Hence, it is devoted to providing pure sample-path arguments. With this approach it is possible to separate the issue of the validity of a relationship from issues of existence of limits and/or construction of stationary framework. Generally, in many cases of interest in queueing theory, relations hold, assuming limits exist, and the proofs are elementary and intuitive. In other cases, proofs of the existence of limits will require the heavy machinery of stochastic processes. The authors feel that sample-path analysis can be best used to provide general results that are independent of stochastic assumptions, complemented by use of probabilistic arguments to carry out a more detailed analysis. This book focuses on the first part of the picture. It does however, provide numerous examples that invoke stochastic assumptions, which typically are presented at the ends of the chapters.

Editorial Reviews

Review

` ... it contains a wealth of useful material for those giving courses in stochastic processes at all levels, and its extremely readable style makes it suitable for anyone with previous exposure to basic probability and stochastic processes.' Short Book Reviews, 19:2 (1999) `... this monograph is well written, fairly comprehensive and a welcome addition to the growing number of books on queuing theory. It is of interest to a wide audience of operations researchers, applied probabilists and engineers.' Mathematical reviews, 2002d

Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
First Sentence:
Studying the properties of one realization (sample path) of a stochastic process often leads to a better and deeper understanding of the properties of the system under study. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
full busy period, limiting average number, infinite server model, ith output stream, random marked point processes, pathwise stability, original point process, pathwise analysis, define the following limits, workload process, arrivals see time averages, bivariate sequence, arrival theorem, kth arrival, backward recurrence time, virtual waiting time, busy cycle, queueing systems, fluid versions, multiserver queues, average sojourn time, particular sample path, ith stream, current time slot, simple point process
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Fundamental Lemma of Maxima, Inverse Rate Formula
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Search Inside This Book:




Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject