Declarative routing: extensible routing with declarative queries

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...

• Type: Conference
• Year: 2005
• Where: SIGCOMM
• Authors: Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, Raghu Ramakrishnan
• Keywords: Hard-coded Routing Protocols, Routing, Routing Protocols, SIGCOMM 2005