Stock photo: cover may vary
Heavy Traffic Analysis of Controlled Queueing and Communication Networks Hardback -
by Harold Kushner
- New
- Hardback
A$64.48
A$5.82
Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Standard delivery: 9 to 14 days
Ships from Cold Books (New York, United States)
Details
- Title Heavy Traffic Analysis of Controlled Queueing and Communication Networks
- Author Harold Kushner
- Binding Hardback
- Edition Us Edition
- Condition New
- Pages 515
- Volumes 1
- Language ENG
- Publisher Springer , New York
- Publication date pp. 540
- Illustrated Yes
- Features Bibliography, Illustrated, Index
- Bookseller's Inventory # 6283938
- ISBN 9780387952642 / 0387952640
- Weight 2.04 lbs (0.93 kg)
- Dimensions 9.21 x 6.14 x 1.19 in (23.39 x 15.60 x 3.02 cm)
- Category Mathematics
- Library of Congress subjects Queuing theory
- Library of Congress Catalogue Number 2001020202
- Dewey Decimal Code 519.2
- Quantity available 4
About Cold Books New York, United States
Reader reviews for Heavy Traffic Analysis of Controlled Queueing and Communication Networks
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
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.
