AM-SRL : Adaptive Multicast Operation of the Supernode-based Reverse Labeling Algorithm

1. AM-SRL : Adaptive Multicast Operation of the Supernode-based Reverse Labeling Algorithm Y. Dong, T. Yang, D. Makrakis, I. Lambadaris Department of System & computer Engineering Carleton University IEEE CCECE 2002. Speaker: Ruo Wey-Yu

2. Outline • Introdution • SRL(Supernode-based Reverse Labeling Algorithm) • AM-SRL(Adaptive Multicast Operation of Supernode-based Reverse Labeling) Algorithm • Conclusion

3. SRL(Supernode-based Reverse Labeling Algorithm) • SRL(Supernode-based Reverse Labeling Algorithm) • A QoS unicast routing protocol utilizing a cluster-based management to enhance routing protocol • Utilize reverse labeling algorithm to provide QoS provisioning and dynamic route repairing

4. SRL(Supernode-based Reverse Labeling Algorithm) • Types of nodeS - slavenode, supernode • Slavenode pertains to only one supernode • Supernode is 1-hops away from its slavenode ““ means Within 1 Hops ““ means “Belong to” MANET Supernode Slavenode Slavenode Supernode Slavenode Supernode Write Slavenode Supernode Slavenode Write

5. SRL(Supernode-based Reverse Labeling Algorithm) • “Virtual link” is built between supernodes, aimed to connect source and destination • Virtual link records supernode’s IP address on the route The nearest supernode of destination G; or G’s supernode Source S Supernode C Supernode E Supernode F Supernode A Supernode B Supernode D Destination G The nearest supernode of source S; or S’s supernode Virtual link

6. SRL ( Supernode-based Reverse Labeling Algorithm) The form of Route request message • STEP 1:Virtual Route Discovery • STEP 2:Reverse Link Labeling, Dynamic Route Repairing Node G can stop Forwarding packet if it find its don’t have enough bandwidth Source s ask its supernode to connect A virtual link by sending Route request message 1:Source S VR:(1) 3:node B 10: node H (Destination) VR:(2,4,6) 7:node F 6:S-node of E 2:S-node of S VR:(2,4,6,9) 5:node D 9: S-node of F,G,H VR:(2,4) 8:node G 4:S-node of B

7. The form of reverse labeling message The first reverse labeling message while sent SRL ( Supernode-based Reverse Labeling Algorithm) The routing table of 9 The node 9 add in information into packet The routing table of node 7 is The node 7 adding information into packet • STEP 1:Virtual Route Discovery • STEP 2 : Reverse Link Labeling, Dynamic Route Repairing Destination can wait a exponential back-off time,starting reverse labeling phase by sending reverse labeling message if it want to maintain the route 1:Source S 3:node B 10: node H (Destination) 7:node F 6:S-node 2:S-node 9: S-node 5:node D 8:node G 4:S-node

9. SRL vs AM-SRL • Difference • Destination of AM-SRL are multicast members • Reverse Route Establishment is only done between a supernode and its nearest supernode (Adaptive Reverse Route Establishment) • Backup route is kept with a factor F counted

10. source F

11. source

12. source source

13. Feature of AM-SRL • Adaptive virtual route selection • The route to cluster of multicast members is shortest • Adaptive reverse route establishment • Enables to connect to nearest multicast member • Adaptive mesh formation • Keep redundant connetions

14. If a node is broken?

15. C-D Broken

16. A-C broken

17. Thank you!