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

Skip to content

HEAVY TRAFFIC ANALYSIS OF CONTROLLED AND UNCONTROLLED QUEUEING AND COMMUNICATIONS NETWORK

HEAVY TRAFFIC ANALYSIS OF CONTROLLED AND UNCONTROLLED QUEUEING AND COMMUNICATIONS NETWORK

HEAVY TRAFFIC ANALYSIS OF CONTROLLED AND UNCONTROLLED QUEUEING AND
Stock photo: cover may vary

HEAVY TRAFFIC ANALYSIS OF CONTROLLED AND UNCONTROLLED QUEUEING AND COMMUNICATIONS NETWORK Hardback - 2001

by KUSHNER, HAROLD J.,

Add to wish list
  • Used
  • Hardback
  • first
New

Description

Springer, 2001. 1st. Hardcover. UsedLikeNew/UsedLikeNew.
Ask the seller a question Add to wish list
A$65.81
A$29.25 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from DELHI BOOK STORE (Delhi, India)

Details

About DELHI BOOK STORE Delhi, India

Biblio member since 2007

Our prime concern is to make books available with its extensive choices of titles on all subjects for medicine, engineers, technocrats, corporates, scientists, academics, students, scholars and many more at attractive price range.

Terms of Sale: BOOKS CAN BE RETURNED IF IT IS UNOPENED OR SHRINK WRAP IS NOT BROKEN.

Browse books from DELHI BOOK STORE

Reader reviews for HEAVY TRAFFIC ANALYSIS OF CONTROLLED AND UNCONTROLLED QUEUEING AND COMMUNICATIONS NETWORK

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-