We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is impor...
The importance of service composition has been widely recognized in the Internet research community due to its high flexibility in allowing development of customized applications....
Abstract. In this paper, we present Chapar, an event system designed for mobile ad hoc networks that supports the publish-subscribe model as well as pointto-point and point-to-mult...