Large Deviations for Gaussian Queues: Modelling Communication Networks / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$134.58
Used and New from Other Sellers
Used and New from Other Sellers
from $110.87
Usually ships in 1-2 business days
(Save 26%)
Other sellers (Hardcover)
  • All (11) from $110.87   
  • New (9) from $110.87   
  • Used (2) from $134.57   

Overview

In recent years the significance of Gaussian processes to communication networks has grown considerably. The inherent flexibility of the Gaussian traffic model enables the analysis, in a single mathematical framework, of systems with both long-range and short-range dependent input streams.

Large Deviations for Gaussian Queues demonstrates how the Gaussian traffic model arises naturally, and how the analysis of the corresponding queuing model can be performed. The text provides a general introduction to Gaussian queues, and surveys recent research into the modelling of communications networks. Coverage includes:

  • Discussion of the theoretical concepts and practical aspects related to Gaussian traffic models.
  • Analysis of recent research asymptotic results for Gaussian queues, both in the large-buffer and many-sources regime.
  • An emphasis on rare-event analysis, relying on a variety of asymptotic techniques.
  • Examination of single-node FIFO queuing systems, as well as queues operating under more complex scheduling disciplines, and queuing networks.
  • A set of illustrative examples that directly relate to important practical problems in communication networking.
  • A large collection of instructive exercises and accompanying solutions.

Large Deviations for Gaussian Queues assumes minimal prior knowledge. It is ideally suited for postgraduate students in applied probability, operations research, computer science and electrical engineering. The book’s self-contained style makes it perfect for practitioners in the communications networking industry and for researchers in related areas.

Read More Show Less

Editorial Reviews

From the Publisher

"The book maybe useful for specialists connected with queuing theory and working in applied probability." (Zentralblatt MATH, 2008)

Read More Show Less

Product Details

  • ISBN-13: 9780470015230
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 6/19/2007
  • Edition number: 1
  • Pages: 336
  • Product dimensions: 6.42 (w) x 9.21 (h) x 0.93 (d)

Meet the Author

Michel Mandjes, Centre for Mathematics and Computer Science (CWI) Amsterdam, The Netherlands, and Professor, Faculty of Engineering, University of Twente.
At CWI Mandjes is a senior researcher and Director of the Advanced Communications Network group.  He has published for 60 papers on queuing theory, networks, scheduling, and pricing of networks.

Read More Show Less

Table of Contents

Preface and acknowledgments.

1 Introduction.

Part A: Gaussian traffic and large deviations.

2 The Gaussian source model.

2.1 Modeling network traffic.

2.2 Notation and preliminaries on Gaussian random variables.

2.3 Gaussian sources.

2.4 Generic examples-long-range dependence and smoothness.

2.5 Other useful Gaussian source models.

2.6 Applicability of Gaussian source models for network traffic.

3 Gaussian sources: validation, justification.

3.1 Validation.

3.2 Convergence of on-off traffic to a Gaussian process.

4 Large deviations for Gaussian processes.

4.1 Cramèr's theorem.

4.2 Schilder's theorem.

Part B: Large deviations of Gaussian queues.

5 Gaussian queues: an introduction.

5.1 Lindley's recursion, the steady-state buffer content.

5.2 Gaussian queues.

5.3 Special cases: Brownian motion and Brownian bridge.

5.4 A powerful approximation.

5.5 Asymptotics.

5.6 Large-buffer asymptotics.

6 Logarithmic many-sources asymptotics.

6.1 Many-sources asymptotics: the loss curve.

6.2 Duality between loss curve and variance function.

6.3 The buffer-bandwidth curve is convex.

7 Exact many-sources asymptotics.

7.1 Slotted time: results.

7.2 Slotted time: proofs.

7.3 Continuous time: results.

7.4 Continuous time: proofs.

8 Simulation.

8.1 Determining the simulation horizon.

8.2 Importance sampling algorithms.

8.3 Asymptotic efficiency.

8.4 Efficient estimation of the overflow probability.

9 Tandem and priority queues.

9.1 Tandem: model and preliminaries.

9.2 Tandem: lower bound on the decay rate.

9.3 Tandem: tightness of the decay rate.

9.4 Tandem: properties of the input rate path.

9.5 Tandem: examples.

9.6 Priority queues.

10 Generalized processor sharing.

10.1 Preliminaries on GPS.

10.2 Generic upper and lower bound on the overflow probability.

10.3 Lower bound on the decay rate: class 2 in underload.

10.4 Upper bound on the decay rate: class 2 in underload.

10.5 Analysis of the decay rate: class 2 in overload.

10.6 Discussion of the results.

10.7 Delay asymptotics.

11 Explicit results for short-range dependent inputs.

11.1 Asymptotically linear variance; some preliminaries.

11.2 Tandem queue with srd input.

11.3 Priority queue with srd input.

11.4 GPS queue with srd input.

11.5 Concluding remarks.

12 Brownian queues.

12.1 Single queue: detailed results.

12.2 Tandem: distribution of the downstream queue.

12.3 Tandem: joint distribution.

Part C: Applications.

13 Weight setting in GPS.

13.1 An optimal partitioning approach to weight setting.

13.2 Approximation of the overflow probabilities.

13.3 Fixed weights.

13.4 Realizable region.

14 A link dimensioning formula and empirical support.

14.1 Objectives, modeling, and analysis.

14.2 Numerical study.

14.3 Empirical study.

14.4 Implementation aspects.

15 Link dimensioning: indirect variance estimation.

15.1 Theoretical foundations.

15.2 Implementation issues.

15.3 Error analysis of the inversion procedure.

15.4 Validation.

16 A framework for bandwidth trading.

16.1 Bandwidth trading.

16.2 Model and preliminaries.

16.3 Single-link network.

16.4 Gaussian traffic; utility as a function of loss.

16.5 Sanov's theorem and its inverse.

16.6 Estimation of loss probabilities.

16.7 Numerical example.

Bibliography.

Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)