KIREETI KOMPELLA, LOA ANDERSSON ADRIAN FARREL SPECIAL PURPOSE LABELS.

Slides:



Advertisements
Similar presentations
Quality of Service in IN-home digital networks An Architecture for QoS guarantees and Routing in Wireless/Mobile Networks Indu Mahadevany and Krishna M.
Advertisements

CST Computer Networks NAT CST 415 4/10/2017 CST Computer Networks.
Deep Label Stacks MPLS part 2, IETF 84 speaker: curtis; voice: kireeti.
Draft-kompella-mpls-larp-01 Kireeti Kompella IETF 90 Toronto, July 2014.
1 A Tree Based Router Search Engine Architecture With Single Port Memories Author: Baboescu, F.Baboescu, F. Tullsen, D.M. Rosu, G. Singh, S. Tullsen, D.M.Rosu,
CS 104 Introduction to Computer Science and Graphics Problems
Microprocessors Introduction to ia64 Architecture Jan 31st, 2002 General Principles.
IP Addressing. Dotted Decimal Notation IP addresses are written in a so-called dotted decimal notation Each byte is identified by a decimal number in.
1Group 07 IPv6 2 1.ET/06/ ET/06/ ET/06/ EE/06/ EE/06/ EE/06/6473 Group 07 IPv6.
9/8/2015 draft-bocci-mpls-tp-gach-gal-00.txt MPLS Generic Associated Channel draft-bocci-mpls-tp-gach-gal-00.txt Matthew Bocci (ALU) & Martin Vigoureux.
1 Symbol Tables The symbol table contains information about –variables –functions –class names –type names –temporary variables –etc.
Addressing Issues David Conrad Internet Software Consortium.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Memory: Relocation.
Draft Policy Preview ARIN XXVII. Draft Policies Draft Policies on the agenda: – ARIN : Globally Coordinated Transfer Policy – ARIN : Protecting.
Internet Protocols (chapter 18) CSE 3213 Fall 2011.
RISC and CISC. What is CISC? CISC is an acronym for Complex Instruction Set Computer and are chips that are easy to program and which make efficient use.
Operand Addressing And Instruction Representation Cs355-Chapter 6.
1Sequential circuit design Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA by Erol Sahin and Ruken Cakici.
Real-Time Streaming Protocol draft-ietf-mmusic-rfc2326bis-01.txt Magnus Westerlund.
Slide 1 July 2006, Montreal, QuebecIETF DNSEXT 2929bis Donald E. Eastlake 3 rd
Entropy Labels in MPLS Forwarding draft-kompella-mpls-entropy-label-01 Kireeti Kompella Juniper Networks Shane Amante Level 3 Communications.
Entropy Labels in MPLS Forwarding draft-kompella-mpls-entropy-label-02
Copyright © 2014 Curt Hill Algorithms From the Mathematical Perspective.
IP Protocol CSE TCP/IP Concepts Connectionless Operation Internetworking involves connectionless operation at the level of the Internet Protocol.
Draft-kompella-ospf- multiaccess-te-00.txt OSPF WG ‘58 Kireeti Kompella Juniper.
1 Variable Length Subnet Masks ( VLSM ) “ Classful Route” Means if a route to a network starting with is received, it is a class A => mask length.
Slide 1 November 2005, Vancouver, BCIETF DNSEXT 2929bis etc. Donald E. Eastlake 3 rd
MPLS Special Purpose Labels draft-kompella-mpls-special-purpose-labels-01 Loa Andersson Adrian Farrel Kireeti Kompella.
11 Making Decisions in a Program Session 2.3. Session Overview  Introduce the idea of an algorithm  Show how a program can make logical decisions based.
Connecting IPv4 Islands over IPv6 MPLS Using IPv4 Provider Edge Routers(4PE) Zhenqiang Li China Mobile.
Comments on the “Three Piles” Problem
MPLS-TP Fault Management Draft draft-boutros-mpls-tp-fault-01
Memorandums & Long (Formal) Reports
George Swallow Martin Vigoureux Rahul Aggerwal July 30, 2008
Outline Paging Swapping and demand paging Virtual memory.
ITEC 202 Operating Systems
Architecture for Scheduled Use of Resources draft-zhuang-teas-scheduled-resources-00 Yan Zhuang Qin Wu
MPLS LSP Instant Install draft-saad-mpls-lsp-instant-install-00
Please use the top of the slide. The area that will be printed is 4
NDN Messages and NDN Packets
Collaborative Data Teams
IPv6 Router Alert Option for MPLS OAM
RADEXT WG RADIUS Attribute Guidelines draft-weber-radius-attr-guidelines-01.txt Greg Weber November 8th, 2005 v1 IETF-64, Vancouver.
PLR Designation in RSVP-TE FRR
Design by Contract Fall 2016 Version.
New Solutions For Scaling The Internet Address Space
LDP Extensions for RMR draft-esale-mpls-ldp-rmr- extensions
Requirements for IPv6 Routers draft-ietf-v6ops-ipv6rtr-reqs
Floral Demo The following demo shows the features of our floral program. The floral program is an additional module of SimPOS! Retail Point of Sale. Descriptive.
Memorandums & Long (Formal) Reports
An Update on BGP Support for 4-byte ASN
* From AMD 1996 Publication #18522 Revision E
Get In Shape With EMS Training. INTRODUCTION Those that are thinking about making a change in their life might have thought about going through with EMS.
draft-ietf-ospf-lls-interface-id-00
February 19 doc.: IEEE /424r1 February 2007
February 19 doc.: IEEE /424r1 November 2006
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Technical Issues with draft-ietf-mpls-bfd-directed
Fast Reroute for Node Protection in LDP- based LSPs
5/6/2019 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Response to WG request regarding TC ERM requested.
Transferability from Title IV-A to IIA: Amending Title IIA Application
Experimental Internet Resource Allocations
5/12/2019 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Response to WG request regarding TC ERM requested.
DetNet Data Plane design team IETF 98, Chicago, 2017
May 19 doc.: IEEE /424r1 November 2006
Operating Systems Concepts
Reading and effective note-making
Tips on Giving Effective PAA Presentations, Job Talks, and the Like
SAMPLE SUBMISSION TEMPLATE
Supporting Flexible Algorithm Prefix SIDs in LSP Ping/Traceroute
Presentation transcript:

