FunctionLinkID draft-jinchoi-dna-protocol2 Landmark + CompleteRA draft-pentland-dna-protocol Identifier choice (1)Routers choose IDHost chooses ID Identifier.

Slides:



Advertisements
Similar presentations
Reporting Workflow Rita Noumeir, Ph.D. IHE Technical Committee.
Advertisements

IPv6 State-less Auto-configuration. IPv6 Stateless Autoconfiguration2 Stateless Autoconfiguration Overview One of the most useful aspects of IPv6 is its.
DNA design team update Brett Pentland – Monash University.
DNA design team update Brett Pentland – Monash University.
Slide 1 doc.: IEEE /1092r0 Submission Simone Merlin, Qualcomm Incorporated September 2010 Slide 1 ACK Protocol and Backoff Procedure for MU-MIMO.
Next Generation Internet by R.S. Chang, Dept. CSIE, NDHU1 Configuring Hosts through DHCP Configuring Hosts through DHCP.
CS3771 Today: deadlock detection and election algorithms  Previous class Event ordering in distributed systems Various approaches for Mutual Exclusion.
Distributed Computing 1. Lower bound for leader election on a complete graph Shmuel Zaks ©
Neighbor Discovery for IPv6 Mangesh Kaushikkar. Overview Introduction Terminology Protocol Overview Message Formats Conceptual Model of a Host.
Parallel and Distributed Simulation Lookahead Deadlock Detection & Recovery.
DNAv6 Goals JinHyeock Choi, Samsung AIT
Education Professional Standards Board Password Recovery Process.
IPv6 Address Provisioning In IPv6 world there are three provisioning aspects wich are independent of whether the IPv6 node is a Host or CE router: IPv6.
DNA design team update Brett Pentland – Monash University.
Non-blocking Atomic Commitment Aaron Kaminsky Presenting Chapter 6 of Distributed Systems, 2nd edition, 1993, ed. Mullender.
Detecting Network Attachment (DNA) Working Group Session IETF 63, Paris Chairs: Greg Daley, Suresh Krishnan.
Detecting Network Attachment in IPv6 Problem Statement JinHyeock Choi, Samsung AIT
Strategies For Detecting Network Attachment in Wireless IPv6 Networks Greg Daley - Research Fellow Monash University Centre for Telecommunications and.
Comparison of Link Identification schemes Objective: Present the similarities and differences of the two schemes.
DNA design team update JinHyeock Choi Tero Kauppinen James Kempf Sathya Narayanan Erik Nordmark Brett Pentland Design Team: Brett Pentland.
Detecting Network Attachment in IPv6 Networks (DNAv6) draft-ietf-dna-protocol-05.txt S. Narayanan, Ed. J. Kempf, E. Nordmark, B. Pentland, JH. Choi, G.
Guide to TCP/IP Fourth Edition
(part 3).  Switches, also known as switching hubs, have become an increasingly important part of our networking today, because when working with hubs,
Cisco Public © 2013 Cisco and/or its affiliates. All rights reserved. 1.
CMPT 471 Networking II Address Resolution IPv6 Neighbor Discovery 1© Janice Regan, 2012.
IP Addressing & Subnetting Made Easy. Part 1: Working with IP Addresses.
Forwarding Hint in NFD Junxiao Shi,
1Traffic Eng. © 1999, Cisco Systems, Inc. Cisco Systems Change to Hello Protocol Three way handshake Carry both Source and Destination Instance When establishing.
Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
IPv6 Address autoconfiguration stateless & stateful.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Wireless TCP Prasun Dewan Department of Computer Science University of North Carolina
3: Transport Layer 3a-1 8: Principles of Reliable Data Transfer Last Modified: 10/15/2015 7:04:07 PM Slides adapted from: J.F Kurose and K.W. Ross,
1 Modeling interactions and behavior Lecturer Dr. Mai Fadel.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Simple DNA draft-krishnan-dna-simple-03 Suresh Krishnan Greg Daley.
Unit 5 Lecture 2 Error Control Error Detection & Error Correction.
Engineering Workshops Purposes of Neighbor Solicitation.
Deterministic Fast Router Advertisement Configuration Update draft-daley-dna-det-fastra-01.txt Presenter: Greg Daley.
Wireless TCP. References r Hari Balakrishnan, Venkat Padmanabhan, Srinivasan Seshan and Randy H. Katz, " A Comparison of Mechanisms for Improving TCP.
Replication (1). Topics r Why Replication? r System Model r Consistency Models – How do we reason about the consistency of the “global state”? m Data-centric.
11 draft-pentland-dna-protocol3-00.txt Brett Pentland.
Switch Features Most enterprise-capable switches have a number of features that make the switch attractive for large organizations. The following is a.
IETF77 Multimob California1 Proposal for Tuning IGMPv3/MLDv2 Protocol Behavior in Wireless and Mobile networks draft-wu-multimob-igmp-mld-tuning-00 Qin.
IETF 61 – Washington D.C.1 Detecting Network Attachment Best Current Practices draft-narayanan-dna-bcp-01.txt Sathya Narayanan Panasonic Greg Daley Monash.
6lowpan ND Optimization draft Update Samita Chakrabarti Erik Nordmark IETF 69, 2007 draft-chakrabarti-6lowpan-ipv6-nd-03.txt.
JinHyeock Choi, DongYun Shin hppt:// Fast Router Discovery with L2 Support draft-jinchoi-dna-frd-01.txt.
ICMPv6 Error Message Types Informational Message Types.
THE CLASSIC INTERNET PROTOCOL (RFC 791) Dr. Rocky K. C. Chang 20 September
Page 1 Mutual Exclusion & Election Algorithms Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content.
Capability Model & B2B – Draft for Discussion IBM Research – Haifa Moti Nisenson.
DOC Use Case Analysis Client to server use cases 1.
Draft-ietf-pim-port-03 wglc. WGLC responses Thomas suggested a long list of changes, mostly editorial –I believe I addressed all Dimitri also had comments.
JinHyeock Choi, Syam Madanapalli hppt:// DNA Solution: Link Identifier based approach draft-jinchoi-dna-protocol2-01.txt.
+ Lecture#4 IPV6 Addressing Asma AlOsaimi. + Topics IPv4 Issues IPv6 Address Representation IPv6 Types.
© 2015 Infoblox Inc. All Rights Reserved. Tom Coffeen, IPv6 Evangelist UKNOF January 2015 Tom Coffeen, IPv6 Evangelist UKNOF January 2015 DHCPv6 Operational.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Detecting Network Attachment in IPv6 Networks (DNAv6) draft-ietf-dna-protocol-03.txt S. Narayanan, Ed. J. Kempf, E. Nordmark, B. Pentland, JH. Choi, G.
Routing Information Protocol (RIP)
Fast Router Discovery with RA Caching
Chapter 6: Transport Layer (Part I)
Router Advertisement Link Identifiers (LinkID)
Proposal for IEEE 802.1CQ-LAAP
Proposal for IEEE 802.1CQ-LAAP
Link-State Routing Protocols
Proposal for IEEE 802.1CQ-LAAP
Link-State Routing Protocols
Hosted by Type your name here
LOOPS Generic Information Set draft-welzl-loops-gen-info-00
Presentation transcript:

FunctionLinkID draft-jinchoi-dna-protocol2 Landmark + CompleteRA draft-pentland-dna-protocol Identifier choice (1)Routers choose IDHost chooses ID Identifier structure(2)One prefix from LinkAt least one prefix Previous Link Prefix disclosure (3) Not required Complete prefix list generation (4) Rely on CPLYes Solicitation required (5)No RS required for FastRA (6)Yes DNA to DNA move (7)Single RA Non-DNA to DNA move (8)Relies on L2 HintYes DNA to non-DNA move (9)Relies on CPLYes: Except new router on Link Supports mixed links (10)Relies on L2 hint if the prefixes are disjoint Yes Support large # of prefixes (11)Yes

FunctionLinkIDLandmark + CompleteRA Bandwidth solicited RA (1 router) RS + RA (+ 32 if LinkID is in LPIO) (+32 for another LinkID) RS RA + DNAO + 24: less options and DNAO if Yes answer Bandwidth unsolicited RA ( if r is the mean RA rate) r * (RA (+ 32 if LinkID is in LPIO) (+32 for another LinkID)) r * (RA + DNAO) Average solicited bandwidth (if a is APs per Link) RS + RA (+ 32 if LinkID is in LPIO) (+32 for another LinkID) RS /a (RA+DNAO) + (1-1/a)(RA+24-options) Relies on CPL means: Relies on L2 Hints and whether the prefix list is actually complete. DNAO = ROOF ((17 (P – Conf) + 2)/8) * 8 Relies on Hints means: Requires L2 hints to be able to differentiate two links.

