Home > Articles > Networking > Network Design & Architecture

MPLS Architecture

  • Print
  • + Share This
In this chapter from MPLS: Implementing the Technology, learn about MPLS system components, system functions, and operating modes.

A doctor can bury his mistakes, but an architect can only advise his client to plant vines.

  • Frank Lloyd Wright

4.1 MPLS System Components

MPLS as a system relies on the concepts of Label Switching Router (LSR), Label-Switched Path (LSP), and labeled packets. In its simplest form, MPLS is the concept of LSRs forwarding labled packets on LSPs. This section describes these components in more detail.

Label Switching Router

This section describes the components that make up a label switching router.

Forwarding Information Base

The MPLS architecture document (Rosen, Viswanathan, and Callon 2001) defines the components of the forwarding information base (FIB) 1 as follows:

  • Next Hop Label Forwarding Entry (NHLFE): An entry containing next-hop information (interface and next-hop address) and label manipulation 2 instructions; it may also include label encoding, L2 encapsulation information, and other information required for processing packets in the associated stream.

  • Incoming Label Map (ILM): A mapping from incoming labels to corresponding NHLFEs.

  • FEC-to-NHLFE map (FTN): A mapping from the FEC of any incoming packets to corresponding NHLFEs.

It is important to note that this is a reasonable, but arbitrary, division of the tasks that are performed in a FIB lookup, based on the local LSR's role in any LSP. An actual implementation may, for example, internally classify unlabeled packets and assign an internal label. This would permit the implementation to include a label as part of each NHLFE to be used as a key in accessing successive matching NHLFEs. Note also that the existence of more than one matching NHLFE may be a function of the label retention mode (discussed later in this chapter) and whether or not the local LSR is supporting multipathing3 or multicast LSPs.

How the required NHLFE is accessed depends on the role the LSR plays in the specific LSP: If the LSR is the ingress, it uses an FTN; otherwise, it uses an ILM.

Route Determination Module

The route determination function is used to construct FIB entries in the normal mode of MPLS operation. Information from routing protocol interactions determines FECs for which it is desirable to create an NHLFE, as well as the next-hop information needed to construct the NHLFE. Because MPLS currently only defines downstream allocation4 of labels, an NHLFE will not contain an output (downstream) label until a label has been allocated by the downstream peer LSR.

The LSR constructs NHLFEs by one of the following methods:

  • Allocating one or more labels to be used as the incoming label, creating ILMs for each, binding each ILM to the set of NHLFEs, and distributing the labels allocated to upstream LSRs

  • Creating FTNs for FECs associated with specific routing entries and binding each to a set of NHLFEs with corresponding next-hop information

Note that an NHLFE that does not contain a downstream label will either have a pop label manipulation instruction or a drop forwarding instruction. 5 For this reason, it does not make sense to create an NHLFE associated with an FTN and without a downstream label.

The route determination function is also used to remove (or update) FIB entries when, for instance, routes associated with a given FEC are removed or next-hop information is changed.

Forwarding Module

The forwarding function in MPLS is based on a simple exact match of a label to an ILM, which in turn maps to an NHLFE. The LSR follows the label manipulation instructions of the NHLFE and delivers the packet to the interface specified in the next-hop information. The LSR may also need to use L2 encapsulation information provided in the NHLFE to properly encapsulate the packet for delivery to the correct next hop.6

In the event that the matched ILM maps to more than one NHLFE, the specific behavior is determined based on the context within which multiple NHLFEs were created. One NHLFE may be selected based on associated preference values among multiple NHLFEs (if, for example, each additional NHLFE is used to provide a redundant LSP or to support load sharing). Multiple NHLFEs may be used (if multicasting data, for instance). Hence, the behavior in the event that a single ILM maps to multiple NHLFEs depends on why the LSR allowed a second, and each subsequent, NHLFE to be created.

