did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9781848001268

Stochastic Network Calculus

by ;
  • ISBN13:

    9781848001268

  • ISBN10:

    1848001266

  • Format: Hardcover
  • Copyright: 2008-09-23
  • Publisher: Springer-Verlag New York Inc

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $99.99 Save up to $81.43
  • Buy Used
    $74.99
    Add to Cart Free Shipping Icon Free Shipping

    USUALLY SHIPS IN 2-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

Network calculus, a theory dealing with queuing systems found in computer networks, focuses on performance guarantees. The development of an information theory for stochastic service-guarantee analysis has been identified as a grand challenge for future networking research. Towards that end, stochastic network calculus, the probabilistic version or generalization of the (deterministic) Network Calculus, has been recognized by researchers as a crucial step.Stochastic Network Calculus presents a comprehensive treatment for the state-of-the-art in stochastic service-guarantee analysis research and provides basic introductory material on the subject, as well as discusses the most recent research in the area. This helpful volume summarizes results for stochastic network calculus, which can be employed when designing computer networks to provide stochastic service guarantees.Features and Topics:'¢ Provides a solid introductory chapter, providing useful background knowledge'¢ Reviews fundamental concepts and results of deterministic network calculus'¢ Includes end-of-chapter problems, as well as summaries and bibliographic comments'¢ Defines traffic models and server models for stochastic network calculus'¢ Summarizes the basic properties of stochastic network calculus under different combinations of traffic and server models'¢ Highlights independent case analysis'¢ Discusses stochastic service guarantees under different scheduling disciplines'¢ Presents applications to admission control and traffic conformance study using the analysis results'¢ Offers an overall summary and some open research challenges for further study of the topicKey Topics: '¢ Queuing systems'¢ Performance analysis and guarantees '¢ Independent case analysis '¢ Traffic and server models '¢ Analysis of scheduling disciplines '¢ Generalized processor sharing '¢ Open research challengesResearchers and graduates in the area of performance evaluation of computer communication networks will benefit substantially from this comprehensive and easy-to-follow volume. Professionals will also find it a worthwhile reference text.Professor Yuming Jiang at the Norwegian University of Science and Technology (NTNU) has lectured using the material presented in this text since 2006.Dr Yong Liu works at the Optical Network Laboratory, National University of Singapore, where he researches QoS for optical communication networks and Metro Ethernet networks.

Author Biography

Yong Liu works at the Optical Network Laboratory, National University of Singapore. Yuming Jiang is Professor at the Norwegian University of Science and Technology (NTNU).

Table of Contents

