ABSTRACT

This term paper discusses "Declarative routing- Extensible routing with declarative queries" by Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, Raghu Ramakrishnan.
At the end of our analysis we intend to be able to
– Understand the Declarative Routing
– Relationship between Datalog and KBS
– Understanding the fundamentals of the language components
The paper explores a new point in design space of Active Networks and hard-coded protocols aiming to strike a better balance between extensibility and robustness of the routing infrastructure. The authors propose the idea of ‘declarative routing' which expresses routing protocols using a database query language.

MOTIVATION

The motivation behind devising this solution is lack of extensibility and flexibility in today's Internet routing. Though the internet protocols are considerably robust and efficient, they are hard to add, improve or update. Also designing of routing protocols is a very tedious and......

Join Now to view the rest of this term paper!
Members: Login to view this research paper.

Title: Delarative Routing
Approximate Word Count: 3719
Approximate Pages: 15 (250 words per double-spaced page)

With the Term Papers Lab Membership Pass, you get instant access to every essay on this site, including this essay on Delarative Routing, for as long as you remain a member.

Other essays sites charge almost $100 for a single term paper. At Term Papers Lab, you can get instant access to over 100,000 research papers for as little as $29.95!