BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Heavy Traffic Analysis of Controlled Queueing and Communication Networks (Stochastic Modelling and Applied Probability, 47)

Heavy Traffic Analysis of Controlled Queueing and Communication Networks (Stochastic Modelling and Applied Probability, 47)

Heavy Traffic Analysis of Controlled Queueing and Communication Networks
Stock photo: cover may vary

Heavy Traffic Analysis of Controlled Queueing and Communication Networks (Stochastic Modelling and Applied Probability, 47) Hardback - 2001

by Kushner, Harold

Add to wish list
  • Used
  • Hardback
Used: Good

Description

Springer, 2001-06-08. 2001. hardcover. Used: Good. 6.14x1.19x9.21. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$68.82
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Heavy Traffic Analysis of Controlled Queueing and Communication Networks (Stochastic Modelling and Applied Probability, 47)

From the publisher

There is great difficulty in solving the bulk of basic queueing problems without the use of the heavy traffic or some similar asymptotic approach. There is a wide range of applications in manufacturing, computer and communications networks, general queueing networks, assignment and scheduling etc. By bringing some of the latest methods to the attention of researchers in this timely and important area this comprehensive book should capture a broad audience.

First line

Example 1.1. A Simple Single Queue. In order to illustrate the idea of the diffusion approximation with minimal notation and in a way that allows us to relate it to the central limit theorem, let us start by considering a queueing problem with a single server, where the arrivals and service completions can take place at the integer times 0, 1, 2, . . . only.
tracking-