RPL Routing Pathology In a Network With a Mix of Nodes Operating in Storing and Non-Storing Modes draft-ko-roll-mix-network-pathology JeongGil Ko, J.Jeong,

Slides:



Advertisements
Similar presentations
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Advertisements

IP Fast Reroute Using Tunnel-AT draft-xu-ipfrr-tunnelat-00 Mingwei Xu, Lingtao Pan, Qing Li Tsinghua University, China 75 th IETF Meeting, Stockholm July.
Dynamic Routing Overview 1.
CSCI 4550/8556 Computer Networks Comer, Chapter 22: The Future IP (IPv6)
IPv6 Routing Protocol for Low- Power and Lossy Networks Speaker : Chih-Ching Chen Advisor : Dr. Ho-Ting Wu 2014/3/24 1.
Junction Trees And Belief Propagation. Junction Trees: Motivation What if we want to compute all marginals, not just one? Doing variable elimination for.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
Reactive Discovery of Point-to-Point Routes in Low Power and Lossy Networks draft-ietf-roll-p2p-rpl-04 Mukul Goyal University of Wisconsin Milwaukee.
Slide #1IETF 82 – ROLL WG – November 2012 RPL Applicability in Industrial Networks IETF 82 draft-phinney-roll-rpl-industrial-applicability-00 Tom Phinney.
Hierarchical PathQoS on a QoS- based Multicast Protocol SRSVP Takaaki SEKIGUCHI, Kenji FUJIKAWA, Yasuo OKABE, Kazuo IWAMA Graduate School of Informatics,
CSCI 4550/8556 Computer Networks Comer, Chapter 20: IP Datagrams and Datagram Forwarding.
Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers C. E. Perkins & P. Bhagwat Presented by Paul Ampadu.
2015/7/2Deadlock-free Packet Switching1 Introduction to Distributed Algorithm Part One: Protocols Chapter 5- Deadlock-free Packet Switching Teacher: Chun-Yuan.
Slide #1IETF 77 – Roll WG – March 2010 ROLL RPL IETF 77 status draft-ietf-roll-rpl Tim Winter Pascal Thubert Design Team.
IETF-76, Hiroshima, Nov 2009 ROLL Working Group Meeting IETF-76, Nov 2009, Hiroshima Routing Metrics used for Path Calculation in Low Power and Lossy Networks.
Potential-Based Entropy Adaptive Routing for Disruption Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT DTNRG, IETF 76 Hiroshima,
Routing and Routing Protocols Dynamic Routing Overview.
Link-State Routing Protocols
Network Layer4-1 R1 R2 R3R4 source duplication R1 R2 R3R4 in-network duplication duplicate creation/transmission duplicate Broadcast Routing r Deliver.
WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Virtual Topologies for Service Chaining in BGP IP/MPLS VPNs draft-rfernando-bess-service-chaining-00 (previously draft-rfernando-l3vpn-service-chaining-04)
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Ethernet Basics – 8 Routers. Routers and Routing Definition of a router- A device which provides a path from a node on one network or subnet to a node.
Slide #1IETF 82 – ROLL WG – November 2011 RPL adaptation for asymmetrical links IETF 82 status draft-thubert-roll-asymlink Pascal Thubert.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
RPL:IPv6 Routing Protocol for Low Power and Lossy Networks Speaker: Chung-Yi Chao Advisor: Dr. Kai-Wei Ke 2015/10/08 1.
Slide #1 Performance Evaluation of Routing Protocol for Low Power and Lossy Networks (RPL) draft-tripathi-roll-rpl-simulation-04 IETF Virtual Interim WG.
ROLL RPL Security IETF 77 status
SRI International 1 Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) Richard Ogier September 21, 2002.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
The Semantic IoT Amr El Mougy Slim Abdennadher Ghada Fakhry.
ECE 544 Protocol Design Project 2016 Chengyao Wen Hua Deng Xiaoyu Duan.
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Mukul Goyal University of Wisconsin Milwaukee
ROUTING.
ROURING ALGORITHM: LINK STATE
Internet of Things Amr El Mougy Alaa Gohar.
Instructor Materials Chapter 5: Dynamic Routing
Booting up on the Home Link
Wireless Sensor Networks 6. WSN Routing
draft-liu-pim-single-stream-multicast-frr-01
ECE 544 Protocol Design Project 2016
6TSCH Webex 06/21/2013.
ROLL RPL Security IETF 77 status
FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Please send.
CS 457 – Lecture 12 Routing Spring 2012.
Chapter 5: Dynamic Routing
ECE 544 Protocol Design Project 2016
ECE 544 Protocol Design Project 2016
ECE 544 Protocol Design Project 2016
CHAPTER 8 Network Management
Link-State Routing Protocols
NSIS Operation Over IP Tunnels draft-shen-nsis-tunnel-01.txt
draft-sitaraman-mpls-rsvp-shared-labels-00
draft-barth-pce-association-bidir-01
Link-State Routing Protocols
Chapter 10 Link State Routing Protocols
COMPUTER NETWORKS CS610 Lecture-29 Hammad Khalid Khan.
Consideration of IPv6 Encapsulation for Path Services draft-li-6man-ipv6-sfc-ifit-00 Zhenbin Li, Shuping Peng.
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
WJEC GCSE Computer Science
Computer Networks Protocols
IPv6 Encapsulation for IOAM - Enhancement of IPv6 Extension Headers draft-li-6man-ipv6-sfc-ifit-01 draft-li-6man-enhanced-extension-header-00 Zhenbin.
Extended Optimized Ingress Replication for EVPN
Internet Protocol version 6 (IPv6)
OSPF Protocol.
Presentation transcript:

