Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ROFL: Routing on Flat Labels Matthew Caesar Tyson Condie Jayanthkumar Kannan
 

Summary: ROFL: Routing on Flat Labels
Matthew Caesar Tyson Condie Jayanthkumar Kannan
Karthik Lakshminarayanan Ion Stoica Scott Shenker
University of California at Berkeley
{mccaesar,tcondie,kjk,karthik,istoica,shenker}@cs.berkeley.edu
ABSTRACT
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 them-
selves, and eliminating the need for network-layer protocols to in-
clude 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 algo-
rithm. 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 Proto-

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences