Routing Algorithms and Architectures

Research >> Routing Algorithms and Architectures >> Internet Routing Algorithms

This thread of research is concerned with applying new routing algorithms to the Internet context. A routing algorithm needs to support Internet policies and economic relationships in order to have some chance at being deployable in the current economic ISP structure. The other concern, of course, is the scale of the Internet; a routing protocol that serves several hundred millions of hosts needs to be scalable and robust.

ROFL: Routing on Flat Labels

People : Jayanthkumar Kannan, Matthew Caesar (UC Berkeley), Tyson Condie (UC Berkeley), Karthik Lakshminarayanan (UC Berkeley), Ion Stoica (UC Berkeley), Scott Shenker (UC Berkeley/ICSI).

This work is aimed at illustrating a way to bypass the classic location/identity dilemma in Internet Architecture by simply choosing routing on the identity itself (identities are flat labels). For this purpose, we adapted a DHT-Based routing protocol (Virtual Ring Routing, VRR) for the Internet by (a) allowing ISPs to nominate hosting routers that host identifiers on behalf of their customer's hosts (b) supporting the basic policies of customer-provider and peering relationships through multiple DHTs at various levels (c) Improving the scalability and modifying the state maintanence algorithms. Routing on flat labels has another advantages: location dependent addresses do not need be parcelled out like today, and this considerably reduces the pain of configuring hosts and prefixes today. This work was published as:
- Matthew Caesar, Tyson Condie, Jayanthkumar Kannan, Karthik Lakshminarayanan, Ion Stoica, and Scott Shenker, "ROFL: Routing on Flat Labels" , ACM SIGCOMM, Pisa, Italy, September 2006.

Research >> Routing Algorithms and Architectures >> Internet Routing Algorithms

ROFL: Routing on Flat Labels