Home > Store

MPLS and Label Switching Networks, 2nd Edition

Register your product to gain access to bonus material or receive a coupon.

MPLS and Label Switching Networks, 2nd Edition


  • Sorry, this book is no longer in print.
Not for Sale


  • Copyright 2002
  • Dimensions: 7-1/4" x 9-1/2"
  • Pages: 336
  • Edition: 2nd
  • Book
  • ISBN-10: 0-13-035819-3
  • ISBN-13: 978-0-13-035819-6

Whether you're in an enterprise network or service provider environment, MPLS and Label-Switching Networks, Second Edition is the authoritative resource you need to understand MPLS technologies -- and implement them for competitive advantage. Writing specifically for network and communications professionals, renowned communication specialist Uyless Black illuminates the final MPLS standard through practical examples and realistic configuration diagrams. Black introduces every fundamental concept and protocol, explaining how MPLS works and how it can be applied in both IPv4 and IPv6 environments. This book's in-depth QoS coverage shows how to use MPLS to combat network latency and jitter; how to build more resilient service provider and ISP backbones; and how to configure networks for rapid service restoration. Black also presents in-depth coverage of MPLS-based VPNs, including security issues. Black introduces the new Generalized MPLS (GMPLS) protocol for optical networking, which extends MPLS to time, wavelength, and space-based switching domains. He also introduces Resource Reservation Protocol for Traffic Engineering (RSVP-TE), showing how to use it to maximize network reliability and utilization.

Sample Content

Online Sample Chapter

Using MPLS to Improve Network Performance

Table of Contents


1. Introduction.

What is Label Switching? Why Use Label Switching? Speed and Delay. Scalability. Simplicity. Resource Consumption. Route Control (Control of the Forwarding Path). Route Control Using. The ZIP Code Analogy. Why a Label Is Not an Address. How Label Switching is Implemented and How it Came About. Clarification of Terms. The Need for a QOS-based Internet. Label Switching and QOS. The Contribution of Label Switching. Label SwitchingÕs Legacy: X.25 and Virtual Circuits. The Logical Channel Number: Precursor to the Label. Frame Relay and ATM: A Rose by Any Other Name Is Still a Rose. MPLS: Status and Concepts. Examples of Label and QOS Relationships. Determination of the Physical Path Through the Network: The Label Switched Path (LSP). Summary.

2. Label Switching Basics.

IP and MPLS Control and Data Planes. IP Control and Data Planes. MPLS Control and Data Planes. The Forwarding Equivalence Class. Scalability and Granularity. Granularity in Terabit Networks. Information Used in the Forwarding Decision. Label Allocation Methods. Local and Remote Binding. Downstream and Upstream Binding. Control Operations Followed by Data Operations. Label Space and Label Assignments. Execution of the Control Planes in a Label Switching Domain. Scenarios for Label Assignments. Relationships Between IP and MPLS Control Planes. Examples of FEC and Label Correlations: The Label Switching Tunnel. Alternatives for Carrying the Label. Label Swapping. Summary.

3. Switching and Forwarding Operations.

A Taxonomy of Switching and Forwarding Networks. Layer 2 Switching. Layer 3 Routing (Actually, Forwarding). Problem with IP Forwarding Operations. Layer 3 Switching. Cache-Assisted Switching. Distributed Switching. Example of Layer 3 Switching. Layer 4 Switching. Label Switching/Swapping/Mapping. Layer 3 to Layer 2 Mapping. At the Ingress LSR. At an Intermediate (Interior) LSR. At the Egress LSR. MPLS's Relationship to These Operations. IP Switching. Architecture of the IP Switch. Route-Server-Based Relaying. Route-Server-Based Operations. Multiprotocol Over ATM (MPOA) and Next Hop Resolution Protocol (NHRP). Tag Switching. Forwarding Component. Tag Encapsulation. Control Component. Tag Switching with ATM. Quality of Service. Examples of Tag Switching Operations. Border (Edge) TSRs. Flow Classification. IPv6 Flow Operations. IPv4 Codepoint Operations. MPLS and LDP. IPv6 Label Operations. Summary.

4. MPLS Key Concepts.

Major Attributes of MPLS. Terminology. Network Model for Examples. Types of MPLS Nodes. Uniqueness of Labels. MPLS Startup. Assigning Labels to FECs. Independent Control. Ordered Control. Unsolicited and Solicited Label Distribution. Example of the Label Information Base (LIB). Example of the Label Forwarding Information Base (LFIB). Liberal and Conservative Retention Modes. How MPLS can Recover from Link or Node Failures. Discovery of Inoperability. Problem with the Topology in the Network Model. The MPLS Header. The Label Stack. Stacking Rules for the Label Switched Path. Penultimate Hop Popping. Stacks and Encapsulations. Reserved Label Values. MPLS terms for LIB and LFIB. The Next Hop Label Forwarding Entry (NHLFE). FEC-to-NHLFE Map (FTN). Incoming Label Map (ILM). Aggregation. Label Merging. Scope and Uniqueness of Labels in a Label Space. Hop-by-Hop and Explicit Routing. Review of the Label Retention Mode. Advertising and Using Labels. The Downstream LSR (Rd) Procedures. The Upstream LSR (Ru) Procedure. NotAvailable Procedure. Release Procedure. Label Use Procedure. Summary.

