RPL: the IPv6 Routing Protocol for Low-power and Lossy Networks | RFC 6550 | RPL | RPL Tutorial

[@dimitriossourailidis3547]

I wish those videos were uploaded when i started learning about RPL. It would be much easier for me. Good job!

[@MouloudATMANI-d8c]

Good presentation Géorgios. thank you so much.

[@taranaara528]

Excellent Explanation

[@NiketBahety]

In this example how will node E communicate with node C ? I mean are the edges bidirectional

[@gzpapadopoulos]

You posed a great question here Niket Bahety! So, RPL (RFC 6550) defines two Mode of Operations, the Storing Mode and the Non-Storing Mode: 1. In the Storing mode the intermediate nodes maintain state representing the routing information towards all their descendants (direct children, children of children, etc.). This results in additional memory requirements for the nodes maintaining this information but higher network performance, especially for inter-DODAG traffic. Thus, in the storing mode, coming back to your question, when the node E wants to send a packet toward node C, it will go through the first common parent, which is the node B in this case, since B maintains all the necessary routing information (e.g., IPv6 addresses) of its descendants. As a result, in this Storing mode, the exact path is the following one: E --> B --> C. 2. In the Non-Storing Mode, only the DODAG Root (i.e., node A in this example) maintains state representing the routing information towards the whole DODAG. This results in high memory requirements only on the root, but adds network overhead due to the use of source routing and less efficient intra-DODAG routing because all the traffic needs to go through the root. Therefore, coming back again to your question, when the node E will send a packet to node C, this packet will go all the way up to the Root which is the node A in this example, and then downwards to node C through node B. More specifically, you will have this path: E --> B --> A --> B --> C. In this Non-Storing Mode, the DODAG Root uses what is called the Source Routing to route the packets downward since only the Root is aware of the whole network topology. Let me know if things are crystal clear to you now!

[@NiketBahety]

@@gzpapadopoulos thank you for the explanation ! It's clear now.

[@mygdaliasthanasis1298]

Good presentaion! Thank you ! If i put my own device on the network and configure it with small number rank. My device take the role of DODAG and the topology of the network will change ?

[@gzpapadopoulos]

An excellent question Thanasi, thank you! RPL as of RFC 6550 does not have zero trust. So, if a node manages to join the RPL network, by bypassing the Layer 2 security, and claims Rank1 (i.e., the smallest rank number in the network), it becomes as preferable as the Root. And yes, consequently, the topology of the network will change as you say.

[@sciencecomputer1721]

Thank's Sir It was very helpful, So what I understand the DAO used to build routing table, what is the information contain in routing table? and wht is the mechanisme use to discover a neighbor example D how it know that C and E is neighbor, I hope you can upload another vidéo about trickel-timer.

[@nadirnadeer9705]

Thanks Sir, well explained !