Scalable Routing on Flat Names
Ankit Singla, P. Brighten Godfrey, Kevin Fall, Gianluca Iannaccone,, and Sylvia Ratnasamy
TL;DR
This paper presents a scalable routing protocol for flat, location-independent identifiers that guarantees low stretch and adapts dynamically, building on theoretical compact routing advances.
Contribution
It is the first to implement scalable, low-stretch routing on flat names in a dynamic distributed environment.
Findings
Achieves guaranteed scalability and low stretch in routing.
Operates effectively in dynamic, distributed networks.
Builds on and extends theoretical compact routing principles.
Abstract
We introduce a protocol which routes on flat, location-independent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Mobile Ad Hoc Networks