Fundamentals of Queuing Networks and over one million other books are available for Amazon Kindle. Learn more


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
Fundamentals of Queueing Networks
 
 
Start reading Fundamentals of Queuing Networks on your Kindle in under a minute.

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

Fundamentals of Queueing Networks [Hardcover]

Hong Chen (Author), David D. Yao (Author)
4.3 out of 5 stars  See all reviews (3 customer reviews)

List Price: $115.00
Price: $91.73 & this item ships for FREE with Super Saver Shipping. Details
You Save: $23.27 (20%)
  Special Offers Available
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 9 left in stock--order soon (more on the way).
Want it delivered Thursday, February 2? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $82.56  
Hardcover $91.73  

Book Description

0387951660 978-0387951669 June 15, 2001 1
This accessible book aims to collect in a single volume the essentials of stochastic networks. Stochastic networks have become widely used as a basic model of many physical systems in a diverse range of fields. Written by leading authors in the field, this book is meant to be used as a reference or supplementary reading by practitioners in operations research, computer systems, communications networks, production planning, and logistics.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Customers Who Bought This Item Also Bought


Editorial Reviews

Review

From the reviews:

SIAM REVIEW

"To summarize, this text gives well-organized and clearly written introduction to stochastic networks, as well as a complete description of some aspects of current work on these problems. It will probably appeal more to mathematicians than to engineers, especially ones interested in the theoretical aspects of diffusion and fluid approximations to complicated queuing networks. Where possible, the authors illustrate the basic concepts on a simpler form of the model, and the exercises are well chosen. The text is quite free of errors."

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION

"The book attains the authors’ goal of producing a systematic exposition of the essentials of the theory of queuing networks…It is an excellent reference, well organized and clearly exposited."

"The Focus of Fundamentals of Queuing Networks (FQN) is on queuing networks. Both authors … are leading researchers in this field. … they manage to explain all the essential results in a sufficient amount of detail. … FQN is designed to be a textbook, and I think, the authors have been successful on that. … this book seems to be the most accessible one for students." (Bert Zwart, Operations Research Letters, Vol. 33, 2005)

"The book stems essentially from the lecture notes which where accumulated over many years of teaching graduate-level courses on stochastic networks by the authors … . Its main objective is to collect, in one single-volume, the essentials of stochastic networks. … this book is intended also to serve as a useful reference for teachers, researchers, and students alike in many of these diverse fields." (H. M. Srivastava, MathSciNet, April, 2004)

"The book attains the author’s goal of producing a systematic exposition of the essentials of the theory of queuing networks. Starting from Jackson networks, it weaves in essential threads of the theory … . It is an excellent reference, well organized and clearly exposited." (Alan F. Karr, Journal of the American Statistical Association, December, 2002)

"This book treats stochastic networks and includes both classical results on product form networks as well as more recent work on diffusion and fluid limits, control, and optimization. The book is intended for graduate students in engineering, business, applied mathematics, and probability and statistics. ... this text gives a well-organized and clearly written introduction to stochastic networks … . Where possible, the authors illustrate the basic concepts on a simpler form of the model, and the exercises are well chosen." (Charles Knessl, SIAM-Review, Vol. 44 (3), 2002)

"Written by two leading researchers in the field of applied probability, this text covers a breadth of material on queuing networks. … I like the book. It is well written in a clear lucid style with key references provided at the end of each chapter. … For researchers in the field it provides a useful compendium of results and techniques – a superb resource book that should be in the library of such applied probabilists." (Jeffrey J. Hunter, New Zealand Mathematical Society Newsletter, Issue 82, 2002)


Product Details

  • Hardcover: 424 pages
  • Publisher: Springer; 1 edition (June 15, 2001)
  • Language: English
  • ISBN-10: 0387951660
  • ISBN-13: 978-0387951669
  • Product Dimensions: 9.3 x 6.2 x 1 inches
  • Shipping Weight: 1.6 pounds (View shipping rates and policies)
  • Average Customer Review: 4.3 out of 5 stars  See all reviews (3 customer reviews)
  • Amazon Best Sellers Rank: #452,270 in Books (See Top 100 in Books)

More About the Author

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

 

Customer Reviews

3 Reviews
5 star:
 (2)
4 star:    (0)
3 star:
 (1)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.3 out of 5 stars (3 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

4 of 5 people found the following review helpful:
5.0 out of 5 stars Excellent, August 22, 2002
By 
This review is from: Fundamentals of Queueing Networks (Hardcover)
Not suitable for a first course. Excellent for a more advanced course, or self study (with the right background). Covers lots of essential topics in nice, clear way, and contains many 'modern' topics that are difficult to find in any other single reference.

For the right person, well worth the $.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


5.0 out of 5 stars Excellent, August 22, 2002
By A Customer
This review is from: Fundamentals of Queueing Networks (Hardcover)
Not suitable for a first course. Excellent for a more advanced course, or self study (with the right background). Covers lots of essential topics in nice, clear way, and contains many 'modern' topics that are difficult to find in any other single reference.

For the right person, well worth the $.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


0 of 5 people found the following review helpful:
3.0 out of 5 stars not easy to read, April 7, 2002
By A Customer
This review is from: Fundamentals of Queueing Networks (Hardcover)
It is a textbook for a course I am taking.
I have read 28 pages. It is not easy to
read at all. It seems that the authors really want to
use as few number of words as possible. So
I have to think about and try to understand each sentence.
If I spend 1 hour on a similar other book, then I have
to spend 1.5 hour on this book for the same
amount of content.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
Let {Y(t), t 0 } denote a birth-death process, on the state space Z+ := {0, 1, 2, . . . }. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
fluid level process, oblique reflection mapping, basic adjoint relation, reflection mapping theorem, performance polytope, traffic limit theorem, myopic procedure, nth network, single station case, priority service discipline, initial fluid level, functional strong law, extended polymatroid, globally optimal allocation, service rate function, exogenous arrival rate, multiclass network, workload process, symmetric queues, multiclass queueing networks, death queue, initial queue length, total queue length, stochastic convexity, traffic equation
Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Annals of Applied Probability, Academic Press, Automatic Control, The Queueing Network Model, Annals of Probability, Kumar Seidman, Management Science, Vande Vate, Columbia University, Exponential Servers, J-dimensional Brownian, Research Division, Yorktown Hts
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




What Other Items Do Customers Buy After Viewing This Item?


Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

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



So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject