How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo,...
Transcript of How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo,...
![Page 1: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/1.jpg)
How to Establish Loop-Free MultipathRoutes in Named Data Networking?
NDNcomm 2017
Klaus Schneider, Beichuan ZhangMarch 24, 2017
The University of Arizona
1
![Page 2: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/2.jpg)
Routing and Forwarding in IP Networks
No Loop Detection on Forwarding Plane
• Very high cost (packets loop through same routers untilTTL runs out)
⇒ Routing has to be perfectly loop-free
NDN: Detect & handle loops via nonce!
2
![Page 3: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/3.jpg)
Routing and Forwarding in IP Networks
No Loop Detection on Forwarding Plane
• Very high cost (packets loop through same routers untilTTL runs out)
⇒ Routing has to be perfectly loop-free
NDN: Detect & handle loops via nonce!
2
![Page 4: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/4.jpg)
Routing and Forwarding in IP Networks
No Loop Detection on Forwarding Plane
• Very high cost (packets loop through same routers untilTTL runs out)
⇒ Routing has to be perfectly loop-free
NDN: Detect & handle loops via nonce!2
![Page 5: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/5.jpg)
Traffic Splitting
Great benefits of using multiple paths at the same time!
• Load Balancing• Gradual shifting of traffic during congestion [1, 2]• Exploiting differences in cost and performance of paths
(WiFi vs. LTE) [3]
Traffic Splitting requires Loop-Freeness and Path Choice
3
![Page 6: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/6.jpg)
Traffic Splitting
Great benefits of using multiple paths at the same time!
• Load Balancing• Gradual shifting of traffic during congestion [1, 2]• Exploiting differences in cost and performance of paths
(WiFi vs. LTE) [3]
Traffic Splitting requires Loop-Freeness and Path Choice
3
![Page 7: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/7.jpg)
NLSR: High Path Choice, but many Loops
4
![Page 8: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/8.jpg)
Loop-Free Routing: Limited Path Choice
5
![Page 9: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/9.jpg)
Incoming Interface-Exclusion: Higher Path Choice
6
![Page 10: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/10.jpg)
How To Achieve That?
Via Routing? Too complex!
1. Trad: Undirected graph ⇒ Directed Acyclic Graph (DAG)2. Now: ⇒ Directed graph without cycles longer than
one hop!
Solution:
1. Almost Loop-free Routing (ALR)2. On-demand Loop Removal at forwarding layer
7
![Page 11: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/11.jpg)
How To Achieve That?
Via Routing? Too complex!
1. Trad: Undirected graph ⇒ Directed Acyclic Graph (DAG)2. Now: ⇒ Directed graph without cycles longer than
one hop!
Solution:
1. Almost Loop-free Routing (ALR)2. On-demand Loop Removal at forwarding layer
7
![Page 12: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/12.jpg)
Almost Loop-Free Routing
Give each nexthop in FIB a Type: { Downward, Upward,Disabled }.
1. Fill FIB with Downward Nexthops
2. If prefix still has only one nexthop:
• Go through all disabled nexthops:• If NH passes Heuristic Loop Checks:
Add as Uphill; break;
⇒ Much more nodes with at least 2 nexthops, and lowlooping chance.
Forwarding loop: Uphill Nexthop Removal (UNR)
8
![Page 13: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/13.jpg)
Almost Loop-Free Routing
Give each nexthop in FIB a Type: { Downward, Upward,Disabled }.
1. Fill FIB with Downward Nexthops
2. If prefix still has only one nexthop:
• Go through all disabled nexthops:• If NH passes Heuristic Loop Checks:
Add as Uphill; break;
⇒ Much more nodes with at least 2 nexthops, and lowlooping chance.
Forwarding loop: Uphill Nexthop Removal (UNR)
8
![Page 14: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/14.jpg)
Example of Loop-Freeness Heuristic
9
![Page 15: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/15.jpg)
Example of Loop-Freeness Heuristic
9
![Page 16: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/16.jpg)
Example of Loop-Freeness Heuristic
9
![Page 17: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/17.jpg)
Example of Loop-Freeness Heuristic
9
![Page 18: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/18.jpg)
Evaluation
Results of 8 other routing protocols in 9 topologies:
• ALR: Low computational complexity, similar to NLSR.• UNR: Very low forwarding complexity (only 0.4% to 1.6%
of FIB entries need to be changed)
Together: Completely loop-free network with higher pathchoice than loop-free routing for all tested topologies.
10
![Page 19: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/19.jpg)
Summary
How to Establish Loop-Free Multipath Routes in NDN?
• Loop-free routing vs. Loop handling at Forw. Layer
Traffic Splitting needs Loop-freeness and high Path Choice
• Loop-free routing provides former, but not latter.• Current NDN routing vice versa.
⇒ Achieving both by combining Almost-Loopfree Routingwith Loop-removal at the forwarding layer.
Future Work:
• Tech Report coming soon!
11
![Page 20: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/20.jpg)
Summary
How to Establish Loop-Free Multipath Routes in NDN?
• Loop-free routing vs. Loop handling at Forw. Layer
Traffic Splitting needs Loop-freeness and high Path Choice
• Loop-free routing provides former, but not latter.• Current NDN routing vice versa.
⇒ Achieving both by combining Almost-Loopfree Routingwith Loop-removal at the forwarding layer.
Future Work:
• Tech Report coming soon!
11
![Page 21: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/21.jpg)
Summary
How to Establish Loop-Free Multipath Routes in NDN?
• Loop-free routing vs. Loop handling at Forw. Layer
Traffic Splitting needs Loop-freeness and high Path Choice
• Loop-free routing provides former, but not latter.• Current NDN routing vice versa.
⇒ Achieving both by combining Almost-Loopfree Routingwith Loop-removal at the forwarding layer.
Future Work:
• Tech Report coming soon!
11
![Page 23: How to Establish Loop-Free Multipath Routes in Named Data ...[1]Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and Sen Wang. Optimal multipath congestion](https://reader034.fdocuments.net/reader034/viewer/2022052005/601965abc0e8093dc615e8f1/html5/thumbnails/23.jpg)
References I
[1] Giovanna Carofiglio, Massimo Gallo, Luca Muscariello, Michele Papalini, and SenWang.Optimal multipath congestion control and request forwarding ininformation-centric networks.In ICNP, 2013.
[2] Klaus Schneider, Cheng Yi, Beichuan Zhang, and Lixia Zhang.A practical congestion control scheme for named data networking.In Proceedings of ICN 2016, pages 21–30. ACM, 2016.
[3] Klaus M Schneider and Udo R Krieger.Beyond network selection: Exploiting access network heterogeneity with nameddata networking.In Proceedings of the 2nd International Conference on Information-Centric Networking, pages 137–146. ACM,2015.
13