Sciweavers

Share
SIGCOMM
2006
ACM

ROFL: routing on flat labels

9 years 12 days ago
ROFL: routing on flat labels
It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distinguish the two. One could sidestep this quandary by routing directly on host identities themselves, and eliminating the need for network-layer protocols to include any mention of network location. The key to achieving this is the ability to route on flat labels. In this paper we take an initial stab at this challenge, proposing and analyzing our ROFL routing algorithm. While its scaling and efficiency properties are far from ideal, our results suggest that the idea of routing on flat labels cannot be immediately dismissed. Categories Subject Descriptors C.2.6 [Computer-Communication Networks]: Internetworking; C.2.2 [Computer-Communication Networks]: Network Protocols – Routing Protocols; C.2.1 [Computer-Communication Networks]: Network Architecture and Design General Terms Algorithms, Design, Experimenta...
Matthew Caesar, Tyson Condie, Jayanthkumar Kannan,
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SIGCOMM
Authors Matthew Caesar, Tyson Condie, Jayanthkumar Kannan, Karthik Lakshminarayanan, Ion Stoica
Comments (0)
books