Sciweavers

783 search results - page 72 / 157
» Routing in Overlay Multicast Networks
Sort
View
ISPAN
2005
IEEE
14 years 2 months ago
Overlay networks with class
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, ...
CONEXT
2009
ACM
13 years 10 months ago
Scaling all-pairs overlay routing
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 ...
NGC
2001
Springer
116views Communications» more  NGC 2001»
14 years 1 months ago
Scalable IP Multicast Sender Access Control for Bi-directional Trees
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...
Ning Wang, George Pavlou
WWW
2004
ACM
14 years 9 months ago
Hybrid multicasting in large-scale service networks
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....
Jingwen Jin, Klara Nahrstedt
MOBILWARE
2009
ACM
14 years 3 months ago
Chapar: A Cross-Layer Overlay Event System for MANETs
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...
Amir R. Khakpour, Isabelle M. Demeure