5. Label Distribution Operations.

The Issue of Label Granularity. Methods for Label Distribution. Advertising and Distributing Aggregated FECs. Ru Has Finer Granularity Than That of Rd. Ru Has Coarser Granularity Than That of Rd. Introduction to LDP. LDP Messages. FECs, Label Spaces, and Identifiers. Mapping Rules. Label Spaces and Identifiers. LDP Sessions. Sessions Between Indirectly Connected LSRs. How LSRs Know About Other LSRs. LDP Label Distribution and Management. Independent Control Mapping. Ordered Control Mapping. Downstream-on-Demand Label Advertisement. Problem Management for the First Three Distribution Methods. Downstream Unsolicited Label Advertisement. LDP Messages. The LDP Header. Type-Length-Value (TLV) Encoding. The LDP Message Format. TLVs: Formats and Functions. The LDP Messages: Formats and Functions. Loop Detection and control. Buffer Control. Time to Live (TTL). Path Vectors. Colored Threads. RSVP and Label Distribution. Aspects of RSVP Pertinent to MPLS. The Flow Descriptor. Interworking Concepts for MPLS and RSVP. More Information About RSVP Extensions. BGP and Label Distribution. Summary.

6. MPLS and ATM and Frame Relay Networks.

Aspects of ATM of Interest to MplS. Virtual Circuits. VPIs and VCIs. The ATM Cell Header. Permanent Virtual Circuits and Switched Virtual Calls. Other Important Fields in the ATM Cell. ATM and MPLS: Similarities and Differences. Scaling IP/ATM Overlay Networks. Principal Traffic Management Issues in and between ATM-LSRs. MPLS and ATM Interworking. Difficulty of Interleaving AAL5 Traffic. VC and VP Merging. The Merging Process. Reversing the Process with an MPLS Backbone. Mapping the MPLS Labels To ATM Vpis/VCIs. Types of Merging (or Nonmerging). Interoperation of VC Merge, VP Merge, and Non-merge. The Virtual Circuit ID. Notification Operation. VPI/VCI Values. Encapsulation And TTL Operations. Aspects of Frame Relay of Interest to MPLS. Virtual Circuits and DLCIs. The Frame Relay Header. Permanent Virtual Circuits and Switched Virtual Calls. Running ATM, Frame Relay and Others over MPLS. Summary.

7. Traffic Engineering.

Traffic Engineering Defined. Traffic-Oriented or Resource-Oriented Performance. The Congestion problem. Problem Description. Two Scenarios of Congestion. Services Based on QOS Needs and Classes of Traffic. Traffic Engineering and Traffic Shaping. Queuing the Traffic. Problems with Existing Routing Operations. The Overlay Network Approach. Induced MPLS Graph. Traffic Trunks, Traffic Flows, and Label Switched Paths. Attractiveness of MPLS for Traffic Engineering. Link Capacity: The Ultimate Arbiter. Load Distribution. Traffic Trunk Attributes. Attributes of Traffic Trunks for Traffic Engineering. Constraint-Based Routing (CR). Peak Rate. Committed Rate. Excess Burst Size. Peak Rate Token Bucket. Committed Data Rate Token Bucket. Weight. Differentiated Services, MPLS, and Traffic Engineering. Average Rate Meter. Exponential Weighted Moving Average Meter. Token Bucket Meter. Ideas on Shaping Operations. DS Guaranteed Rate. Assured and Expedited Forwarding PHBs. Examples of WFQ And MPLS Flows. Examples of MPLS Protection Switching. Using RSVP to Establish Alternate/Detour LSPs. Determining Which Path Protection Method to Use. Summary.

8. OSPF in MPLS Networks.

Review of IP-Based Routing Protocols. Routing Domains. Route Advertising. Routing Domains and the “Flat Network” Problem. Autonomous Systems. How Autonomous Systems Are Numbered. How a Host Is Made Known to Other Domains. Correlation (Binding) of the Prefixes to MPLS Labels. Multiple Routing Protocols. Overview of the Routing Protocols. Overview of OSPF. Role of the Router in OSPF. Directed Graphs. Key Operations. OSPF Areas. Packet Containment. Stub Areas. Revising OSPF to Support Constrained Routing and T. General Idea of Using OSPF in MPLS Networks. Traffic Engineering Extensions to OSPF. The LSA TE Extension. The TLVs. Role of OSPF in VPNs. Summary.