KIREETI KOMPELLA, LOA ANDERSSON ADRIAN FARREL SPECIAL PURPOSE LABELS

New name for reserved labels The term “reserved” has a specific meaning to IANA Limited number of them 16 set aside, 8 already allocated, one request in the pipeline (?) Need: To prepare for exhaustion To revisit process to allocate new SPLs To create process to reclaim SPLs

EXTEND THE SPACE? Why not simply extend the range of SPLs from 0-15 to (say) 0-127? Nice, simple solution However, doesn’t accommodate backward compatibility Existing hardware doesn’t treat a label of 16 as “special” Existing software doesn’t necessarily avoid allocating label 16 as a “regular” label

PROPOSAL: EXTENSION LABEL Use label 15 as the “extension label” A label following the extension label is to be treated as an extended special purpose label (ESPL) Backward compatibility: if current hardware sees label 15 at the top of stack, it should (will?) discard the packet This is the same behavior as for other unassigned special purpose labels (right?) If you know of implementations behaving differently from the above, please speak up!

EXTENSION LABEL Questions: 1.How many ESPLs do we need? Why put an artificial limit? SHOULD try to allocate new ESPLs near 0 to help hardware 2.Is there special significance to an ESPL in the range 0-15? Perhaps; see next slide 3.Should there be space set aside for Experimental and Private Use? Done!

LABEL 7 (ELI) To simplify hardware, the Entropy Label RFC says that an LSR can simply scan the label stack to look for label 7, the Entropy Label Indicator If found, the following label is an entropy label, and can be used for load balancing purposes This is a nice optimization However, if label 7 has a different meaning as an extended special purpose label, this would break

CHOICES FOR ESPLS 0-15 Allow 0-15 as ESPLs, but state that they retain their original meanings New ESPLs start from 16 Disallow 0-15 as ESPLs ESPLs start from 16 Allow labels from 0-15 to have new meanings on a case-by-case basis (in particular, not label 7) New ESPLs could start from 0 (nice from a table size PoV) Chip and microcode implementors need to comment on whether implementations “peek” into the label stack looking for other SPLs (OAM? Router Alert?)

CHOICES Starting ESPLs from 0 may allow smaller ESPL lookup tables Otherwise, the first 15 labels are “wasted” How significant is this? Starting from 16 may make the logic/microcode simpler Especially if there is more than one exception SPEAK NOW (or forever hold your peace!)

PROCESSES The draft goes into some detail on how SPLs (and ESPLs) can be retired Please read and comment Not urgent, but good to get right Need to put in a statement that ESPLs SHOULD/MUST be clustered near 16 (or 0) There was mild consensus not to have Private Use labels and to have a small Experimental space Again, not urgent but good to get right Note that the Experimental space is at the “end” of the label space. Not optimal for lookups, but shouldn’t matter

NEXT STEPS Some good comments received on mailing list Thank you! Will incorporate into new version Hardware/microcode developers should reflect on this draft and send comments (privately if they so desire) Think about current implementations, backward compatibility and other issues related to existing SPLs Also think about table size, ease of coding, etc. for ESPLs