Scalable routing on flat names

13 years 2 months ago

Download www.cs.uiuc.edu

We introduce a protocol which routes on flat, locationindependent 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.

Ankit Singla, Brighten Godfrey, Kevin R. Fall, Gia

Real-time Traffic

Compact Routing | Computer Networks | CONEXT 2010 | Locationindependent Identifiers | Low Stretch |

claim paper

Related Content

» ROFL routing on flat labels

» SENS A Scalable and Expressive Naming System using CAN Routing Algorithm

» Scalable Name Lookup in NDN Using Effective Name Component Encoding

» Scalable team multicast in wireless ad hoc networks exploiting coordinated motion

» Using hierarchical location names for scalable routing and rendezvous in wireless sensor n...

» A Feasibility Evaluation on NameBased Routing

» Comparing alternative approaches for networking of named objects in the future Internet

» Efficient Adaptive Routing in Delay Tolerant Networks

» An Internet without the Internet protocol

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	CONEXT
Authors	Ankit Singla, Brighten Godfrey, Kevin R. Fall, Gianluca Iannaccone, Sylvia Ratnasamy

Comments (0)

Sciweavers

Scalable routing on flat names

Compact Routing | Computer Networks | CONEXT 2010 | Locationindependent Identifiers | Low Stretch |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers