Declarative routing
- 22 August 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 35 (4), 289-300
- https://doi.org/10.1145/1090191.1080126
Abstract
The Internet's core routing infrastructure, while arguably robust and efficient, has proven to be difficult 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.Keywords
This publication has 12 references indexed in Scilit:
- Dynamic Source Routing in Ad Hoc Wireless NetworksPublished by Springer Science and Business Media LLC ,2007
- The case for separating routing from routersPublished by Association for Computing Machinery (ACM) ,2004
- Looking up data in P2P systemsCommunications of the ACM, 2003
- NIRAPublished by Association for Computing Machinery (ACM) ,2003
- Domain-specific languagesACM SIGPLAN Notices, 2000
- A Framework for Testing Safety and Effective ComputabilityJournal of Computer and System Sciences, 1996
- Extensibility safety and performance in the SPIN operating systemPublished by Association for Computing Machinery (ACM) ,1995
- Core based trees (CBT)Published by Association for Computing Machinery (ACM) ,1993
- Alpha: an extension of relational algebra to express a class of recursive queriesIEEE Transactions on Software Engineering, 1988
- A generalization of the differential approach to recursive query evaluationThe Journal of Logic Programming, 1987