Prefacep. vii
List of Figuresp. xvii
List of Tablesp. xix
Introductionp. 1
Quality of Service Guaranteesp. 2
Basic Properties for Network Analysisp. 3
Notation and Mathematical Backgroundp. 6
Notationp. 6
Min-Plus Algebra Basicsp. 8
Maximum Horizontal Distance and Maximum Vertical Distancep. 10
Random Variable and Stochastic Process Basicsp. 10
Random Variablesp. 10
Stochastic Processesp. 13
Stochastic Orderingp. 13
Min-Plus Linearity of Queuing Systemsp. 15
Summary and Bibliographic Commentsp. 16
Problemsp. 17
Deterministic Network Calculusp. 19
Traffic Modelsp. 19
([sigma],[rho]) Traffic Characterizationp. 19
Arrival Curvep. 20
Envelope Processp. 22
Server Modelsp. 23
Service Curvep. 23
Network Elements Offering Service Curvesp. 24
Strict Service Curvep. 26
Service Envelope Processp. 26
Basic Resultsp. 27
Service Guaranteesp. 28
Output Characterizationp. 30
Concatenation Propertyp. 31
Leftover Servicep. 33
Superpositionp. 34
Example: Analysis of a Network of Arbitrary Topologyp. 34
Summary and Bibliographic Commentsp. 36
Problemsp. 37
Traffic Models for Stochastic Network Calculusp. 41
([sigma]([theta], [rho]([theta])) Traffic Characterizationp. 41
t.a.c. Stochastic Arrival Curvep. 42
Difficulties and Additional Constraintsp. 45
v.b.c. Stochastic Arrival Curvep. 48
m.b.c. Stochastic Arrival Curvep. 53
[theta]-m.b.c. Stochastic Arrival Curvep. 56
Stochastic Envelope Processp. 57
Summary and Bibliographic Commentsp. 60
Problemsp. 63
Server Models for Stochastic Network Calculusp. 65
Weak Stochastic Service Curvep. 65
Stochastic Service Curvep. 66
[theta]-Stochastic Service Curvep. 68
Stochastic Strict Service Curvep. 69
Stochastic Strict Server due to Impairmentp. 71
Service Envelope Processp. 74
Latency Rate Characterizationp. 76
Relationship with ([sigma]([theta]), [rho]([theta])) Traffic Characterizationp. 77
Summary and Bibliographic Commentsp. 78
Problemsp. 79
Basic Properties of Stochastic Network Calculusp. 83
Service Guaranteesp. 83
Backlog Boundp. 83
Delay Boundp. 85
Output Characterizationp. 88
Output t.a.c Stochastic Arrival Curvep. 88
Output v.b.c. Stochastic Arrival Curvep. 90
Output m.b.c Stochastic Arrival Curvep. 93
Output [theta]-m.b.c. Stochastic Arrival Curvep. 96
Concatenation Propertyp. 97
Leftover Service Characterizationp. 101
Leftover Weak Stochastic Service Curvep. 101
Leftover Stochastic Service Curvep. 102
Leftover [theta]-Stochastic Service Curvep. 105
Superposition Propertyp. 107
Scaling of End-to-End Delay Boundp. 109
Delay Bound From the Concatenation Propertyp. 110
Delay Bound from Node-by-Node Analysisp. 111
Calculus on Traffic and Service Envelope Processesp. 112
Summary and Bibliographic Commentsp. 114
Problemsp. 116
Independent Case Analysisp. 119
Introductionp. 119
Analysis Based on Stochastic Strict Serverp. 121
Backlog and Delay Boundsp. 122
Output Characterizationp. 124
Concatenation Propertyp. 128
Leftover Service Characterizationp. 130
Superposition Propertyp. 133
Scaling of End-to-End Delay Boundp. 134
Calculus with Moment Generating Functionsp. 136
Moment Generating Function Basicsp. 136
Basic Properties and Performance Boundsp. 138
Summary and Bibliographic Commentsp. 141
Problemsp. 142
Analysis on Scheduling Disciplinesp. 145
Introduction to gSBBp. 145
Properties of gSBBp. 148
Analysis on Different Scheduling Disciplinesp. 150
General Resultsp. 151
First In First Out (FIFO)p. 152
Strict Priority (SP)p. 153
Generalized Processor Sharing (GPS)p. 154
Application to Measurement-Based Admission Controlp. 155
Introduction to MBACp. 156
Introduction to Flow-Aware Networkingp. 157
Dynamic Priority Scheduling-Based MBACp. 158
Analysisp. 160
Summary and Bibliographic Commentsp. 163
Problemsp. 164
Traffic Conformance Studyp. 165
Network Modelp. 166
Conformance Deterioration and Stochastic Burstiness Increasep. 167
Property of Token Bucket Shaperp. 168
Conformance Study of Per-Flow Scheduling Networkp. 169
Single-Node Casep. 169
Multi-node Casep. 170
Conformance Study of Aggregate Scheduling Networkp. 171
Per-Flow in Single-Node Casep. 171
Per-Flow in Multi-node Casep. 176
Per-Aggregate Casep. 178
Simulation Resultsp. 179
Per-Flow Scheduling Network in Single-Node Casep. 179
Aggregate Scheduling Network in Single-Node Casep. 182
Aggregate Scheduling Network in Multi-node Casep. 183
Summary and Bibliographic Commentsp. 185
Problemsp. 187
LRD Isolation in Generalized Processor Sharingp. 189
Introductionp. 190
GPS Fundamentalsp. 190
LRD Traffic Characterizationp. 191
LRD Isolation of Flowsp. 192
Analysis of LRD Trafficp. 193
Single Arrival Processp. 193
Aggregate Processp. 196
Sample Path Behavior of LRD Traffic in a GPS Systemp. 199
GPS Decompositionp. 199
A General Boundp. 200
An Alternate Boundp. 201
Technique to Check and Ensure LRD Isolationp. 202
Limitations of Existing Methodsp. 203
Necessary and Sufficient Conditionp. 205
Weight Adjustment and Assignmentp. 206
Sample Path Behavior of LRD Traffic in a PGPS Systemp. 208
Summary and Bibliographic Commentsp. 211
Problemsp. 212
Open Research Challengesp. 213
Applicability Condition Study of Stochastic Network Calculusp. 214
Advanced Propertiesp. 215
Network Information Theory for the Internetp. 217
Referencesp. 219
Indexp. 227
Table of Contents provided by Ingram. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program