Figure 4.1 shows the decision tree for the forwarding function using PPP links as an example. The PPP Protocol field is used to determine whether the LSR is looking for an ILM (protocol number 0x0281 or 0x0283) 7 or an FTN (various other protocol numbers).8 The ILM or FTN is then used to find at least one NHLFE, which is then used to determine the output interface, label manipulation instructions, and related forwarding information. A very similar decision tree would apply to Ethernet links (using Ether type values 0x8847 or 0x8848). 9 The decision tree for ATM or Frame Relay is simpler because the label is incorporated in the L2 header itself, eliminating the need to evaluate a higher-level protocol identifier at L2.

Figure 4.1 Forwarding decision tree

Label-Switched Path

This section describes the components that make up a label-switched path.

Ingress, Egress, Intermediate, and Transparent

At ingress to an LSP, an LSR pushes at least one label onto the label stack. Label(s) pushed onto the label stack may be the first label(s) in the stack.

In this case, we know that the NHLFE that contained the label manipulation instructions used to push the label(s) onto the stack was located using an FTN and that the local LSR may be an ingress to MPLS generally. 10

An LSR that pops at least one label off the label stack is either the egress or the penultimate hop for the LSP. The distinction between penultimate hop and egress is a small one when both pop a label. In fact, for LSRs that can terminate an LSP at an output interface, the distinction is essentially nonexistent. An LSR that performs a simple label swap is an intermediate LSR.

Labels in the label stack below11 those changed by label manipulation instructions correspond to LSPs for which the local LSR is transparent.

In the independent control mode,12 an LSP for which the local LSR is an egress may be spliced together with another LSP for which it is the ingress. 13 Where it would have popped one label and pushed another, it now swaps one label for the other. In this case, the LSR has become an intermediate LSR with respect to the concatenated LSP.

An implementation may allow for fairly complex label manipulation instructions in an NHLFE (for example, pop one or more labels and then push one or more labels). This LSR may splice LSPs for which it is the egress at multiple levels with LSPs for which it is the ingress at multiple levels. By analogy, it has become an intermediate LSR for concatenated LSPs corresponding to each label popped off where a corresponding label is also pushed onto the label stack.

To generalize:

  • LSRs that push at least one more label onto a label stack than they pop off are ingress LSRs for LSPs at all levels corresponding to additional labels pushed.

  • LSRs that pop at least one more label than they push are egress LSRs for LSPs corresponding to labels popped with no matching push.

  • LSRs are intermediate LSRs in all LSPs for which they effectively perform a label swap.

  • LSRs are transparent in all LSPs corresponding to labels that are unaffected by push, pop, and swap label manipulation instructions.

Note that this summary is a generalization. The simplicity of the forwarding function in MPLS depends on the fact that for any particular atomic forwarding decision, the decision is based entirely on the top-level label. Therefore, the NHLFE selection is based on the top-level label rather than the label stack in the simplified forwarding paradigm.

Characteristics and Associated State

In addition to the forwarding information associated with an LSP, additional characteristics and state information may need to be maintained. Examples of these types of information include the following:

  • QoS characteristics of the LSP, which are used to determine queue assignment and priority

  • Information used to determine whether an LSP setup in progress can be merged with an existing LSP (if merging is supported)

  • State of LSP setup, used to determine when the LSP may be used for forwarding data (in ordered control mode or when a loop has been detected)14

Labeled Packets

This section describes the MPLS-specific components that make up a labeled packet.

Label

MPLS defines specific label formats for ATM and Frame Relay, and a generic label format intended for use with most other media. 15 ATM labels correspond to VPI/VCI numbers and may be as long as 24 bits. Frame Relay labels correspond to DLCI numbers and are either 10 or 23 bits long. The generic label is 20 bits long.

Label Stack

The label stack is a succession of labels in order (as viewed in network arrival order) from top to bottom. Operations on the label stack include the following:

  • Pushing one or more labels onto the stack (adding labels to the beginning, or top, of the stack)

  • Popping a label off the stack (removing it from the beginning, or top, of the stack)

  • Swapping labels

The format of the label stack is described in the Encapsulation section in Chapter 6.

  • + Share This
  • 🔖 Save To Your Account

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.

Overview


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.

Surveys

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.

Newsletters

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.

Security


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

Children


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

Marketing


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.

Choice/Opt-out


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.

Links


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