9. Constraint-Based Routing with CR-LDP.

The Basic Concept. Explicit Routing. LDP and Constraint-based Routing. Strict and Loose Explicit Routes. Preemption. CR Messages and TLVs. Label Request Message. Label Mapping Message. Notification Message. Explicit Route TLV. Explicit Route Hop TLV. Traffic Parameters TLV. Preemption TLV. LSPID TLV. Resource Class TLV. Route Pinning TLV. CR-LSP FEC TLV. Summary.

10. MPLS, Optical Networks, and GMPLS.

WDM and Optical Networks. Relationships of Optical and MPLS Operations. Multiprotocol Lambda Switching (MPlS). MPLS and Optical Wavelength Mapping. Failure of the Optical Connection. Views on the MPLS Control Plane and the Optical Switch. Control Adaptation. Generalized MPLS Use in Optical Networks. Considerations for Interworking Layer 1 Lambdas and Layer 2 Labels. Examples of GMPLS Operations. Suggested Labels for Wavelengths. Bidirectional LSPs in Optical Networks. Label Contention Resolution. Link Protection. Summary.

11. VPNs with L2TP, BGP, OSPF, and MPLS.

Overview of VPNs. Role of Tunnels in VPNs (by Use of L2TP). Overview of BGP. BGP Neighbors. BGP Speakers. Communities. BGP Policy-Based Architecture. Path Selection with BGP. MPLS Label Stacking in the VPN. VPN Architecture. Customer Edge (CE) Devices. Multiple Forwarding Tables. Role of BGP in VPNs. The VPN-IP4 Address Family. Using BGP to Distribute the Address and the Label. Using Route Reflectors. Role of OSPF in VPNs. Disadvantages and Advantages of Using OSPF in the VPN. Principal Rules for Using OSPF in VPNs. Role of MPLS in VPNs. Keeping VPN Routers Out of P Routers. Isolating the VPNs. Summary.

12. MPLS and DiffServ.

Diffserv Concepts. Per-Hop Behavior. The Diffserv Domain. Types of Per-Hop Behaviors. MplS and Diffserv Routers. Traffic Classification and Conditioning. DS Classifiers. Behavior Aggregates, Ordered Aggregates, and LSPs. Classification Operations. Metering Operations. The DS Codepoint Revisited. Codepoints for Assured Forwarding. DSCPs and LSR Use of MPLS Labels. The Ordered Aggregate and MPLS LSPS. EXP-Inferred-PSC LSPs. Label-Only-Inferred-PSC LSPs. Bandwidth Reservations for E-LSPs and L-LSPs. Summary.

Appendix A. Names, Addresses, Subnetting, Address Masks, and Prefixes.

Principal Addresses Used in Internet and Intranets. MAC Address. Network Address. IP Address. Address Aggregation and Subnet Masks and Prefixes. Variable Length Submasks. High Overhead of IP Forwarding.

Appendix B. CR-LDP and Traffic Engineering and QOS.

CR-LDP and ATM QOS. Parameters for ATM/CR-LDP Interworking. CR-LDP Parameters. CR-LDP Interworking with ATM QOS. CR-LDP and Frame Relay QOS. CR-LDP and RSVP Traffic Engineering (RSVP-TE).





As the name of this book implies, the focus is on the switching of traffic though a network or networks. The term switching is also known in some parts of the industry as forwarding, relaying, and routing.

Internet Drafts: Work in Progress

In many of my explanations of label switching operations, I have relied on the Internet Request for Comments (RFCs) and draft standards, published by the Internet Society, and I thank this organization for making the RFCs available to the public. The draft standards are "works in progress," and usually change as they wind their way to an RFC (if indeed they become an RFC). A work in progress cannot be considered final, but many vendors use them in creating products for the marketplace. Notwithstanding, they are subject to change.

For all the Internet standards and draft standards the following applies:

Copyright © The Internet Society (1998). All Rights Reserved.

This document and translations of it may be copied and furnished to others, and derivative works that comment on or otherwise explain it or assist in its implementation may be prepared, copied, published and distributed, in whole or in part, without restriction of any kind, provided that the above copyright notice and this paragraph are included on all such copies and derivative works. However, this document itself may not be modified in any way, such as by removing the copyright notice or references to the Internet Society or other Internet organizations, except as needed for the purpose of developing Internet standards in which case the procedures for copyrights defined in the Internet Standards process must be followed, or as required to translate it into languages other than English.

The limited permissions granted above are perpetual and will not be revoked by the Internet Society or its successors or assigns.


Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020