Sciweavers

16 search results - page 2 / 4
» A Rearrangeable Algorithm for the Construction of Delay-Cons...
Sort
View
INFOCOM
1996
IEEE
13 years 9 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
NETWORKING
2000
13 years 6 months ago
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
Aiguo Fei, Mario Gerla
MMB
2004
Springer
13 years 10 months ago
SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis
Ever-increasing attention has been drawn to source specific multicast in the Internet society. In this paper, a novel multicast scheme, called Scalable Recursive Explicit Multicast...
Yewen Cao, Khalid Al-Begain
BROADNETS
2006
IEEE
13 years 6 months ago
Multicasting in Energy Aware Mobile Backbone Based Wireless Ad Hoc Networks
Multicast protocols for MANET typically construct a tree or mesh structure for multicast message distribution. Typical implementations impose scalability and efficiency limitation...
Choo-Chin Tan, Izhak Rubin
LCN
2008
IEEE
13 years 11 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...