Footnotes 1.Identifier Choice: Indicates which device is in charge of coordinating the identifier or identifiers used for DNA. For the CompleteRA/Landmarks 2.LinkID chooses one out of all prefixes, as does landmark. CompleteRA uses all the prefixes, but the combined scheme, can use either. 3.With landmarks, the previous link’s prefix is included in the RS. It is possible in protocol-01, to send the RS without the last prefix, in which case, no landmark response is possible, but a completeRA may be sent. 4.Prefix Lists are built in draft-ietf-dna-cpl-01. Once all prefixes on the link are known, reception of RAs with no prefixes in the complete Prefix List indicate change of link. CompleteRA populates a prefix list immediately to make it complete. We assume here that Landmark/CompleteRA systems always send a completeRA if the host doesn’t already know the Complete Prefix List (if not Landmark=yes). In cases without CompleteRA, the procedures in the cpl draft must be relied upon to generate the Complete Prefix List. 5.Landmarks need a solicitation to indicate link change. CompleteRA and LinkID do not, and can just rely on comparison of received RAs to determine change

Footnotes 6.While this is related to the previous slide, this line was added to show that FastRA requires RS in any case. 7.Single RA refers to the fact that any single received RA can be used to determine if link change has occurred. 8.Here, ‘Relies on L2 hint’ indicates that distinguishing between a new router and a link change requires link-layer hint reception. This is the case where the new RA has no LinkID, even if the last RA did. For CompleteRA/Landmark, this assumes that the host has received a completeRA, and that any subsequent reception of an RA can be classified as a link change (if reliable L2 hints are in use, it works, as well as if there are hints from other sources such as L3 timers). 9.LinkID cannot determine immediately if there is a new router, or link change has occurred unless it already has a CPL. This also requires reliable L2 hints. CompleteRA is able to identify that change has occurred immediately, but without reliable L2 hints, may have spurious change detection when a router starts on the same link

Footnotes 10.RA messages from non-DNA routers become indistinguishable from link change unless reliable L2 hints are available in LinkID. CompleteRAs and Landmarks both learn about non-DNA routers’ prefixes. 11.CompleteRAs do not have an explicit bounded size, but Landmark answers can be sent even if all prefixes do not fit in one RA (To make a completeRA).

FunctionLandmarkCompleteRALinkIDLandmark + CompleteRA Identifier choiceHost chooses IDRouters choose ID Host chooses ID Identifier structureOne prefix from Link Set of all prefixes on Link One prefix from Link At least one prefix Previous Link Prefix disclosure RequiredNot required Complete prefix list generation Rely on CPLYesRely on CPLYes Solicitation requiredYesNo RS required for FastRA Yes DNA to DNA moveSingle RA Non-DNA to DNA move Yes: Landmark Nack Yes: CompleteRA overrides Relies on L2 HintYes DNA to non-DNA move Relies on CPLYes: Except new router on Link Relies on CPLYes: Except new router on Link Supports mixed linksYes: Landmarks even non DNA prefixes Yes: All prefixes in single message Relies on L2 hint if the prefixes are disjoint Yes Support large # of prefixes YesNo: Use CPL instead Yes

FunctionLandmarkCompleteRALinkIDLandmark + CompleteRA Bandwidth solicited RA (1 router) RS RA + 24: less options if Yes answer RS + RA + DNAO RS + RA (+ 32 if LinkID is in LPIO) (+32 for another LinkID) RS RA + DNAO + 24: less options and DNAO if Yes answer Bandwidth unsolicited RA ( if r is the mean RA rate) r * RAr * (RA + DNAO)r * (RA (+ 32 if LinkID is in LPIO) (+32 for another LinkID)) r * (RA + DNAO) Average solicited bandwidth (if a is APs per Link) RS /a (RA+24) + (1- 1/a)(RA+24-options) RS + RA + DNAO RS + RA (+ 32 if LinkID is in LPIO) (+32 for another LinkID) RS /a (RA+DNAO) + (1- 1/a)(RA+24-options) Relies on CPL means: Relies on L2 Hints and whether the prefix list is actually complete. DNAO = ROOF ((17 (P – Conf) + 2)/8) * 8 Relies on Hints means: Requires L2 hints to be able to differentiate two links.