Declarative routing: extensible routing with declarative queries
Declarative routing: extensible routing with declarative queries
复制标题
DOI：
10.1145/1080091.1080126
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
B. T. Loo;J. Hellerstein;I. Stoica;R. Ramakrishnan
中科院分区：
文献类型：
--
作者：
B. T. Loo;J. Hellerstein;I. Stoica;R. Ramakrishnan
互联网的核心路由基础设施，虽然可以说是强大和高效的，已被证明是难以发展，以适应新的应用程序的需求。在此之前的研究这个问题包括新的硬编码路由协议，一方面，完全可扩展的主动网络。在本文中，我们探讨了一个新的设计空间，旨在取得更好的平衡之间的可扩展性和鲁棒性的路由基础设施。我们的解决方案的基本思想，我们称之为声明式路由，是使用数据库查询语言来表达路由协议。我们表明，我们的查询语言是一个自然适合路由，并可以表达各种知名的路由协议，在一个紧凑和干净的方式。我们讨论了我们的建议在其计算表达能力和语言设计的安全性。通过模拟和PlanetLab上的部署，我们证明了我们的系统相对于传统协议没有根本的限制，可以进行查询优化，并且可以在网络动荡和拥塞的情况下维持长寿命的路由。
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.