ROUTERS IP TO MPLS TO CESR
|
|
- Justina Prudence Greer
- 6 years ago
- Views:
Transcription
1 ROUTERS IP TO MPLS TO CESR
2 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. 2
3 WHAT IS ROUTING FORWARDING? R3 A R1 R4 D B E C R2 Destination D Next Hop R3 R5 F E R3 3 F R5
4 20 bytes WHAT IS ROUTING? R3 A R1 R4 D 1 Ver 4 HLen T.Service Total Packet Length B Fragment ID Flags Fragment Offset E TTL Protocol Header Checksum C Source Address R2 Destination Destination Address Next Hop R5 F Options D (if any) R3 E Data R3 4 F R5
5 WHAT IS ROUTING? R3 A R1 R4 D B E C R2 R5 F 5
6 POINTS OF PRESENCE (POPS) POP2 POP3 A POP1 POP4 D B POP5 E C POP6 POP7 POP8 F 6
7 WHERE HIGH PERFORMANCE ROUTERS ARE USED (2.5 Gb/s) R1 R2 R5 R6 (2.5 Gb/s) R3 R4 R7 R8 R9 R10 R14 R11 R12 7 (2.5 Gb/s) R13 R15 R16 (2.5 Gb/s)
8 WHAT A ROUTER LOOKS LIKE Cisco GSR Juniper M Capacity: 160Gb/s Power: 4.2kW Capacity: 80Gb/s Power: 2.6kW 6ft 3ft 8 2ft 2.5ft
9 GENERIC ROUTER ARCHITECTURE Header Processing Data Hdr Data Hdr Lookup IP Address Update Header Queue Packet IP Address Next Hop 1M prefixes Off-chip DRAM Address Table Buffer Memory 1M packets Off-chip DRAM 9
10 GENERIC ROUTER ARCHITECTURE Data Hdr Header Processing Lookup IP Address Update Header Buffer Manager Data Hdr Address Table Buffer Memory Data Hdr Header Processing Lookup IP Address Update Header Buffer Manager Data Hdr Address Table Buffer Memory Data Hdr Data Hdr Header Processing Lookup IP Address Update Header Buffer Manager 10 Address Table Buffer Memory
11 WHY DO WE NEED FASTER ROUTERS? 1. To prevent routers becoming the bottleneck in the Internet. 2. To increase POP capacity, and to reduce cost, size and power. 11
12 Fiber Capacity (Gbit/s) WHY WE NEED FASTER ROUTERS 1: TO PREVENT ROUTERS FROM BEING THE BOTTLENECK Packet processing Power Link Speed Spec95Int CPU results x / 18 months x / 7 months ,1 TDM DWDM 0,1 12 Source: SPEC95Int & David Miller, Stanford.
13 WHY WE NEED FASTER ROUTERS 2: TO REDUCE COST, POWER & COMPLEXITY OF POPS POP with large routers POP with smaller routers 13 Ports: Price >$100k, Power > 400W. It is common for 50-60% of ports to be for interconnection.
14 WHY ARE FAST ROUTERS DIFFICULT TO MAKE? 1. It s hard to keep up with Moore s Law: The bottleneck is memory speed. Memory speed is not keeping up with Moore s Law. 14
15 0.001 WHY ARE FAST ROUTERS DIFFICULT TO MAKE? SPEED OF COMMERCIAL DRAM 1. It s hard to keep up with Moore s Law: The bottleneck is memory speed. Memory 100 speed is not keeping up with Moore s Law. Access Time (ns) Moore s Law 2x / 18 months 1.1x / 18 months
16 WHY ARE FAST ROUTERS DIFFICULT TO MAKE? 1. It s hard to keep up with Moore s Law: The bottleneck is memory speed. Memory speed is not keeping up with Moore s Law. 2. Moore s Law is too slow: Routers need to improve faster than Moore s Law. 16
17 ROUTER PERFORMANCE EXCEEDS MOORE S LAW Growth in capacity of commercial routers: Capacity 1992 ~ 2Gb/s Capacity 1995 ~ 10Gb/s Capacity 1998 ~ 40Gb/s Capacity 2001 ~ 160Gb/s Capacity 2003 ~ 640Gb/s Average growth rate: 2.2x / 18 months. 17
18 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. 18
19 First Generation Routers Shared Backplane CPU Route Table Buffer Memory Line Interface MAC Line Interface MAC Line Interface MAC Typically <0.5Gb/s aggregate capacity 19
20 Second Generation Routers CPU Route Table Buffer Memory Line Card Line Card Line Card Buffer Memory Fwding Cache MAC Buffer Memory Fwding Cache MAC Buffer Memory Fwding Cache MAC Typically <5Gb/s aggregate capacity 20
21 Third Generation Routers Switched Backplane Line Card Local Buffer Memory Fwding Table MAC CPU Card Routing Table Line Card Local Buffer Memory Fwding Table MAC Typically <50Gb/s aggregate capacity 21
22 Fourth Generation Routers/Switches Optics inside a router for the first time Optical links 100s of metres Switch Core Linecards Tb/s routers in development
23 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. 23
24 GENERIC ROUTER ARCHITECTURE Header Processing Lookup IP Address Update Header Buffer Manager Address Table Buffer Memory Header Processing Lookup IP Address Update Header Buffer Manager Address Table Buffer Memory Header Processing Lookup IP Address Update Header Buffer Manager 24 Address Table Buffer Memory
25 IP ADDRESS LOOKUP Why it s thought to be hard: 1. It s not an exact match: it s a longest prefix match. 2. The table is large: about 120,000 entries today, and growing. 3. The lookup must be fast: about 30ns for a 10Gb/s line. 25
26 IP LOOKUPS FIND LONGEST PREFIXES / / / / / / Routing lookup: Find the longest matching prefix (aka the most specific route) among all prefixes that match the destination address. 26
27 IP ADDRESS LOOKUP Why it s thought to be hard: 1. It s not an exact match: it s a longest prefix match. 2. The table is large: about 120,000 entries today, and growing. 3. The lookup must be fast: about 30ns for a 10Gb/s line. 27
28 ADDRESS TABLES ARE LARGE Number of prefixes Source: Geoff Huston, Oct 2001 Aug-87 May-90 Jan-93 Oct-95 Jul-98 Apr-01 Jan-04 28
29 IP ADDRESS LOOKUP Why it s thought to be hard: 1. It s not an exact match: it s a longest prefix match. 2. The table is large: about 120,000 entries today, and growing. 3. The lookup must be fast: about 30ns for a 10Gb/s line. 29
30 LOOKUPS MUST BE FAST Year Line 622Mb/s 2.5Gb/s 10Gb/s 40Gb/s 40B packets (Mpkt/s)
31 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. 31
32 GENERIC ROUTER ARCHITECTURE Header Processing Lookup IP Address Update Header Queue Buffer Manager Packet Address Table Buffer Memory Header Processing Lookup IP Address Update Header Queue Buffer Manager Packet Address Table Buffer Memory Header Processing Lookup IP Address Update Header Queue Buffer Manager Packet 32 Address Table Buffer Memory
33 FAST PACKET BUFFERS Example: 40Gb/s packet buffer Size = RTT*BW = 10Gb; 40 byte packets Write Rate, R 1 packet every 8 ns Buffer Manager Read Rate, R 1 packet every 8 ns Buffer Memory 33 Use SRAM? Use DRAM? + fast enough random access time, + high density means we can store data, but but - too low density to store 10Gb of data. - too slow (50ns random access time).
34 PACKET CACHES Small ingress SRAM cache of FIFO tails Small ingress SRAM cache of FIFO heads Arriving Packets Buffer Manager Departing Packets Q SRAM Q b>>1 packets at a time DRAM Buffer Memory DRAM Buffer Memory Q 34
35 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. 35
36 GENERIC ROUTER ARCHITECTURE Data Hdr Header Processing Lookup IP Address Update Header 1 1 Queue Packet Address Table Buffer Memory Data Hdr Header Processing Lookup IP Address Update Header 2 2 N times line rate Queue Packet Address Table Buffer Memory N times line rate Data Hdr Header Processing Lookup IP Address Update Header N N Queue Packet 36 Address Table Buffer Memory
37 GENERIC ROUTER ARCHITECTURE Data Hdr Header Processing Lookup IP Address Update Header Queue Packet 1 1 Address Table Buffer Memory Data Hdr Data Hdr Header Processing Lookup IP Address Update Header Queue Packet 2 2 Data Hdr Address Table Buffer Memory Data Hdr Header Processing Lookup IP Address Update Header Queue Packet N Scheduler N 37 Address Table Buffer Memory Data Hdr
38 OUTPUT BUFFERED SWITCHES The best that any queueing system can achieve. Delay 38 0% 20% 40% 60% 80% 100% Load
39 INPUT BUFFERED SWITCHES HEAD OF LINE BLOCKING The best that any queueing system can achieve. Delay 39 0% 20% 40% 60% 80% 100% Load %
40 40 HEAD OF LINE BLOCKING
41 41 VIRTUAL OUTPUT QUEUES
42 A ROUTER WITH VIRTUAL OUTPUT QUEUES The best that any queueing system can achieve. Delay 42 0% 20% 40% 60% 80% 100% Load
43 MAXIMUM WEIGHT MATCHING A 1 (n) A 11 (n) A 1N (n) L 11 (n) S*(n) 1 1 D 1 (n) A N (n) A N1 (n) D N (n) A NN (n) N N L NN (n) L 11 (n) * T S n L n S n S( n) ( ) arg max( ( ) ( )) Maximum Weight Match 43 L N1 (n) Request Graph Bipartite Match
44 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. More parallelism. Eliminating schedulers. Introducing optics into routers. Natural evolution to circuit switching? 44
45 EXTERNAL PARALLELISM: MULTIPLE PARALLEL ROUTERS What we d like: R IP Router capacity 100s of Tb/s R NxN R R The building blocks we d like to use: R R 45 R R
46 R R R MULTIPLE PARALLEL R ROUTERS LOAD BALANCING R R R/k 1 2 k R/k R R R 46
47 INTELLIGENT PACKET LOAD-BALANCING PARALLEL PACKET SWITCHING R/k Router R/k rate, R rate, R 2 rate, R N N rate, R k 47 Bufferless
48 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. More parallelism. Eliminating schedulers. Introducing optics into routers. Natural evolution to circuit switching? 48
49 They are already there. Connecting linecards to switches. Optical processing doesn t belong on the linecard. You can t buffer light. Minimal processing capability. Optical switching can reduce power. DO OPTICS BELONG IN ROUTERS? 49
50 Optics in routers Optical links Switch Core Linecards 50
51 COMPLEX LINECARDS Typical IP Router Linecard Lookup Tables Buffer & State Memory Optics Physical Framing Layer & Maintenance Packet Processing Buffer Mgmt & Scheduling Buffer Mgmt & Scheduling Switch Fabric Buffer & State Memory Arbitration 51 10Gb/s linecard: Number of gates: 30M Amount of memory: 2Gbits Cost: >$20k Power: 300W
52 REPLACING THE SWITCH FABRIC WITH OPTICS Typical IP Router Linecard Typical IP Router Linecard Lookup Tables Buffer & State Memory Buffer & State Memory Lookup Tables Optics Framing Physical & Layer Maintenance Packet Processing Buffer Mgmt & Scheduling Buffer Mgmt & Scheduling Buffer & State Memory 1. MEMs. electrical Switch Fabric Buffer Mgmt & Scheduling Buffer Mgmt & Scheduling Candidate Arbitration technologies Buffer & State Memory Packet Processing Framing & Maintenance Physical Layer Optics 2. Fast tunable lasers + passive optical couplers. 3. Diffraction waveguides. 4. Electroholographic materials. Typical IP Router Linecard Lookup Tables Buffer & State Memory optical Typical IP Router Linecard Buffer & State Memory Lookup Tables 52 Optics Framing Physical & Layer Maintenance Packet Processing Buffer Mgmt & Scheduling Buffer Mgmt & Scheduling Buffer & State Memory Req/Grant Switch Fabric Arbitration Req/Grant Buffer Mgmt & Scheduling Buffer Mgmt & Scheduling Buffer & State Memory Packet Processing Framing & Maintenance Physical Layer Optics
53 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. More parallelism. Eliminating schedulers. Introducing optics into routers. Natural evolution to circuit switching? 53
54 Optics enables simple, low-power, very high capacity circuit switches. The Internet was packet switched for two reasons: Expensive links: statistical multiplexing. Resilience: soft-state routing. Neither reason holds today. EVOLUTION TO CIRCUIT SWITCHING 54
55 Processing Power Link Speed (Fiber) FAST LINKS, 1985 SLOW ROUTERS Spec95Int CPU results x / 2 years 2x / 7 months Source: SPEC95Int; Prof. Miller, Stanford Univ ,1 Fiber optics DWDM Fiber Capacity (Gbit/s)
56 OUTLINE Background What is a router? Why do we need faster routers? Why are they hard to build? Architectures and techniques The Future The evolution of router architecture. IP address lookup. Packet buffering. Switching. More parallelism. Eliminating schedulers. Introducing optics into routers. Natural evolution to circuit switching? 56
57 REFERENCES General 1. J. S. Turner Design of a Broadcast packet switching network, IEEE Trans Comm, June 1988, pp C. Partridge et al. A Fifty Gigabit per second IP Router, IEEE Trans Networking, N. McKeown, M. Izzard, A. Mekkittikul, W. Ellersick, M. Horowitz, The Tiny Tera: A Packet Switch Core, IEEE Micro Magazine, Jan-Feb Fast Packet Buffers 1. Sundar Iyer, Ramana Rao, Nick McKeown Design of a fast packet buffer, IEEE HPSR 2001, Dallas. 57
58 REFERENCES IP Lookups 1. A. Brodnik, S. Carlsson, M. Degermark, S. Pink. Small Forwarding Tables for Fast Routing Lookups, Sigcomm 1997, pp B. Lampson, V. Srinivasan, G. Varghese. IP lookups using multiway and multicolumn search, Infocom 1998, pp , vol M. Waldvogel, G. Varghese, J. Turner, B. Plattner. Scalable high speed IP routing lookups, Sigcomm 1997, pp P. Gupta, S. Lin, N. McKeown. Routing lookups in hardware at memory access speeds, Infocom 1998, pp , vol S. Nilsson, G. Karlsson. Fast address lookup for Internet routers, IFIP Intl Conf on Broadband Communications, Stuttgart, Germany, April 1-3, V. Srinivasan, G.Varghese. Fast IP lookups using controlled prefix expansion, Sigmetrics, June
59 REFERENCES Switching N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand. Achieving 100% Throughput in an Input-Queued Switch. IEEE Transactions on Communications, 47(8), Aug A. Mekkittikul and N. W. McKeown, "A practical algorithm to achieve 100% throughput in input-queued switches," in Proceedings of IEEE INFOCOM '98, March L. Tassiulas, Linear complexity algorithms for maximum throughput in radio networks and input queued switchs, in Proc. IEEE INFOCOM 98, San Francisco CA, April D. Shah, P. Giaccone and B. Prabhakar, An efficient randomized algorithm for input-queued switch scheduling, in Proc. Hot Interconnects J. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proceedings of IEEE INFOCOM '00, Tel Aviv, Israel, March 2000, pp C.-S. Chang, D.-S. Lee, Y.-S. Jou, Load balanced Birkhoff-von Neumann switches, Proceedings of IEEE HPSR 01, May 2001, Dallas, Texas. 59
60 REFERENCES Future C.-S. Chang, D.-S. Lee, Y.-S. Jou, Load balanced Birkhoff-von Neumann switches, Proceedings of IEEE HPSR 01, May 2001, Dallas, Texas. Pablo Molinero-Fernndez, Nick McKeown "TCP Switching: Exposing circuits to IP" Hot Interconnects IX, Stanford University, August 2001 S. Iyer, N. McKeown, "Making parallel packet switches practical," in Proc. IEEE INFOCOM `01, April 2001, Alaska. 60
61 MULTI PROTOCOL LABEL SWITCHING (MPLS)
62 WHY INTERNET PROTOCOL IS POPULAR? Robustness Aggregation and Hierarchy
63 ISSUES WITH INTERNET PROTOCOL IP address lookup No QoS Best Effort
64 OBJECTIVES OF MPLS Speed up IP packet forwarding By cutting down on the amount of processing at every intermediate router Prioritize IP packet forwarding By providing ability to engineer traffic flow and assure differential QoS Without losing on the flexibility of IP based network
65 MPLS KEY IDEAS Use a fixed length label in the packet header to decide packet forwarding A path is established between two end points. At ingress a packet is classified into a Forwarding Equivalence Class. FEC to which it is assigned is encoded as a short fixed length value Label. Packet is forwarded along with label to next hop.
66 MPLS KEY IDEAS No further analysis of header by subsequent routers, forwarding is driven by the labels. Label is used as index for next hop and new label. At the Egress, label is removed and packet is forwarded to final destination based on the IP packet header
67 MPLS HEADER Label: 20-bit label value Exp: experimental use Can indicate class of service S: bottom of stack indicator 1 for the bottom label, 0 otherwise TTL: time to live Label Exp S TTL
68 Forwarding Equivalence Class Forwarding Equivalence Class (FEC): A subset of packets that are all treated the same way by an LSR. A packet is assigned to an FEC at the ingress of an MPLS domain. Subset can be based on Address prefix Host address QoS
69 Forwarding Equivalence Class Assume packets have the destination address and QoS requirements as qos = 1 FEC 1 label A qos = 1 FEC 2 label B qos = 3 FEC 3 label C qos = 4 FEC 4 label D qos = 3 FEC 3 label C
70 LABEL DISTRIBUTION PROTOCOL (LDP) LDP is the set of procedures to inform other LSRs about binding between FEC and label. Piggyback on existing protocols(bgp, OSPF,RSVP) Separate Label Distribution Protocol
71 MPLS LSPS ESTABLISHING Static Configuration -Operator can provision LSPs by statically configuring label mappings at each LSRs.
72 MPLS LSPS ESTABLISHING- LDP LDP can have two types of neighbors: 1. Directly connected neighbor LDP uses UDP hello messages sent on port 646 to all the routers Multicast address ( ) to discover directly connected neighbors. 2. Non-directly connected neighbor LDP has the ability to establish LDP session with a router two or more hops away. Hellos in this case are unicast to the peer router using UDP port Hello DA: Dest. Port: Hello DA: Dest. Port:
73 MPLS LSPS ESTABLISHING- LDP Once two LSRs discover each other an LDP session is established over which label can be advertised. LDP session runs over TCP over port 646. Session is maintained by periodic exchange of Keep Alive Messages. Hello Exchange TCP Session Session Keep Alive Label Exchange
74 MPLS LSPS ESTABLISHING- RSVP TE The ingress LSR computes a path to egress LSR using the CSPF algorithm. The computed path is encoded into an Explicit Route Object (ERO) and included in RSVP TE Path messages. Each router along the path creates state for the path and forwards the message to the next router in ERO. Egress LSR validates the path message and creates a Resv message containing a Label for the LSP. The Resv message is sent back to ingress LSR on the same path followed by path message.
75 LABEL DISTRIBUTION METHODS Ru Rd Ru Request for Binding Rd Label-FEC Binding Unsolicited Downstream Label Distribution Rd discovers a next hop for a particular FEC Rd generates a label for the FEC and communicates the binding to Ru Ru inserts the binding into its forwarding tables Label-FEC Binding Downstream on Demand Label Distribution Ru recognizes Rd as its next-hop for an FEC A request is made to Rd for a binding between the FEC and a label If Rd recognizes the FEC and has a next hop for it, it creates a binding and replies to the Ru
76 LABEL DISTRIBUTION AND MANAGEMENT Label Distribution Control Mode Independent LSP control Ordered LSP control
77 LABEL DISTRIBUTION AND MANAGEMENT Label Retention Mode Conservative LSR maintains only valid bindings. Liberal - LSR maintains bindings other than the valid next hop, more label, quick adaptation for routing change
78 LABEL INFORMATION BASE (LIB) Table maintained by the LSRs Contents of the table Incoming label Outgoing label Outgoing path Address prefix Incoming label Address Prefix Outgoing Path Outgoing label
79 NEXT HOP LABEL FORWARDING ENTRY (NHLFE) Used for forwarding a labeled packet. Contains the following information: - Packets next hop. - Operation to be performed on label stack i.e. (One of the following) Replace the label on the label stack with a specified new label. Pop the label stack. Replace the label on the label stack with a specified new label and then push one on more specified new label onto the label stack.
80 Incoming Label Map (ILM)- Maps incoming label to NHLFE. FEC to NHLFE Map (FTN)-Maps FEC to a set of NHLFE s.
81 NHLFE, ILM AND FTN Labeled ILM Incoming Packet NHLFE Unlabeled FTN
82 LABEL STACK A labeled packet can contain more than one label. Labels are maintained in FIFO stack. Processing always done on the top label. MPLS support a hierarchy and notion of LSP Tunnel.
83 OPERATIONS ON LABEL STACK Swap Pop Push
84 OPERATION ON LABEL STACK-SWAP Labeled Packet - LSR examines label at the top of the label stack of the incoming packet. - Uses ILM to map to the appropriate NHLFE. - Encodes the new label stack into the packet and forwards. Unlabeled Packet - LSR analyses network layer header to determine FEC s. - Uses FTN to map to an NHLFE. - Encodes the new label stack into the packet and forwards.
85 OPERATION ON LABEL STACK PUSH - A new label is pushed on top of the existing label, effectively "encapsulating" the packet in another layer of MPLS. - This allows hierarchical routing of MPLS packets. POP - The label is removed from the packet, which may reveal an inner label below. - If the popped label was the last on the label stack, the packet "leaves" the MPLS tunnel. - This is usually done by the egress router and in Penultimate Hop Popping.
86 OPERATION ON LABEL STACK L1 IP SWAP L2 IP L1 IP PUSH L2 L1 IP L2 L1 IP POP L1 IP
87 Label Switched Path For each FEC, a specific path called Label Switched Path (LSP) is assigned. To set up an LSP, each LSR must Assign an incoming label to the LSP for the corresponding FEC Inform the upstream node of the assigned label Learn the label that the downstream node has assigned to the LSP Need a label distribution protocol so that an LSR can inform others of the label/fec bindings it has made. A forwarding table is constructed as the result of label distribution.
88 Label Switched Path Penultimate Hop Popping : Label Stack is popped at the penultimate LSR of LSP rather than LSP egress. Egress LSP does a single look up. Egress may not be a a LSR.
89 Label Switched Path LSP Next Hop Labeled Packet - As selected by the NHLFE entry used for forwarding that packet. FEC - As selected by the NHLFE entry indexed by a label corresponding to that FEC.
90 LABEL SWITCHED PATH -HIERARCHY Lbl-2 Lbl-1 IP Payload Level 2 LSP Label Stack -2 Lbl -1 IP Payload Lbl -1 IP Payload LSR LSR LSR Level 1 LSP Level 1 LSP Label Stack -1 Label Stack -1 LSR
91 LABEL STACK - HIERARCHY Layer 2 Header Label 3 Label 2 Label 1 IP Packet MPLS Domain 1 MPLS supports hierarchy. Each LSR processes the topmost label. MPLS Domain 2 MPLS Domain 3 If traffic crosses several networks, it can be tunneled across them Advantage reduces the LIB table of each router drastically Slide by ByTamrat Bayle, Reiji Aibara, Kouji Nishimura
92 LABEL SWITCHED PATH -TUNNEL Hop By Hop Tunnel Level 2 LSP Label Stack -2 Explicitely Routed Tunnel
93 Label Switched Path - Control Independent - Each LSR on recognizing a particular FEC makes an independent decision to bind a label to it and distribute that binding. Ordered - An LSR binds a label to a FEC only if it is the egress LSR to that FEC or it has already a binding for that FEC from its next hop for that FEC.
94 LSP Route Selection Method for selecting the LSP for a particular FEC. Hop-by-hop routing: Each node independently choose the next hop for a FEC. Explicit routing (ER): the sender LSR can specify an explicit route for the LSP Explicit route can be selected ahead of time or dynamically
95 Explicitly Routed LSP Advantages Can establish LSP s based on policy, QoS, etc. Can have pre-established LSP s that can be used in case of failures. It makes MPLS explicit routing much more efficient than the alternative of IP source routing. 95
96 AGGREGATION In the MPLS Domain, all the traffic in a set of FECs might follow the same route. The procedure of binding a single label to a union of FECs which is itself a FEC, and applying that label to all traffic in the union is known as Aggregation. Reduces the number of labels. Reduces the amount of label distribution control traffic.
97 AGGREGATION Label L1, FEC-F1 Label L2, FEC-F2 Label L3, FEC-F3 Label L, FEC-F
98 LABEL MERGING Label Merging is the capability of forwarding two different packets belonging to the same FEC, but arriving with different labels, with the same outgoing label. An LSR is label merging capable if it can receive two packets from different incoming interfaces, and/or with different labels, and send both packets out the same outgoing interface with the same label. Once transmitted, the information that they arrive from different interfaces and/or with different labels is lost.
99 MPLS PROTECTION MPLS OAM*: Fault detection and diagnosis TRAFFIC PROTECTION: Route traffic away from failed node/link. NODE PROTECTION: Enhance node availability. * Operation, Administration and Maintenance.
100 SOME MPLS TRANSPORT PROBLEMS Data plane fails ( Black Holes ). Connectivity Problem, Broken link. What path is being taken?
101 LEVERAGING MPLS OAM Difficult to detect MPLS failure: Traditional ping may not be successful Difficult to troubleshoot MPLS failure: Manual hop/hop work MPLS OAM facilitates and speeds up troubleshooting of MPLS failures.
102 LSP PING/TRACEROUTE Requirements: Solutions: - Detect MPLS Black holes. - Isolate MPLS faults. - Diagnose connectivity problems. - LSP ping for connectivity checks. - LSP traceroute for hop-by-hop fault localization. - LSP traceroute for path tracing.
103 TROUBLESHOOTING SA DA = 127/8 ECHO R1 R3 does not forward R2 echo-req to R4, replies R3 back to R1. R MPLS Echo Reply LSP Broken
104 TRAFFIC PROTECTION Detect the fault. Divert the traffic away from fault. Mechanisms: - LDP signaled LSPs - Backup LSP - Fast Reroute
105 LDP SIGNALED LSPS Path protection depends on IGP reconvergence. In case of link/node failure: i) Remove label mapping for the LSP from FIB. ii) Wait for new shortest path and matching label.
106 BACKUP LSPS Backup Path for RSVP-TE signaled LSP R6 R7 Backup path R3 R1 R2 R4 R5 Path Err
107 FAST REROUTE Repair failure at the node that detects failure (Point of Local Repair or PLR). One to one backup: Each LSR creates a detour LSP for each protected LSP. Facility Bypass: Single bypass LSP for all protected LSPs
108 LINK PROTECTION(FR) R5 Merge Point PLR R1 R2 R3 R4 Merge point is one hop away from PLR. Next Hop protection
109 NODE PROTECTION(FR) R6 R7 Merge Point PLR R1 R2 R3 R4 R5 Merge point is two hops away from PLR. Next-Next Hop protection
110 NODE PROTECTION Resilient LSRs. Software support required to take advantage of Hardware redundancy. Nonstop Routing: - Replicate all state changes to backup control card. - State synchronization required. Nonstop Forwarding: - Graceful restart of the failed node. - Protocol extensions at neighbors.
111 MPLS QOS Network can meet Qos requirement ensures Control Forwarding enforce Qos in network elements
112 MPLS QOS P P P Prioritized Queues WRED for service differentiation
113 MPLS QOS MODELS Soft QOS (Class of Service): - Forwarding plane technique. - No need for per-flow state (Scales well) - Unable to provide guaranteed forwarding behavior. Hard QOS : - Resources reserved using control plane. - Per-flow state required. - Provides firm guarantees.
114 TRANSPORT PLANE MODELS E-LSP model - Implementation of Soft QOS model. - EXP field in MPLS label. - 3 bits => up to 8 different DiffServ points. L-LSP model - Implementation of Hard QOS model. - Both Label and EXP field are considered. - Label lookup and Exp bits determine output queue and priority.
115 TRANSPORT NETWORKS: THE SERVICE PROVIDER PERSPECTIVE Shift from best effort to guaranteed services. Focus on revenue bearing services. Support for varied application requirements. Flexible on-demand service granularity. High QoS, Reliability. Operations, Administration, and Maintenance features. Low CAPEX and OPEX networks 115 Yesterday Today Tomorrow
116 Efficiency and Flexibility Service Guarantees with Reliability PACKET TECHNOLOGIES (e.g. IP/MPLS, Carrier Ethernet) CIRCUIT TECHNOLOGIES POSSIBLE SOLUTION (e.g. SONET/SDH) Packet- Optical Transport System (P-OTS) Multi-Layer Optimized transport for flexible, reliable and scalable networks 116 9/21/2015
117 Very fast communication framework combining switching, routing and transport in single layer TCP/UDP Omnipresent Ethernet IP Application Layer Transport Layer Network Layer Ethernet Data-Link Layer OMNIPRESENT ETHERNET (OE) Physical Layer 117 9/21/2015
118 CONTEMPORARY NETWORKING HIERARCHY Access, Metro and core networks 118
119 Formulate physical network into a logical hierarchical tree Simplify the network into a fractal binary tree Fig. 1a. Physical topology of the network. Binary Routing Packet switching based on the bit value corresponding to the node 0 indicates right-ward movement while a 1 indicates left-ward movement Advantages: A I J K H O G Simple lookup Energy efficient Source routing Cost, cost, cost!!!!! B L D M N E F A B 0 1 I L J 1 D 1 0 H K M 1 N E O G F 119
120 EXAMPLE OF CONVERSION TO A BINARY TREE Campus node (large switch) Gateway Virtual (dummy) node created Campus node (large switch) MTU - switch Laptop computer IBM Compatible IBM Compatible Mac Classic Workstation Laptop computer Source A C N j E I J N q MTU - switch D 10 N i B F G K N L O Destination H M N r
121 C E Source A N j I J N q D 10 N i B F G L K O N Destination H M N r 121
122 Creating Virtual Topology Binary Routing Binary Routing Network Graph Logical Tree Logical Binary Tree Source Routing CONCEPT OF OE 122 9/21/2015
123 Discard common MSBs Source S-ARTAG Destination S-ARTAG Complement Source S-ARTAG except MSB Lowest common ancestor 1 0 Root ADDRESSING AND ROUTING 0001 IN OE BASED TREES Discard MSB of Destination S-ARTAG Reverse Destination S-ARTAG Final R-ARTAG Source S-ARTAG Destination S-ARTAG 123 9/21/2015
124 Ethernet frame IP address with data Identifier IPV4 IP address IPV6 Binary Tag Ethernet header Omnipresent Ethernet another avatar of MPLS and SDNs dat a MAC 1010 Port S/CTAG Ethernet data mapped onto OE packet Ethernet header used for L2 protocol.
125
126 UNICAST PACKET FLOW Output Port Decoder Input Port Logic Output Port 0 TELL Table Route Calculator QDR II+ QDR II+ QDR II+ QDR II+ Output Port 1 Memory Arbiter Rate Limiter Write State Machine Memory Mgmt. Unit Read State Machine Port 1 Output Port 2 OE Framing/ De-framing Port Control Logic and Multicast Handler Port 2 Frame Buffer Port N-1 Contention Resolution Logic (Port 2) Switch Fabric Output Port N /21/2015
127 THE CESR HARDWARE Fig 1. The Carrier Ethernet Switch Router(CESR) hardware
128 THE V SERIES CORE ROUTER, LONG HAUL TRANSPORT, TUNABLE WDM SUPPORT WITH CARRIER ETHERNET State-of-the-art transport solution km reach without regen. 96 Gbps cross connect OTN as ODU2 compliant FEC entries PseudoWire emulation. Deep buffers for packet processing 3-5 microsecond latency. Multicast, 4 level QoS support. Dense Wavelength Division Multiplexing technology for super fiber utilization. Applications: metro transport, regional transport, multi-gigabit router, National Knowledge Network transport, enterprise backbone and Carrier Ethernet. 128
129 STATISTICS O1000 LX240T (IPv4) O1000 LX365T (IPv6) O1010 LX365T O100 LX150T FPGA device Utilization 92% 67% 71% 71% BRAM Utilization 59% 61% 74% 74% Lines of code (VHDL) 1,28,405* 1,28,405* 68,302** 68,302** Lines of code (NMS) 16,142 16,142 16,142 16,142 Lines of code Web based NMS PCB stats 50, , , ,000 + R ~ 500, C ~ different components R ~ 500, C ~ different components R ~ 300, C ~ different components R ~ 700, C ~ different components Total components *O1000 code statistics includes test code **O100 and O1010 code statistics exclude common files from O1000.
130 Latency COMPARISON Juniper M- 120 Cisco GSR Cisco 6700 Cisco 3550 Arista Omnipresent Ethernet Protocol depth 130
131 Port-to-port latency = 1.2 microsecond OTN support for long reach without 3R DWDM optics supported E-LINE, E-LAN service support for MAC,IPv4,IPv6, CTAG, STAG, port based identifiers CESRS DEVELOPED 131 9/21/2015
132 RailTel Western Region Network 22 nodes 23 links Working Path Protection Path EXPERIMENTAL TEST-BED DESCRIPTION 132 9/21/2015
133 CESR 2 Fiber Links JDSU MTS-6000 Client Node-1 CESR 1 TEST-BED PHOTOGRAPH NMS JDSU MTS-6000 Client Node /21/2015
INF5050 Protocols and Routing in Internet (Friday ) Subject: IP-router architecture. Presented by Tor Skeie
INF5050 Protocols and Routing in Internet (Friday 9.2.2018) Subject: IP-router architecture Presented by Tor Skeie High Performance Switching and Routing Telecom Center Workshop: Sept 4, 1997. This presentation
More informationProfessor Yashar Ganjali Department of Computer Science University of Toronto.
Professor Yashar Ganjali Department of Computer Science University of Toronto yganjali@cs.toronto.edu http://www.cs.toronto.edu/~yganjali Today Outline What this course is about Logistics Course structure,
More informationMulti-Protocol Label Switching
Rheinisch-Westfälische Technische Hochschule Aachen Lehrstuhl für Informatik IV Prof. Dr. rer. nat. Otto Spaniol Multi-Protocol Label Switching Seminar: Datenkommunikation und Verteilte Systeme SS 2003
More informationRouters Technologies & Evolution for High-Speed Networks
Routers Technologies & Evolution for High-Speed Networks C. Pham Université de Pau et des Pays de l Adour http://www.univ-pau.fr/~cpham Congduc.Pham@univ-pau.fr Router Evolution slides from Nick McKeown,
More informationComputer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
More informationLARGE SCALE IP ROUTING LECTURE BY SEBASTIAN GRAF
LARGE SCALE IP ROUTING LECTURE BY SEBASTIAN GRAF MODULE 05 MULTIPROTOCOL LABEL SWITCHING (MPLS) AND LABEL DISTRIBUTION PROTOCOL (LDP) 1 by Xantaro IP Routing In IP networks, each router makes an independent
More informationMulti Protocol Label Switching (an introduction) Karst Koymans. Thursday, March 12, 2015
.. MPLS Multi Protocol Label Switching (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 4.3, 2015/03/09 13:07:57) Thursday, March 12, 2015 Karst Koymans (UvA) MPLS
More informationIntroduction to MPLS APNIC
Introduction to MPLS APNIC Issue Date: [201609] Revision: [01] What is MPLS? 2 Definition of MPLS Multi Protocol Label Switching Multiprotocol, it supports ANY network layer protocol, i.e. IPv4, IPv6,
More informationTable of Contents Chapter 1 MPLS Basics Configuration
Table of Contents Table of Contents... 1-1 1.1 MPLS Overview... 1-1 1.1.1 Basic Concepts of MPLS... 1-2 1.1.2 Architecture of MPLS... 1-5 1.1.3 MPLS and Routing Protocols... 1-7 1.1.4 Applications of MPLS...
More informationMPLS MULTI PROTOCOL LABEL SWITCHING OVERVIEW OF MPLS, A TECHNOLOGY THAT COMBINES LAYER 3 ROUTING WITH LAYER 2 SWITCHING FOR OPTIMIZED NETWORK USAGE
MPLS Multiprotocol MPLS Label Switching MULTI PROTOCOL LABEL SWITCHING OVERVIEW OF MPLS, A TECHNOLOGY THAT COMBINES LAYER 3 ROUTING WITH LAYER 2 SWITCHING FOR OPTIMIZED NETWORK USAGE Peter R. Egli 1/21
More information2D1490 p MPLS, RSVP, etc. Olof Hagsand KTHNOC/NADA
2D1490 p4 2007 MPLS, RSVP, etc Olof Hagsand KTHNOC/NADA Literature Handouts: MPLS-Enabled applications (Minei, Lucek). Parts of Section 1. JunOS Cookbook: Chapter 14 Background MPLS - Multiprotocol Label
More informationVendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Multiprotocol Label Switching. Version: Demo
Vendor: Alcatel-Lucent Exam Code: 4A0-103 Exam Name: Alcatel-Lucent Multiprotocol Label Switching Version: Demo QUESTION 1 You wish to advertise LDP labels for all local networks; which is the most effective
More informationBrainDumps.4A0-103,230.Questions
BrainDumps.4A0-103,230.Questions Number: 4A0-103 Passing Score: 800 Time Limit: 120 min File Version: 11.02 http://www.gratisexam.com/ A "brain dump," as it relates to the certification exams, is a source
More informationIntroduction to MPLS. What is MPLS? 1/23/17. APNIC Technical Workshop January 23 to 25, NZNOG2017, Tauranga, New Zealand. [201609] Revision:
Introduction to MPLS APNIC Technical Workshop January 23 to 25, 2017. NZNOG2017, Tauranga, New Zealand. Issue Date: [201609] Revision: [01] What is MPLS? 2 1 Definition of MPLS Multi Protocol Label Switching
More informationTopics for Today. Network Layer. Readings. Introduction Addressing Address Resolution. Sections 5.1,
Topics for Today Network Layer Introduction Addressing Address Resolution Readings Sections 5.1, 5.6.1-5.6.2 1 Network Layer: Introduction A network-wide concern! Transport layer Between two end hosts
More informationSyed Mehar Ali Shah 1 and Bhaskar Reddy Muvva Vijay 2* 1-
International Journal of Basic and Applied Sciences Vol. 3. No. 4 2014. Pp. 163-169 Copyright by CRDEEP. All Rights Reserved. Full Length Research Paper Improving Quality of Service in Multimedia Applications
More informationAdvanced Telecommunications
ternet Routing - MPLS By Richard Harris MPLS Presentation line troduction Problems of ternet size Methods for overcoming potential problems What is MPLS? Overview MPLS terminology MPLS Architecture The
More informationScaling routers: Where do we go from here?
Scaling routers: Where do we go from here? HPSR, Kobe, Japan May 28 th, 2002 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University nickm@stanford.edu www.stanford.edu/~nickm
More informationRouters: Forwarding EECS 122: Lecture 13
Routers: Forwarding EECS 122: Lecture 13 epartment of Electrical Engineering and Computer Sciences University of California Berkeley Router Architecture Overview Two key router functions: run routing algorithms/protocol
More informationMPLS LSP Ping Traceroute for LDP TE and LSP Ping for VCCV
MPLS LSP Ping Traceroute for LDP TE and LSP Ping for VCCV The MPLS LSP Ping/Traceroute for LDP/TE, and LSP Ping for VCCV feature helps service providers monitor label switched paths (LSPs) and quickly
More informationTelematics Chapter 7: MPLS
Telematics Chapter 7: MPLS User watching video clip Beispielbild Application Layer Presentation Layer Session Layer Transport Layer Server with video clips Application Layer Presentation Layer Session
More informationTestking.4A0-103,249.QA 4A Alcatel-Lucent Multi Protocol Label Switching
Testking.4A0-103,249.QA Number: 4A0-103 Passing Score: 800 Time Limit: 120 min File Version: 6.0 http://www.gratisexam.com/ 4A0-103 Alcatel-Lucent Multi Protocol Label Switching 1. These are the most accurate
More informationMPLS etc.. MPLS is not alone TEST. 26 April 2016 AN. Multi-Protocol Label Switching MPLS-TP FEC PBB-TE VPLS ISIS-TE MPƛS GMPLS SR RSVP-TE OSPF-TE PCEP
Multi-Protocol Label Switching MPLS-TP FEC VPLS PBB-TE MPLS etc.. MPLS is not alone LDP MPLS-TE LABEL MP-BGP LSP TAG H-VPLS 26 April 2016 AN TEST GMPLS SR T-MPLS ISIS-TE MPƛS OSPF-TE PCEP Multi-Protocol
More informationHP 5920 & 5900 Switch Series
HP 5920 & 5900 Switch Series MPLS Configuration Guide Part number: 5998-4676a Software version: Release 23xx Document version: 6W101-20150320 Legal and notice information Copyright 2015 Hewlett-Packard
More informationMPLS Intro. Cosmin Dumitru March 14, University of Amsterdam System and Network Engineering Research Group ...
MPLS Intro Cosmin Dumitru c.dumitru@uva.nl University of Amsterdam System and Network Engineering Research Group March 14, 2011 Disclaimer Information presented in these slides may be slightly biased towards
More information6 MPLS Model User Guide
6 MPLS Model User Guide Multi-Protocol Label Switching (MPLS) is a multi-layer switching technology that uses labels to determine how packets are forwarded through a network. The first part of this document
More informationHP Routing Switch Series
HP 12500 Routing Switch Series MPLS Configuration Guide Part number: 5998-3414 Software version: 12500-CMW710-R7128 Document version: 6W710-20121130 Legal and notice information Copyright 2012 Hewlett-Packard
More informationPrepAwayExam. High-efficient Exam Materials are the best high pass-rate Exam Dumps
PrepAwayExam http://www.prepawayexam.com/ High-efficient Exam Materials are the best high pass-rate Exam Dumps Exam : 4A0-103 Title : Alcatel-Lucent Multi Protocol Label Switching Vendor : Alcatel-Lucent
More informationMPLS Multi-Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Computer Networks Design and Management - 1 MPLS: introduction
More informationMultiProtocol Label Switching - MPLS ( RFC 3031 )
Outline MultiProtocol Label Switching - MPLS ( RFC 3031 ) 1. What is MPLS and how does it work? 2. What MPLS is used for? 3. Label Distribution Protocols 1 1. What is MPLS and how does it work? MPLS is
More informationProblem Statement. Algorithm MinDPQ (contd.) Algorithm MinDPQ. Summary of Algorithm MinDPQ. Algorithm MinDPQ: Experimental Results.
Algorithms for Routing Lookups and Packet Classification October 3, 2000 High Level Outline Part I. Routing Lookups - Two lookup algorithms Part II. Packet Classification - One classification algorithm
More informationسوي يچينگ و مسيريابي در شبكه
سوي يچينگ و مسيريابي در شبكه دكتر فرهاد فغاني استاديار دانشكده مهندسي برق قسمت ششم : Multi-Protocol Label Switching (MPLS) 1 One of the many ways of getting from A to B: BROADCAST: Go everywhere, stop
More informationMultiprotocol Label Switching (MPLS)
Multiprotocol Label Switching (MPLS) Petr Grygárek rek 1 Technology Basics Integrates label-based forwarding paradigm with network layer routing label forwarding + label swapping similar to ATM/FR switching
More informationInternet Routing - MPLS. By Richard Harris
Internet Routing - MPLS By Richard Harris MPLS Presentation Outline Introduction Problems of Internet size Methods for overcoming potential problems What is MPLS? Overview MPLS terminology MPLS Architecture
More informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2017 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński MPLS Multiprotocol Label Switching MPLS introduction
More informationAhmed Benallegue RMDCN workshop on the migration to IP/VPN 1/54
MPLS Technology Overview Ahmed Benallegue A.Benallegue@ecmwf.int RMDCN workshop on the migration to IP/VPN 1/54 Plan 1. MPLS basics 2. The MPLS approach 3. Label distribution RSVP-TE 4. Traffic Engineering
More informationMultiprotocol Label Switching (MPLS)
Multiprotocol Label Switching (MPLS) Petr Grygárek rek 1 Technology in Brief Inserts underlying label-based forwarding layer under traditional network layer routing label forwarding + label swapping similar
More informationMPLS Multi-protocol label switching Mario Baldi Politecnico di Torino (Technical University of Torino)
MPLS Multi-protocol label switching Mario Baldi Politecnico di Torino (Technical University of Torino) http://staff.polito.it/mario.baldi MPLS - 1 From MPLS Forum Documents MPLS is the enabling technology
More informationHP MSR Router Series. MPLS Configuration Guide(V7) Part number: Software version: CMW710-R0106 Document version: 6PW
HP MSR Router Series MPLS Configuration Guide(V7) Part number: 5998-5680 Software version: CMW710-R0106 Document version: 6PW100-20140607 Legal and notice information Copyright 2014 Hewlett-Packard Development
More informationMulti Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network Management and QoS Provisioning - 1 MPLS: introduction
More informationOperation Manual MPLS. Table of Contents
Table of Contents Table of Contents Chapter 1 MPLS Architecture... 1-1 1.1 MPLS Overview... 1-1 1.2 MPLS Basic Concepts... 1-1 1.2.1 FEC... 1-1 1.2.2 Label... 1-1 1.2.3 LDP... 1-3 1.3 MPLS Architecture...
More informationMPLS LSP Ping/Traceroute for LDP/TE, and LSP Ping for VCCV
MPLS LSP Ping/Traceroute for LDP/TE, and LSP Ping for VCCV First Published: January 26, 2004 Last Updated: February 27, 2009 The MPLS LSP Ping/Traceroute for LDP/TE, and LSP Ping for VCCV feature helps
More informationTable of Contents. Cisco MPLS FAQ For Beginners
Table of Contents MPLS FAQ For Beginners...1 Document ID: 4649...1 Questions...1 Introduction...1 Q. What is Multi Protocol Label Switching (MPLS)?...1 Q. What is a label? What is the structure of the
More informationTag Switching. Background. Tag-Switching Architecture. Forwarding Component CHAPTER
CHAPTER 23 Tag Switching Background Rapid changes in the type (and quantity) of traffic handled by the Internet and the explosion in the number of Internet users is putting an unprecedented strain on the
More informationIntroduction to Multi-Protocol Label
Introduction to Multi-Protocol Label Switching (MPLS) Matthew Bocci, Alcatel-Lucent IP Division Agenda History of MPLS Standardisation MPLS Architecture Control Plane QoS and Traffic Engineering Protection
More informationRouters: Forwarding EECS 122: Lecture 13
Input Port Functions Routers: Forwarding EECS 22: Lecture 3 epartment of Electrical Engineering and Computer Sciences University of California Berkeley Physical layer: bit-level reception ata link layer:
More informationTrafffic Engineering 2015/16 1
Traffic Engineering 2015/2016 Traffic Engineering: from ATM to MPLS fernando.silva@tecnico.ulisboa.pt Instituto Superior Técnico Trafffic Engineering 2015/16 1 Outline Traffic Engineering revisited Traffic
More informationMPLS etc.. 9 May 2017 AN
MPLS etc.. 9 May 2017 AN Multi-Protocol Label Switching MPLS-TP FEC VPLS PBB-TE LDP MPLS-TE LABEL MP-BGP MPLS is not alone LSP TAG H-VPLS GMPLS ISIS-TE MPƛS RSVP-TE SR OSPF-TE T-MPLS PCEP Multi-Protocol
More informationLabel Distribution Protocol and Basic MPLS Configuration. APNIC Technical Workshop October 23 to 25, Selangor, Malaysia Hosted by:
Label Distribution Protocol and Basic MPLS Configuration APNIC Technical Workshop October 23 to 25, 2017. Selangor, Malaysia Hosted by: Issue Date: [201609] Revision: [01] Label Distribution Protocol 2
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
More informationService Providers Networks & Switching (MPLS) 20/11/2009. Local Team
Service Providers Networks & Benefits of Multi Protocol Label Switching (MPLS) 20/11/2009 Local Team Service Provider Networks & Carrier Networks A telephone company (or telco) provides telecommunication
More informationHP MSR Router Series. MPLS Configuration Guide(V5) Part number: Software version: CMW520-R2513 Document version: 6PW
HP MSR Router Series MPLS Configuration Guide(V5) Part number: 5998-8188 Software version: CMW520-R2513 Document version: 6PW106-20150808 Legal and notice information Copyright 2015 Hewlett-Packard Development
More informationMPLS VPN. 5 ian 2010
MPLS VPN 5 ian 2010 What this lecture is about: IP CEF MPLS architecture What is MPLS? MPLS labels Packet forwarding in MPLS MPLS VPNs 3 IP CEF & MPLS Overview How does a router forward packets? Process
More informationPractice exam questions for the Nokia NRS II Composite Exam
Practice exam questions for the Nokia NRS II Composite Exam The following questions will test your knowledge and prepare you for the Nokia NRS II Composite Exam. Compare your responses with the Answer
More informationENTERPRISE MPLS. Kireeti Kompella
ENTERPRISE MPLS Kireeti Kompella AGENDA The New VLAN Protocol Suite Signaling Labels Hierarchy Signaling Advanced Topics Layer 2 or Layer 3? Resilience and End-to-end Service Restoration Multicast ECMP
More informationMPLS. 9 March 2018 AN
MPLS 9 March 2018 AN Multi-Protocol Label Switching MPLS-TP MP-BGP H-VPLS OSPF-TE LIB MPLS is not alone LSP ISIS-TE EVPN GMPLS MPLS-TE T-MPLS LFIB LABEL LDP TAG Used in many (most?) provider networks to
More informationSYSC 5801 Protection and Restoration
SYSC 5801 Protection and Restoration Introduction Fact: Networks fail. Types of failures: Link failures Node failures Results: packet losses, waste of resources, and higher delay. What IGP does in the
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 8: IP Router Design Many portions courtesy Nick McKeown Overview Router basics Interconnection architecture Input Queuing Output Queuing Virtual output Queuing
More informationMPLS Core Networks Николай Милованов/Nikolay Milovanov
Label Assignment and Distribution Николай Милованов/Nikolay Milovanov Contents Label Assignment and Distribution Typical Label Distribution in Packet-mode MPLS Convergence in Packet-mode MPLS MPLS Label
More informationNetwork Superhighway CSCD 330. Network Programming Winter Lecture 13 Network Layer. Reading: Chapter 4
CSCD 330 Network Superhighway Network Programming Winter 2015 Lecture 13 Network Layer Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-2007
More information100 GBE AND BEYOND. Diagram courtesy of the CFP MSA Brocade Communications Systems, Inc. v /11/21
100 GBE AND BEYOND 2011 Brocade Communications Systems, Inc. Diagram courtesy of the CFP MSA. v1.4 2011/11/21 Current State of the Industry 10 Electrical Fundamental 1 st generation technology constraints
More informationSecurizarea Calculatoarelor și a Rețelelor 32. Tehnologia MPLS VPN
Platformă de e-learning și curriculă e-content pentru învățământul superior tehnic Securizarea Calculatoarelor și a Rețelelor 32. Tehnologia MPLS VPN MPLS VPN 5-ian-2010 What this lecture is about: IP
More informationA Comparison Of MPLS Traffic Engineering Initiatives. Robert Pulley & Peter Christensen
A Comparison Of MPLS Traffic Engineering Initiatives Robert Pulley & Peter Christensen Need for MPLS Problems in today's network QoS and CoS requirements Need for Resource Reservation Why not RSVP MPLS
More informationConfiguration Guide - MPLS
Release: Document Revision: 5.3 01.01 www.nortel.com NN46240-506 324560-A Rev01 Release: 5.3 Publication: NN46240-506 Document Revision: 01.01 Document status: Standard Document release date: 30 March
More informationEE 122: Router Design
Routers EE 22: Router Design Kevin Lai September 25, 2002.. A router consists - A set of input interfaces at which packets arrive - A set of output interfaces from which packets depart - Some form of interconnect
More informationLDP Fast Reroute using LDP Downstream On Demand. 1. Problem: 2. Summary: 3. Description:
LDP Fast Reroute using LDP Downstream On Demand 1. Problem: LDP is a widely used label distribution protocol used for building end-to-end IP/MPLS LSPs across provider network. Many times critical IP applications
More informationMPLS MPLS. Basically: 9 March 2018 AN. Multi-Protocol Label Switching. A bit of history. Multi-Protocol Label Switching.
Multi-Protocol Label Switching MPLS-TP MP-BGP H-VPLS OSPF-TE LIB MPLS MPLS is not alone LSP ISIS-TE EVPN GMPLS MPLS-TE 9 March 2018 AN T-MPLS LFIB LABEL LDP TAG Used in many (most?) provider networks to
More informationMPLS/Tag Switching. Background. Chapter Goals CHAPTER
28 CHAPTER Chapter Goals Understand the advantages of MPLS. Learn the components of an MPLS system. Compare and contrast MPLS and hop-by-hop routing. Describe the two methods of label distribution. Explain
More informationQuality of Service in the Internet. QoS Parameters. Keeping the QoS. Leaky Bucket Algorithm
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationPUSHING THE LIMITS, A PERSPECTIVE ON ROUTER ARCHITECTURE CHALLENGES
PUSHING THE LIMITS, A PERSPECTIVE ON ROUTER ARCHITECTURE CHALLENGES Greg Hankins APRICOT 2012 2012 Brocade Communications Systems, Inc. 2012/02/28 Lookup Capacity and Forwarding
More informationmpls ldp atm vc-merge through mpls static binding ipv4
mpls ldp atm vc-merge through mpls static binding ipv4 mpls ldp atm vc-merge, page 3 mpls ldp autoconfig, page 5 mpls ldp backoff, page 7 mpls ldp discovery, page 9 mpls ldp discovery transport-address,
More informationMPLS. David Byers. IDA/ADIT/IISLAB David Byers
MPLS David Byers davby@ida.liu.se IDA/ADIT/IISLAB 1 Why MPLS More efficient backbone routing Support for end-to-end QoS Improved link utilization Rapid recovery from failures Improved route control MPLS
More informationDa t e: August 2 0 th a t 9: :00 SOLUTIONS
Interne t working, Examina tion 2G1 3 0 5 Da t e: August 2 0 th 2 0 0 3 a t 9: 0 0 1 3:00 SOLUTIONS 1. General (5p) a) Place each of the following protocols in the correct TCP/IP layer (Application, Transport,
More informationCisco Training - HD Telepresence MPLS: Implementing Cisco MPLS V3.0. Upcoming Dates. Course Description. Course Outline
Cisco Training - HD Telepresence MPLS: Implementing Cisco MPLS V3.0 From the technology basics to advanced VPN configuration. $3,995.00 5 Days Upcoming Dates Dec 10 - Dec 14 Mar 25 - Mar 29 Course Description
More informationGMPLS Overview Generalized MPLS
GMPLS Overview Generalized MPLS Hanyang Univ ( jijung@hanyang.ac.kr ) Outline GMPLS Overview Draft-ietf-ccamp-gmpls-architecture-00.txt GMPLS IGP Extension Draft-ietf-ccamp-ospf-gmpls-extensions-00.txt
More informationMultiprotocol Label Switching (MPLS)
Multiprotocol Label Switching (MPLS) Petr Grygárek rek 1 Technology in Brief Inserts underlying label-based forwarding layer under traditional network layer routing label forwarding + label swapping similar
More informationA Segment Routing (SR) Tutorial. R. Bonica NANOG70 June 6, 2017
A Segment Routing (SR) Tutorial R. Bonica NANOG70 June 6, 2017 AKA: SPRING IETF Standardization Source Packet Routing In Networking (SPRING) WG ISIS, OSPF, IDR and MPLS WGs What is SR? A tunneling technology
More informationSegment Routing MPLS OAM Support
Segment Routing Operations, Administration, and Maintenance (OAM) helps service providers to monitor label-switched paths (LSPs) and quickly isolate forwarding problems to assist with fault detection and
More informationMultiprotocol Label Switching (MPLS)
36 CHAPTER Prerequisites for MPLS, page 36-1 Restrictions for MPLS, page 36-1 Information About MPLS, page 36-2 Default Settings for MPLS, page 36-7 How to Configure MPLS Features, page 36-7 Configuration
More informationHP A-MSR Router Series MPLS. Configuration Guide. Abstract
HP A-MSR Router Series MPLS Configuration Guide Abstract This document describes the software features for the HP A Series products and guides you through the software configuration procedures. These configuration
More informationSegment Routing MPLS OAM Support
Segment Routing Operations, Administration, and Maintenance (OAM) helps service providers to monitor label-switched paths (LSPs) and quickly isolate forwarding problems to assist with fault detection and
More informationMPLS Networks: Design and Routing Functions
MPLS Networks: Design and Routing Functions Course Description This course provides an understanding of how MPLS works its advantages and limitations and how it can be deployed to provide effective services
More informationCore Networks Evolution
Core Networks Evolution Prof. Daniel Kofman daniel.kofman@enst.fr Telecom Paris - ENST Content Any Service, Any Time, Everywhere, Everyone Towards the triple play and beyond Main trends in Core Networks
More informationInternational Workshop NGNT 31. DiffServ and MPLS. Tímea Dreilinger
International Workshop NGNT 31 DiffServ and MPLS Tímea Dreilinger Abstract Multi Protocol Label Switching (MPLS) technology enables Internet Service Providers to scale their current offerings, and exercise
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11 1 Midterm exam Midterm this Thursday Close book but one-side 8.5"x11" note is allowed (must
More informationCSCD 330 Network Programming
CSCD 330 Network Programming Network Superhighway Spring 2018 Lecture 13 Network Layer Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-2007
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for
More informationConfiguring MPLS, MPLS VPN, MPLS OAM, and EoMPLS
CHAPTER 43 Configuring MPLS, MPLS VPN, MPLS OAM, and EoMPLS This chapter describes how to configure multiprotocol label switching (MPLS) and Ethernet over MPLS (EoMPLS) on the Cisco ME 3800X and ME 3600X
More informationMPLS Introduction. (C) Herbert Haas 2005/03/11
MPLS Introduction MPLS (C) Herbert Haas 2005/03/11 Terminology LSR LER FEC LSP FIB LIB LFIB TIB PHP LDP TDP RSVP CR-LDP Label Switch Router Label Edge Router Forwarding Equivalent Class Label Switched
More informationConfiguring MPLS and EoMPLS
37 CHAPTER This chapter describes how to configure multiprotocol label switching (MPLS) and Ethernet over MPLS (EoMPLS) on the Catalyst 3750 Metro switch. MPLS is a packet-switching technology that integrates
More informationMPLS VPN Inter-AS Option AB
First Published: December 17, 2007 Last Updated: September 21, 2011 The feature combines the best functionality of an Inter-AS Option (10) A and Inter-AS Option (10) B network to allow a Multiprotocol
More informationHands-On Metro Ethernet Carrier Class Networks
Hands-On Carrier Class Networks Course Description Carriers have offered connectivity services based on traditional TDM, Frame Relay and ATM for many years. However customers now use Ethernet as the interface
More informationMPLS VPN--Inter-AS Option AB
The feature combines the best functionality of an Inter-AS Option (10) A and Inter-AS Option (10) B network to allow a Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) service provider
More informationConfiguration MPLS Avaya Secure Router 2330/4134
Configuration MPLS Avaya Secure Router 2330/4134 Release 10.3.5 NN47263-505 Issue 04.02 August 2013 2013 Avaya Inc. All Rights Reserved. Notice While reasonable efforts have been made to ensure that the
More informationMPLS Multi-protocol label switching Mario Baldi Politecnico di Torino (Technical University of Torino)
MPLS Multi-protocol label switching Mario Baldi Politecnico di Torino (Technical University of Torino) http://staff.polito.it/mario.baldi MPLS - 1 MPLS - 2 Copyright notice This set of transparencies,
More informationQuality of Service in the Internet
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationCloud e Datacenter Networking
Cloud e Datacenter Networking Università degli Studi di Napoli Federico II Dipartimento di Ingegneria Elettrica e delle Tecnologie dell Informazione DIETI Laurea Magistrale in Ingegneria Informatica Prof.
More informationAlcatel-Lucent 7705 SERVICE AGGREGATION ROUTER OS RELEASE 6.0.R4 MPLS GUIDE MPLS GUIDE
MPLS GUIDE Alcatel-Lucent 7705 SERVICE AGGREGATION ROUTER OS RELEASE 6.0.R4 MPLS GUIDE Alcatel-Lucent Proprietary This document contains proprietary information of Alcatel-Lucent and is not to be disclosed
More informationMPLS опорни мрежи MPLS core networks
MPLS опорни мрежи MPLS core networks Николай Милованов/Nikolay Milovanov http://niau.org Objectives Identify the drawbacks of traditional IP routing Describe basic MPLS concepts and LSR types. MPLS Labels
More informationNetwork layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai
Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai Routers.. A router consists - A set of input interfaces at which packets arrive - A set of output interfaces from which
More information