RPL Routing Pathology In a Network With a Mix of Nodes Operating in Storing and Non-Storing Modes draft-ko-roll-mix-network-pathology JeongGil Ko, J.Jeong, J.Park, J.Jun, N.Kim, O.Gnawali 2012/11/05IETF 85th Meeting -- Atlanta, GA1

Recap: Downwards Routing in RPL RPL supports two types of downwards routing 2012/11/05IETF 85th Meeting -- Atlanta, GA2

Using Both Types of Downwards Routing Options RPL networks are applied to systems with various hardware capabilities – Computational power-scarce nodes can only implement the non-storing mode downwards routing mode – Computational power-rich nodes can implement storing mode to increase the network efficiency Shorter routing path Less bandwidth usage due to the lack of SRHs 2012/11/05IETF 85th Meeting -- Atlanta, GA3

Routing Pathology Nodes with different MOP compared to the RPL DODAG root can only join the RPL network as a leaf node This affects the downwards routing performance in a mixed RPL network as well as the efficiency of the collection path Take the following dumbbell topology as an example… If the non-storing mode node is forced as a leaf, both downwards AND collection performance is affected!!! 2012/11/05IETF 85th Meeting -- Atlanta, GA4

Benefits of Using Mixed Downwards Routing Mode-based Networks Intermediate nodes on the upwards path with route storing capabilities can exploit the efficiency of using storing mode – Non-storing mode nodes send the packet “up” the DODAG until a route storing mode node with knowledge of the target destination is met RPL’s collection performance can be improved by selecting from a larger pool of nodes – No need to neglect the selection of specific nodes as parent nodes just because they have a different MOP Solves the issue of network performance versus code simplicity – Non-storing mode nodes can keep the benefit of being slim implementations 2012/11/05IETF 85th Meeting -- Atlanta, GA5

Proposed Changes (1/3) A new MOP that allows a node to chose either to implement the storing or non-storing mode features along with the following changes – Both storing and non-storing mode should parse SRHs – DODAG root should store routes – Non-storing nodes send hop-by-hop DAO – Storing nodes keep a table of all the targets in its sub- DODAG and has the capability to attach SRHs 2012/11/05IETF 85th Meeting -- Atlanta, GA6

Proposed Changes (2/3) – DAO messages should indicate if the DAO-initiating node is a storing mode or not using a flag 2012/11/05IETF 85th Meeting -- Atlanta, GA7

Proposed Changes (3/3) Operational Changes for Storing Mode Nodes: – Packet without a SRH: If next hop is a storing-mode node, forward as in [RFC6550]. If next hop is a non-storing node, insert the SRH into the packet and forward – Using the storing status flag, a node constructing a SRH MAY choose to construct a SRH only up to the next storing mode node. – For packets with SRH, a storing mode node SHOULD obey the route specified in the SRH to comply with the strict source routing requirements in [RFC6554] 2012/11/05IETF 85th Meeting -- Atlanta, GA8

Discussions draft-ko-roll-mix-network-pathology as a WG draft? Can we simplify this process even further? 2012/11/05IETF 85th Meeting -- Atlanta, GA9