Internet QoS
Architectures and Mechanisms for Quality of Service
239 pages, parution le 01/03/2001
Résumé
Guaranteeing performance across the Internet may seem
nearlyimpossible, because of an even wider range of
variables that can affect and undermine service. But if
you're involved in developing and implementing streaming
video or voice or other time-sensitive Internet
applications, you already understand exactly what's at
stake in establishing Quality of Service.
What you need is a reliable guide to the latest QoS techniques written specifically to address the Internet's special challenges. Internet QoS is it-the first book to dig deep into the issues that affect your ability to provide Internet QoS to your users. This book gives you a broad vision of the problem and dozens of specific analyses designed to help you as you strive to make, and adhere to, meaningful Quality of Service guarantees.
Features
- Includes valuable insights from a Bell Labs engineer with fourteen years of experience in data networking and Internet protocol design.
- Details the enhancements to current Internet architectures and new mechanisms and network management capabilities that QoS will require.
- Focuses on the four main areas of Internet QoS: integrated services, differentiated services, multi-protocol label switching, and traffic engineering.
Contents
Chapter One: Introduction
1.1 Resource Allocation
1.1.1 Integrated
Services
1.1.2 Differentiated Services
1.2 Performance Optimization
1.1.2 Differentiated Services
1.2.1 Multi-Protocol Label
Switching
1.2.2 Traffic Engineering
1.3 Summary1.2.2 Traffic Engineering
Chapter Two: Integrated Services
2.1 Introduction
2.2 Real-Time Applications
2.3 Integrated Services Architecture
2.2 Real-Time Applications
2.3 Integrated Services Architecture
2.3.1 Basic Approach
2.3.2 Key Components
2.4 Service Models
2.3.2 Key Components
2.4.1 Flow
Specification
2.4.2 Guaranteed Service
2.4.3 Controlled Load Service
2.5 Resource Reservation Setup (RSVP)
2.4.2 Guaranteed Service
2.4.3 Controlled Load Service
2.5.1 Basic Features
2.5.2 Operation Overview
2.5.3 RSVP Messages
2.5.4 Reservation Styles
2.5.5 Adspec, OPWA and Slack Term
2.6 Flow Identification
2.5.2 Operation Overview
2.5.3 RSVP Messages
2.5.4 Reservation Styles
2.5.5 Adspec, OPWA and Slack Term
2.6.1 Basic
Requirements
2.6.2 Design Choices
2.6.3 Hashing-Based Schemes
2.6.4 Performance Evaluation
2.7 Packet Scheduling
2.6.2 Design Choices
2.6.3 Hashing-Based Schemes
2.6.4 Performance Evaluation
2.7.1 Basic
Requirements
2.7.2 Design Choices
2.7.3 Weighted Fair Queuing
2.7.4 Variants of WFQ
2.8 Integrated Services over Specific Link Layers
2.7.2 Design Choices
2.7.3 Weighted Fair Queuing
2.7.4 Variants of WFQ
2.8.1 Local Area
Networks
2.8.2 ATM Networks
2.9 Summary2.8.2 ATM Networks
Chapter Three: Differentiated Services
3.1 Introduction
3.2 Differentiated Services Framework
3.2 Differentiated Services Framework
3.2.1 Basic Approach
3.2.2 Service and Forwarding Treatment
3.2.3 Per-Hop Behaviors (PHBs)
3.2.4 Services
3.3 Differentiated Services Field
3.2.2 Service and Forwarding Treatment
3.2.3 Per-Hop Behaviors (PHBs)
3.2.4 Services
3.3.1 Structure of DS
Field
3.3.2 Historical Codepoint Definition
3.3.3 Current Codepoint Allocation
3.4 Traffic Classification and Conditioning
3.3.2 Historical Codepoint Definition
3.3.3 Current Codepoint Allocation
3.4.1 Classifier
3.4.2 Traffic Conditioner
3.4.3 Location of Traffic Classifiers and Conditioners
3.4.4 Configuring Traffic Classifiers and Conditioners
3.5 Assured Forwarding
3.4.2 Traffic Conditioner
3.4.3 Location of Traffic Classifiers and Conditioners
3.4.4 Configuring Traffic Classifiers and Conditioners
3.5.1 AF PHB Group
3.5.2 Implementation Guideline
3.5.3 Example Services
3.6 Expedited Forwarding
3.5.2 Implementation Guideline
3.5.3 Example Services
3.6.1 EF PHB
3.6.2 Implementation Guideline
3.7 Interoperability with Non-DS-Compliant Networks
3.6.2 Implementation Guideline
3.7.1 Non-DS-Compliant Node
within a DS Domain
3.7.2 Transit Non-DS-Capable Domain
3.8 Packet Classification
3.7.2 Transit Non-DS-Capable Domain
3.8.1 Basic
Requirements
3.8.2 Classification Algorithms
3.9 Traffic Policing 37
3.8.2 Classification Algorithms
3.9.1 Metering and
Marking
3.9.2 Dual Token Bucket Algorithm
3.10 End-to-End Resource Management
3.9.2 Dual Token Bucket Algorithm
3.10.1 Integrated Services
over Differentiated Services
3.10.2 Inter-Domain Bandwidth Allocation
3.10.3 End-System Congestion Control
3.11 Performance Issues in Differentiated Services
3.10.2 Inter-Domain Bandwidth Allocation
3.10.3 End-System Congestion Control
3.11.1 Network
Configuration
3.11.2 Traffic Profiles and Bottleneck Bandwidth
3.11.3 Protection from Mis-Behaving Sources
3.12 Summary3.11.2 Traffic Profiles and Bottleneck Bandwidth
3.11.3 Protection from Mis-Behaving Sources
Chapter Four: Multi-Protocol Label Switching
4.1 Introduction
4.2 Motivation
4.2 Motivation
4.2.1 IP over ATM
Integration
4.2.2 Simpler Forwarding Paradigm
4.2.3 Traffic Engineering
4.3 Overview
4.2.2 Simpler Forwarding Paradigm
4.2.3 Traffic Engineering
4.3.1 Routing vs
Switching
4.3.2 Label Switching Proposals
4.3.3 Comparison of Approaches
4.4 MPLS Architecture
4.3.2 Label Switching Proposals
4.3.3 Comparison of Approaches
4.4.1 Key Concepts
4.4.2 Forwarding Equivalency Classes
4.4.3 Hierarchy and Label Stacking
4.4.4 Label Stack Encoding
4.4.5 Loop Detection
4.5 Label Distribution Protocols
4.4.2 Forwarding Equivalency Classes
4.4.3 Hierarchy and Label Stacking
4.4.4 Label Stack Encoding
4.4.5 Loop Detection
4.5.1 LDP
4.5.2 CR-LDP
4.5.3 RSVP-TE
4.5.4 Comparison
4.6 Summary 4.7 Further Reading4.5.2 CR-LDP
4.5.3 RSVP-TE
4.5.4 Comparison
Chapter Five: Internet Traffic Engineering
5.1 Introduction
5.2 The Fish Problem
5.3 Traffic Engineering Solutions
5.4 Optimization Objectives
5.5 Building Blocks
5.7 Constraint-Based Routing
References
5.2 The Fish Problem
5.3 Traffic Engineering Solutions
5.4 Optimization Objectives
5.5 Building Blocks
5.5.1 Data Repository
5.5.2 Topology and State Discovery
5.5.3 Traffic Demand Estimation
5.5.4 Route Computation
5.5.5 Network Interface
5.6 Topology and State Discovery5.5.2 Topology and State Discovery
5.5.3 Traffic Demand Estimation
5.5.4 Route Computation
5.5.5 Network Interface
5.7 Constraint-Based Routing
5.7.1 Mathematical
Formulation
5.7.2 Overlay Model
5.7.3 Peer Model
5.8 Multi-Path Loadsharing
5.7.2 Overlay Model
5.7.3 Peer Model
5.8.1 Direct Hashing
5.8.2 Table-Based Hashing
5.9 Summary5.8.2 Table-Based Hashing
L'auteur - Zheng Wang
Zheng Wang has been involved in Internet-related research and development for the last 14 years. He is currently with Bell Labs Lucent Technologies, working on high-speed routers and optical transport systems. He has been published in many journals and magazines, and holds patents in IP routing, QoS mechanisms, differentiated services, MPLS, traffic engineering, and optical networking.
Caractéristiques techniques
| PAPIER | |
| Éditeur(s) | Morgan Kaufmann |
| Auteur(s) | Zheng Wang |
| Parution | 01/03/2001 |
| Nb. de pages | 239 |
| Format | 19 x 24,2 |
| Couverture | Relié |
| Poids | 739g |
| Intérieur | Noir et Blanc |
| EAN13 | 9781558606081 |
| ISBN13 | 978-1-55860-608-1 |
Avantages Eyrolles.com
Livraison à partir de 0,01 € en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse
