Stacking Tags in LLC Media

Similar documents
CS 314 Principles of Programming Languages

Procedure Abstraction

Today. Quiz Introduction to pipelining

Gauss-Jordan Algorithm

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

CMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols

Subtracting Fractions

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version

Lecture 10 Splines Introduction to Splines

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

style type="text/css".wpb_animate_when_almost_visible { opacity: 1; }/style

IST 220: Ch3-Transport Layer

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

Tool Vendor Perspectives SysML Thus Far

Blackbaud s Mailwise Service Analyse Records Updated by MailWise

COMP 423 lecture 11 Jan. 28, 2008

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks

Answer Key Lesson 6: Workshop: Angles and Lines

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

P802.1ag Draft 2.0 Diagrams

Deposit a Technical Report in PubRep

NEWTON S SECOND LAW OF MOTION

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

Exercise 3: Bluetooth BR/EDR

Registering as a HPE Reseller. Quick Reference Guide for new Partners in Asia Pacific

Chapter 4 Sequential Instructions

Flow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12

COSC 3213: Computer Networks I Chapter 6 Handout # 7

CENG 477 Introduction to Computer Graphics. Modeling Transformations

OPERATION MANUAL. DIGIFORCE 9307 PROFINET Integration into TIA Portal

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

Assignment 2. Due Monday Feb. 12, 10:00pm.

6.8 Shortest Paths. Chapter 6. Dynamic Programming. Shortest Paths: Failed Attempts. Shortest Paths

MATH 25 CLASS 5 NOTES, SEP

LCI/USB LonWorks Commissioning Interface

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Agilent Mass Hunter Software

10.5 Graphing Quadratic Functions

How to Design REST API? Written Date : March 23, 2015

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Distributed Systems Principles and Paradigms

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!

4 Error Control. 4.1 Issues with Reliable Protocols

Spring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam.

Jorge Salvador Marques, Stereo Reconstruction

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Network Layer: Routing Classifications; Shortest Path Routing

Engineer To Engineer Note

Tixeo compared to other videoconferencing solutions

3.5.1 Single slit diffraction

EECS 281: Homework #4 Due: Thursday, October 7, 2004

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

In-HouseTrainingProgramme

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

REACTION ENUMERATION & CONDENSATION OF DOMAIN-LEVEL STRAND DISPLACEMENT SYSTEMS. Stefan Badelt DNA and Natural Algorithms (DNA) Group, Caltech

Guide for sending an Electronic Dental referral

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

12-B FRACTIONS AND DECIMALS

High Priority Traffic in HCF on Wireless Networks

Announcements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Software Release Note

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

IDEF3 Process Description Capture Method

Mid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:

Quiz2 45mins. Personal Number: Problem 1. (20pts) Here is an Table of Perl Regular Ex

Error Numbers of the Standard Function Block

2 Computing all Intersections of a Set of Segments Line Segment Intersection

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014

Digital Design. Chapter 1: Introduction. Digital Design. Copyright 2006 Frank Vahid

Lecture 18: Mix net Voting Systems

ZZ - Advanced Math Review 2017

CS201 Discussion 10 DRAWTREE + TRIES

Distributed Systems Principles and Paradigms

What are suffix trees?

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

Registering as an HPE Reseller

Very sad code. Abstraction, List, & Cons. CS61A Lecture 7. Happier Code. Goals. Constructors. Constructors 6/29/2011. Selectors.

Network Court Protocol and Malicious Node Conviction

Low-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany

Chapter 7. Routing with Frame Relay, X.25, and SNA. 7.1 Routing. This chapter discusses Frame Relay, X.25, and SNA Routing. Also see the following:

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Slides for Data Mining by I. H. Witten and E. Frank

Chapter 3 MEDIA ACCESS CONTROL

1 Quad-Edge Construction Operators

Section 3.1: Sequences and Series

4. Minimax and planning problems

A Matching Algorithm for Content-Based Image Retrieval

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the

ME 406 Assignment #1 Solutions

Small Business Networking

YOU ARE: AND THIS IS:

Compression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv

CMPUT101 Introduction to Computing - Summer 2002

Transcription:

Scking Tgs in LL Medi Normn Finn ugus 19, 2013 Ver. 2 (This presenion is lso uploded o 802.11 documen sysem s documen number 2013-0952-1.) bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 1

Work now in progress on P802.1Qbz nd P802.11k hs shown h he mehod currenly defined in IEEE 802.1Q for dding nd removing gs (e.g., he VLN g) o frmes on LL medi (e.g., 802.11) is unenble. new scheme is proposed in P802.1Qbz Drf 1.2 for use by P802.11k. In he wors cse, his chnge could invlide currenlycomplin implemenion of 802.11. This presenion solicis commens from ny orgnizion or individul h migh be ffeced by his chnge. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 2

bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 3

802.11 Oces: 2 2 6 6 6 2 6 2 4 0 7951 4 Frme onrol Durion/ ID ddress 1 ddress 2 ddress 3 Sequence onrol ddress 4 QoS onrol HT onrol Frme Body FS M Heder Figure 8-30 D frme 802.1 mc_service_d_uni () IEEE Sd 802.11-2011 bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 4

802.3 Oces 7 1 6 6 2 46-1982 4 vr. PREMBLE SFD D S LENGTH / TYPE M LIENT DT FS EXTE NSION 802.1 mc_service_d_uni () IEEE Sd 802.3-2008 bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 5

Lengh/Type EherType d (e.g. IP pcke): LL d (e.g. Bridge Proocol D Uni [BPDU]):. 2 M LENGTH / TYPE TYPE > 05-FF. 2 3 N 3 LENGTH / TYPE LENGTH < 05-DD M LIENT DT M LIENT DT 08-00 IP heder IP d M LIENT DT LL, LL - d N 42-42-03 BPDU SNP:. 2 3 3 2 N 8 LENGTH / TYPE LENGTH < 05-DD LL, LL = - OUI or 0 N --03 00-00-00 M LIENT DT EherType or subype 08-00 IP heder d IP d bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 6

LL 3 3 2 M EherType d (e.g. IP pcke): LL, LL = - 0 --03 00-00-00 EherType 08-00 IP heder d IP d LL d (e.g. Bridge Proocol D Uni [BPDU]): 3 M LL, LL - d 42-42-03 BPDU 3 3 2 M Oher SNP: LL, LL = - OUI subype d --03 PQ-RS-TU WX-YZ propriery proocol bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 7

Lengh/Type no g: Lengh/Type gged: Simply dd or remove g; is unchnged.. 2 N 2 LENGTH / TYPE M LIENT DT. 2 L 2 N 2 EherType 81-00 Tg vlue 02-44 LENGTH / TYPE M LIENT DT LL no g: LL gged: Simply dd or remove g; is unchnged. 3 M 3 LL. 6 2 L 3 M 3 d SNP EherType Tg vlue --03-00-00-00 81-00 02-44 LL d bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 8

On LL medi, he firs 3 byes following every g re LL. On Lengh/Type medi, he firs 2 byes following every g re Lengh/Type. You know how o decode he whole frme, becuse you know wheher he medium is LL or Lengh/Type. You cnno ell from he d, iself, wheher he byes following g re LL or Lengh/Type, becuse here re mny wo-byes vlues h re vlid in boh forms. Knowledge of he medi ype is essenil. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 9

bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 10

ll gs mus be rnsled once problem E1 B2 B2 B3 B4 B5 E2 Lengh/Type gs on medi B I B I LL LL gs on LL medi d S Q d S Q d d d LL LL d LL S Q LL S Q LL LL LL LL Q 802.1Q decoder ring: B = Bckbone ddresses, I = I-g, = usomer ddresses, S = Service VLN gs, Q = usomer VLN gs. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 11

Tgging ner he edges of he nework mus be in he form expeced by he medium in h re. Oherwise, hey cnno decode he g sck. We cnno, ex pos fco, require every bridge nd g-wre end sion o sr rnsling beween encpsulions. Heurisics o do he rnslion re possible, bu no relible. We could sk he bridge h connecs o wo medi ypes o conver ll gs nd he originl. Th is difficul o do in high speed in SIs. I mkes i impossible o deploy new gs he edge, becuse he core devices will no know how long hose gs re. Th s how you know i is violion of he principles of lyering. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 12

bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 13

Lengh/Type no g: Lengh/Type gged: Simply dd or remove g; is unchnged.. 2 N 2 LENGTH / TYPE M LIENT DT. 2 L 2 N 2 EherType 81-00 Tg vlue 02-44 LENGTH / TYPE M LIENT DT LL no g: LL gged: hnge when dding or removing g. 3 M 3 LL. 6 2 L 2 N 2 d SNP EherType Tg vlue --03-00-00-00 81-00 02-44 LENGTH / TYPE M LIENT DT bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 14

LL 3 3 2 M dd/remove g on SNP frme LL, LL = - 0 --03 00-00-00 Ungged EherType 08-00 IP heder d IP d 3 3 2 L 2 M Tgged TG Ungged LL, LL = - 0 EherType Tg vlue EherType d --03 00-00-00 81-00 02-44 08-00 IP heder IP d dd: onver old ouer iem LL à, dd LL g. Remove: Delee LL g, conver new ouer iem à LL. OR: dd/remove g beween LL-SNP nd. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 15

LL 3 M dd/remove g on LL frme Ungged LL, LL - d 42-42-03 BPDU 3 3 2 2 2 3 M Tgged MSGU TG Ungged LL, LL = - 0 EherType Tg vlue Lengh LL, LL - d --03 00-00-00 88-8 02-44 M+3 42-42-03 BPDU dd or remove boh he LL g nd he Lengh field. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 16

One rnslion per g or medi chnge soluion E1 B2 B2 B3 B4 B5 E2 Lengh/Type gs on medi B I B I LL LL gs on LL medi d S Q d S Q d d d d S Q S Q LL LL Q 802.1Q decoder ring: B = Bckbone ddresses, I = I-g, = usomer ddresses, S = Service VLN gs, Q = usomer VLN gs. Normn Finn, isco Sysems bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 17

Muliple gs on Lengh/Type (802.3) frme: Lengh/Type Tg 1 Lengh/Type Tg 2 Lengh/Type Tg 3 Lengh/Type Muliple gs on LL (802.11) frme: LL SNP Tg 1 Lengh/Type Tg 2 Lengh/Type Tg 3 Lengh/Type Only he firs iem is LL-encoded on n LL medium; ll oher iems re Lengh/Type-encoded. (n ungged is LL or Lengh/Type, by medium.) bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 18

We keep he whole sck, excep for he ouermos iem, in Lengh/Type form. Every device knows how o encode/decode frmes. Only one iem is convered per g dded or removed. The ouermos iem sill follows he rules for he medium in quesion. We could eqully well hve used he LL form in ll excep he ouermos iem, excep h 802.3 devices lredy use muliple gs nd (s fr s his uhor knows) 802.11 devices do no use LL-scked gs. (There is lso new EherType defined in P802.1Qbz D1.2 o encode n LL longer hn 1500 byes.) bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 19

If ny cul use of he LL-scked g form is known, plese le 802.1 Inerworking TG nd 802.11 TGk know bou i, becuse we propose o remove his form from he sndrds:. 6 2 L 6 2 M SNP EherType Tg vlue SNP EherType d --03-00-00-00 81-00 02-44 --03-00-00-00 08-00 IP heder IP d No lengh field! If here is such use, hen we will hve o re-exmine our opions. bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013, York, UK 20

Thnk you.