MPLS-Enabled Applications Emerging Developments and New Technologies
"Here at last is a single, all-encompassing resource where the myriad applications sharpen into a comprehensible text." Kireeti Kompella, Juniper Fellow, Juniper Networks. The authoritative guide to MPLS, now in its second edition, fully updated with brand new material! Multiprotocol Label...
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Chicester :
Wiley
2008.
|
| Edición: | 2nd ed |
| Colección: | Wiley Series on Communications Networking & Distributed Systems
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627761906719 |
Tabla de Contenidos:
- MPLS-Enabled Applications; Contents; About the Authors; Foreword; Preface; Acknowledgements; Part One; 1 Foundations; 1.1 Historical perspective; 1.2 Current trends; 1.3 MPLS mechanisms; 1.3.1 Forwarding plane mechanisms; 1.3.2 Control plane mechanisms; 1.3.3 Transport of IPv6 over an IPv4 MPLS core; 1.4 Conclusion; 1.5 References; 1.6 Further reading; 1.7 Study questions; 2 Traffic Engineering with MPLS (MPLS-TE); 2.1 Introduction; 2.2 The business drivers; 2.3 Application scenarios; 2.4 Setting up traffic-engineered paths using MPLS-TE; 2.4.1 LSP priorities and preemption
- 2.4.2 Information distribution - IGP extensions2.4.3 Path calculation - CSPF; 2.4.4 Path setup - RSVP extensions and admission control; 2.5 Using the traffic-engineered paths; 2.6 Deployment considerations; 2.6.1 Scalability; 2.6.2 Reservation granularity; 2.6.3 Routing challenges; 2.7 Using traffic engineering to achieve resource optimization; 2.7.1 Autobandwidth - dealing with unknown bandwidth requirements; 2.7.2 Sharing links between RSVP and other traffic - dealing with unknown bandwidth availability; 2.7.3 Other methods for optimization of transmission resources in MPLS networks
- 2.8 Offline path computation2.9 Conclusion; 2.10 References; 2.11 Further reading; 2.12 Study questions; 3 Protection and Restoration in MPLS Networks; 3.1 Introduction; 3.2 The business drivers; 3.3 Failure detection; 3.4 End-to-end protection; 3.4.1 Control over the traffic flow following a failure; 3.4.2 Requirement for path diversity; 3.4.3 Double-booking of resources; 3.4.4 Unnecessary protection; 3.4.5 Nondeterministic switchover delay; 3.5 Local protection using fast reroute; 3.5.1 Case (i): link protection, for the facility protection case
- 3.5.2 Case (ii): link protection, for the 1:1 protection case3.5.3 Case (iii): node protection, for the facility protection case; 3.5.4 Case (iv): node protection, for the 1:1 protection case; 3.6 Link protection; 3.6.1 What happens before the failure; 3.6.2 What happens after the failure; 3.7 Node protection; 3.8 Additional constraints for the computation of the protection path; 3.8.1 Fate sharing; 3.8.2 Bandwidth protection; 3.8.3 Bandwidth protection and DiffServ; 3.9 Interaction of end-to-end protection and fast reroute; 3.10 Deployment considerations for local protection mechanisms
- 3.10.1 Scalability considerations3.10.2 Evaluating a local protection implementation; 3.10.3 The cost of bandwidth protection; 3.11 IP and LDP FRR; 3.11.1 The tunnel-based approach; 3.11.2 The alternate-path approach; 3.12 Conclusion; 3.13 References; 3.14 Further reading; 3.15 Study questions; 4 MPLS DiffServ-TE; 4.1 Introduction; 4.2 The business drivers; 4.3 Application scenarios; 4.3.1 Limiting the proportion of traffic from a particular class on a link; 4.3.2 Maintaining relative proportions of traffic on links; 4.3.3 Providing guaranteed bandwidth services; 4.4 The DiffServ-TE solution
- 4.4.1 Class types
