Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries (2005)

Cached

Download Links

[www.cs.berkeley.edu]

Other Repositories/Bibliography

DBLP

by Boon Thau Loo , Joseph M. Hellerstein , Ion Stoica , Raghu Ramakrishnan

Venue:	IN PROCEEDINGS OF ACM SIGCOMM'05
Citations:	86 - 36 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	Declarative Routing: Extensible Routing with Declarative Queries	user correction - Legacy Corrections
AUTHOR NAME	Boon Thau Loo	user correction
AUTHOR AFFIL	∗ UC Berkeley † Intel Research δ University of Wisconsin-Madison	user correction
AUTHOR NAME	Joseph M. Hellerstein	user correction
AUTHOR NAME	Ion Stoica	user correction
AUTHOR AFFIL	∗ UC Berkeley † Intel Research δ University of Wisconsin-Madison	user correction
AUTHOR NAME	Raghu Ramakrishnan	user correction
AUTHOR AFFIL	∗ UC Berkeley † Intel Research δ University of Wisconsin-Madison	user correction
ABSTRACT	The Internet's core routing infrastructure, while arguably robust and e#cient, has proven to be di#cult to evolve to accommodate the needs of new applications. Prior research on this problem has included new hard-coded routing protocols on the one hand, and fully extensible Active Networks on the other. In this paper, we explore a new point in this design space that aims to strike a better balance between the extensibility and robustness of a routing infrastructure. The basic idea of our solution, which we call declarative routing, is to express routing protocols using a database query language. We show that our query language is a natural fit for routing, and can express a variety of well-known routing protocols in a compact and clean fashion. We discuss the security of our proposal in terms of its computational expressive power and language design. Via simulation, and deployment on PlanetLab, we demonstrate that our system imposes no fundamental limits relative to traditional protocols, is amenable to query optimizations, and can sustain long-lived routes under network churn and congestion.	user correction - Legacy Corrections
YEAR	2005	INFERENCE
VENUE	IN PROCEEDINGS OF ACM SIGCOMM'05	user correction
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	24 found	ParsCit 1.0