Departmental Papers (CIS)

Date of this Version

November 2004

Document Type

Conference Paper

Comments

Postprint version. Copyright 2004 ACM. This is the author's version of the work. It is posted here by permission of ACM fo r your personal use. Not for redistribution. The definitive version was published in Proceedings of the 3rd Workshop on Hot Topics in Networks, November 2004, 6 pages.

NOTE: At the time of publication, author Boon Thau Loo was affiliated with the University of California at Berkeley. Currently (March 2007), he is a faculty member in the Department of Computer and Information Science at the University of Pennsylvania.

Abstract

To meet the demands of new Internet applications, recent work argues for giving end-hosts more control over routing. To achieve this goal, we propose the use of a recursive query language, which allows users to define their own routing protocols. Recursive queries can be used to express a large variety of route requests such as the k shortest paths, shortest paths that avoid (or include) a given set of nodes and least-loaded paths. We show that these queries can be efficiently implemented in the network, and in the simple case when all users request shortest paths, the communication overhead of our solution is similar to that incurred by a distance vector protocol. In addition, when only a subset of nodes issue the same query, the communication cost can be further lowered using automatic query optimization techniques - suggesting that declarative queries and automatic optimization are important in this domain. Finally, we outline the main challenges faced by our proposal, focusing on the expressiveness and efficiency of our proposal.

Share

COinS
 

Date Posted: 08 March 2007