The “Forwarding Equivalence Class” is an important concept in MPLS. An FEC is any subset of packets that are treated the same way by a router. By “treated” this can mean, forwarded out the same interface with the same next hop and label. It can also mean given the same class of service, output on same queue, given same drop preference, and any other option available to the network operator.
When a packet enters the MPLS network at the ingress node, the packet is mapped into an FEC. The mapping can also be done on a wide variety of parameters, address prefix (or host), source/destination address pair, or ingress interface. This greater flexibility adds functionality to MPLS that is not available in traditional IP routing.
FECs also allow for greater scalability in MPLS. In Ipsilon’s implementation of IP Switching or in MPOA, their equivalent to an FEC maps to a data flow (source/destination address pair, or source/destination address plus port no.). The limited flexibility and large numbers of (short lived) flows in the Internet limits the applicability of both IP Switching and MPOA. With MPLS, the aggregation of flows into FECs of variable granularity provides scalability that meets the demands of the public Internet as well as enterprise applications.
In the current Label Distribution Protocol specification, only three types of FECs are specified:
- IP Address Prefix
- Router ID
- Flow (port, dest-addr, src-addr etc.)
The spec. states that new elements can be added as required.
<number>
Labels are created based on the forwarding equivalence classes (FECs) created through the layer 3 routing protocol. In order for label swapping to be possible, common understanding of which FECs map to which labels must be achieved between adjacent routers. The communication of label binding information (I.e. the binding of an FEC to a specific label value) between LSRs is accomplished by label distribution.
Label distribution can occur either by piggybacking binding information on an existing routing protocol, or through the creation of a dedicated label distribution protocol (LDP). In either case, a router would communicate binding information after a specific label value is assigned to an FEC. The LSR receiving this binding information would, assuming the information comes from the correct next hop, insert the label value into the label information base associated with the corresponding FEC.
After this information is communicated, the upstream LSR knows that if it is forwarding a packet associated with the particular FEC, it can use the associated label value and the downstream LSR that the packet is forwarded to will recognize it as belonging to that FEC. As this information is communicated along a chain of LSRs, a path will be set up along which a number of hops can use label swapping and avoid the full layer 3 look-up.
This is a much simplified view of label distribution, in reality there are a number of options and techniques by which this can be implemented.
<number>
CR-LDP is an open standard protocol, proposed and accepted by the IETF MPLS working group. It does not have any dependencies on other protocols that are outside the scope or control of the MPLS working group. This provides two major benefits for CR-LDP: a) it can easily be enhanced to accommodate new network requirements, b) it promotes interoperability. In fact, recent interoperability demonstrations have proven CR-LDP to be a true multivendor networking protocol. CR-LDP software is also publicly available.
The CR-LDP signaling builds on the LDP protocol, and provides ER-LSP setup with optional resource reservation in a simple hard state control and messaging manner. The transport mechanism is UDP for peer discovery and TCP for session, advertisement, notification and CR-LDP messages. Building the CR-LDP signaling on TCP ensures a reliable transport mechanism for the signaling of ER-LSPs.
Interoperability of CR-LDP has already been proven and publicly demonstrated by a multi-vendor interoperability trial. The software of the protocol is also publicly available for the promotion of network interoperability. CR-LDP is a true open standard, which starts from a clean slate and has no backward compatibility issue to be concerned with. This makes CR-LDP easy to enhance and standardize.
CR-LDP is part of LDP and uses the same mechanisms and messages as LDP for peer discovery, session establishment/maintenance, label distribution/management and error handling. Therefore, LDP/CR-LDP offers a unified signaling protocol system that provides network operators with the complete label distribution and path setup modes needed for MPLS. This certainly maximizes operational efficiency and results in lower operational costs.
<number>
<number>
<number>
<number>
<number>
<number>
<number>
<number>
<number>
<number>
VP merge stream merge when it is applied to VPs, specifically so as to allow multiple VPs to merge into one single VP. In this case the VCIs need to be unique. This allows cells from different sources to be distinguished via the VCI.
An issue with VP merge is that unique VCIs need to be configured/negotiated/derived for each ingress on a mp2p VP tree.
Congestion issue at merging points, how much bandwidth to allocate,
the node doing the merge may need to have knowledge about the number of leaves being meged (fan-in) in order to allocate resources (buffers, bandwidth) appropriately. So this information is carried in the LDP with ingress based label allocation where sources advertise their existence towards the root.
EPD on VCCs inside the VPC? this requires hardware changes?
Lucent presented a contribution in the atm forum meting in july where they calculated the extra latency and buffer utilization caused by vcmerge and result was the the negative effect is very small. in fact so small which makes vp merge not worth the trouble.
VP space is limited to 256/4K (UNI/NNI) and may be limited to a few hundred edge routers (depending on how it is done). VP merging also has other unsolved problems with regard to label consumption and label setup protocol.
Ascend/Cascade argues for the benefits of VP-merge (IP Navigator does that and they claim a patent for it)