Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Label scalability of Carrier Ethernet Benchmarking Carrier Ethernet Technologies Workshop Session.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Path Splicing with Network Slicing
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Interconnection: Switching and Bridging CS 4251: Computer Networking II Nick Feamster Fall 2008.
APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
Shortest Path Bridging IEEE 802
QoS-aware Traffic Protection for Access Rings Srivas Chennu Kai Habel Klaus-Dieter Langer.
Slide 111 May 2008 Point-to-Multipoint in 802.1Qay Nurit Sprecher, Nokia Siemens Networks Hayim Porat, Ethos Networks.
Floating Cloud Tiered Internet Architecture Current: Rochester Institute of Technology, Rensselaer Polytechnic Institute, University of Nevada, Reno Level.
BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS DEPARTMENT OF TELECOMMUNICATIONS AND MEDIA INFORMATICS BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS.
BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS Budapest University of Technology and Economics Verification of RSTP Convergence and Scalability by Measurements.
CCNA3: Switching Basics and Intermediate Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Switching Concepts Introduction to Ethernet/802.3 LANs Introduction.
University of Calgary – CPSC 441.  We need to break down big networks to sub-LANs  Limited amount of supportable traffic: on single LAN, all stations.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.
Restoration by Path Concatenation: Fast Recovery of MPLS Paths Anat Bremler-Barr Yehuda Afek Haim Kaplan Tel-Aviv University Edith Cohen Michael Merritt.
Jaringan Komputer Lanjut Packet Switching Network.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
CSE 534 Fundamentals of Computer Networks Lecture 4: Bridging (From Hub to Switch by Way of Tree) Based on slides from D. Choffnes Northeastern U. Revised.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
Communication operations Efficient Parallel Algorithms COMP308.
1 A Fast IP Lookup Scheme for Longest-Matching Prefix Authors: Lih-Chyau Wuu, Shou-Yu Pin Reporter: Chen-Nien Tsai.
Research & development MSTP-TE Load Balancing: Some results Benchmarking Carrier Ethernet Technologies Session AI.3 Krakow, Poland - April 30, 2008 Rémi.
Path Protection in MPLS Networks Using Segment Based Approach.
Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Research & development Traffic Engineering over Ethernet Bridged Networks Benchmarking Carrier Ethernet Technologies Session MII.3 Krakow, Poland - April.
A Study of MPLS Department of Computing Science & Engineering DE MONTFORT UNIVERSITY, LEICESTER, U.K. By PARMINDER SINGH KANG
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Network Layer (3). Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service for other.
Routing and Routing Protocols Dynamic Routing Overview.
TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.
University of the Western Cape Chapter 11: Routing Aleksandar Radovanovic.
Introduction to Network Layer. Network Layer: Motivation Can we built a global network such as Internet by extending LAN segments using bridges? –No!
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Protection and Restoration Definitions A major application for MPLS.
Click to edit Master subtitle style
Sem1 - Module 8 Ethernet Switching. Shared media environments Shared media environment: –Occurs when multiple hosts have access to the same medium. –For.
Networking and internetworking devices. Repeater.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
STORE AND FORWARD & CUT THROUGH FORWARD Switches can use different forwarding techniques— two of these are store-and-forward switching and cut-through.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
1 Chapter 3: Packet Switching (Switched LANs) Dr. Rocky K. C. Chang 23 February 2004.
Network Layer (2). Review Physical layer: move bits between physically connected stations Data link layer: move frames between physically connected stations.
Forward Search P2MP TE LSP Inter- Domain Path Computation draft-chen-pce-forward-search-p2mp-path Huaimo Chen
Multi-protocol Label Switching
Chapter-5 STP. Introduction Examine a redundant design In a hierarchical design, redundancy is achieved at the distribution and core layers through additional.
BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Advanced Computer Networks
Youngstown State University Cisco Regional Academy
Advanced Computer Networks
Lab 2 – Hub/Switch Data Link Layer
3. Internetworking (part 2: switched LANs)
Chapter 4 Data Link Layer Switching
Network Layer.
Lab 2 – Hub/Switch Data Link Layer
Intra-Domain Routing Jacob Strauss September 14, 2006.
NTHU CS5421 Cloud Computing
Dr. Rocky K. C. Chang 23 February 2004
Chapter 3 Part 3 Switching and Bridging
Connectors, Repeaters, Hubs, Bridges, Switches, Routers, NIC’s
Virtual LAN (VLAN).
Presentation transcript:

Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Label scalability of Carrier Ethernet Benchmarking Carrier Ethernet Technologies Workshop Session AI.2 - Scientific and Technical Results EuroNGI 2008, Krakow, Poland April 30, 2008 Wouter Tavernier, Koen Casier (Ghent University – IBBT) Luis Caro (University of Girona) Dimitri Papadimitriou (Alcatel-Lucent Bell NV)

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Agenda PROBLEM STATEMENT Labels in Carrier Ethernet Label scalability Label optimization Results Short word on label lookups Conclusion

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Problem statement Evolution of Ethernet being a LAN technology towards a Carrier Technology Ethernet = low cost Ethernet = ubiquitous Ethernet = plug & play LAN environments: traffic streams between tens of end-users Metro/Access environments: traffic streams between thousands of end-users PROBLEM STATEMENT: Is Carrier Ethernet able to cope with increasing number of traffic streams LAN Metro network L

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN No labels in bridged Ethernet A B C X Y Z ZCZC DestOut Port X1 Z3 A4 DestOut Port B2 X5 Z5 C3 Forwarding in native Ethernet bridging : stateless (CL) 48 bit MAC-address based SAPayloadDA 766 SyncSD EthType 2 ZCZC ZCZC ZCZC ZCZC

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Labels in Carrier Ethernet A BC D E The concept of a connection (LSP) allows for (CO): Traffic Engineering Advanced recovery/protection techniques BW guarantees Forwarding is based on a label linked to the connection state Two connections (LSPs) from A to E Two connections (LSPs) from A to E: maintains state for the green and red connection and forwards based on a label Labell

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Domain-wide PBB-TE label A BC D E Distinct routes for dest E, by diff B-VID. Ingress A has 2 LSPs to E, for e.g.: Protection switching Load balancing B-VID 100 reused on same link Label remains constant along connection (no SWAP)! E,200

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Link local ELS label A BC D E Distinct routes for dest E, by diff S-VID. Ingress A has 2 LSPs to E, for e.g.: Protection switching Load balancing Label remains constant along connection (no SWAP)! 100 Label can be swapped in intermediate hops along connection! 200 B-VID 100 reused on same link 100 S-VID 100 reused on other link

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Label usage optimization Label balancing (online routing optimized ELS) Shortest path routing takes into account labels used on a link as cost Merging (ELS) 1 incoming label per interface + 1 outgoing label GAIN: x-1 labels on outgoing local interface Shared forwarding (PBB-TE) 1 label needed GAIN: x-1 global labels x incoming

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Label scalability Given the label: How do different label schemes react under changing conditions? What is the influence of the topology? What is the influence the traffic matrix? What is the influence of the traffic matrix on typical BW usage? ELS PBB-TE

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Study assumptions Study the impact on label usage of the following dimensions: Topology (CONNECTEDNESS) Traffic matrix (SIZE, UNIFORMITY) BW usage NORMALIZATION: Tests have run 100 times Only one dimension has been changed in a time Shortest Path Routing (Dijkstra hop count) is taken as base routing algorithm Base topology of 100 nodes (connectedness +-2) & 1000 demands A B C D E i ii L i x a b L

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Connectedness of a network Connectedness of a topology: what is the average node degree of a node in a topology: ring vs. full mesh Example: Single (un-)connected 4-connected Full mesh

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Connectedness of the topology S

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Connectedness vs BW (Luis)  The topology generator considered for generating the topologies in this section is IGEN  For all the topologies the link capacity is set to 10Gb/s and bandwidth request of 100Mb, 200Mb and 300Mb are generated until the network is overloaded.  The implemented algorithm is the SPF  Overload network with links of 10G capacity A

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Connectedness vs. BW (Luis)

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Connectedness vs. BW (Luis)

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Topology size vs. BW (Luis)

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Topology size vs. BW (Luis)

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Uniformity of the traffic matrix UNIFORMITY: X demands directed to 1 vs. x destinations? Example: 4 demands 2 destinations vs 4 destinations 4 paths / 1 dest4 paths / 2 dest4 paths / 4 dest

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Uniformity of the traffic matrix S

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Size of the traffic matrix The size of a traffic matrix affects the number of demands that are routed over a network: 10 demands 100 demands 1000 demands demands …

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Scaling the order of the traffic S

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Lookups Must be Fast 1.Lookup mechanism must be simple and easy to implement 2.Memory access time is the bottleneck 200Mpps × 2 lookups/pkt = 400 Mlookups/sec → 2.5ns per lookup YearAggregate Line-rate Arriving rate of 40B POS packets (Million pkts/sec) Mb/s Gb/s Gb/s Gb/s Gb/s200

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Direct lookup in ELS vs PBB-TE ELS: Label space is 12 bits With 64b data, this is 256 K of memory. Label space is private to one link Therefore, table size can be “negotiated” SVID/MPLS-label Address Memory Data (Outgoing Port, new SVID label) Direct Memory Lookup PBB-TE: Label space is bits With 64b data, this is 64 EiB of memory (2^60). Label space is global 2^60 > 2^12, therefore cannot hold all addresses in table and use direct lookup, less efficient alternatives: Hashing Binary/Multi-way Search Trie/Tree

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Conclusion The specific traffic matrix & topology used, clearly affect label usage The uniformity of the traffic matrix affects PBB-TE-type domain-wide labelling: more uniform is better The topology connectedness affects ELS-type link-local labelling: more connected is better In typical metro-network with low node-degree, PBB-TE & ELS LL have similar performance PBB-TE with SF and ELS with merging consistently score better than alternatives Node local labelling techniques consistently score worse than alternatives. The label length affects the memory space needed and accordingly affects cost and lookup speed

Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Appendices

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Carrier-Grade Ethernet challenges Flat address space  scalability of number of MAC addresses to be learned Beyond 100k learned addresses per node seems challenging Scalability in terms of number of VLANs 12-bit VLAN ID (VID): 4k VLANs possible network wide STP cannot converge faster than worst case 20s sec (root failure) Traffic Engineering (routing) constraint by tree based structure. Limited OA&M

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Reference network A B C D E i ii L i x a b

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Assumptions (Luis)  Results are evaluated in terms of the maximum and average number of: For ELS (average calculated based on the number of links):  Labels per link  Labels per link with agg (meaning only paths are count)  Labels per link with agg and label merging For PBB-TE  Labels per destination  Labels per destination with agg (meaning only paths are count)  Labels per destination with VLAN-reut (meaning link disjoint paths can use same label)  Labels per destination with INV-trees (paths that intersect only on a common segment ending at the destination can also use the same label) B

Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Tests on smaller networks not normalized

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Uniformity in small 3-connected network S

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Connectedness in 28n network S

Label scalability & efficiency of Carrier Ethernet – Wouter Tavernier Vakgroep Informatietechnologie – Onderzoeksgroep IBCN Traffic scaling in small network S