๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient multicast search under delay and bandwidth constraints

โœ Scribed by Amotz Bar-Noy; Zohar Naor

Publisher
Springer
Year
2006
Tongue
English
Weight
307 KB
Volume
12
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient multicast routing with delay c
Efficient multicast routing with delay constraints
โœ Gang Feng; Tak-Shing Peter Yum ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 333 KB

To support real-time multimedia applications in BISDN networks, QoS guaranteed multicast routing is essential. Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. In this paper, we pr

Distributed multicast routing, with end-
Distributed multicast routing, with end-to-end delay and delay variation constraints
โœ C.P. Low; Y.J. Lee ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 737 KB

We study the problem of constructing multicast trees for high-bandwidth delay-sensitive applications in a point-to-point communication network. This problem arise in real time multimedia applications, which often requires bounded end-to-end delay along paths from the source to each destination and b

A distributed algorithm for constructing
A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks
โœ Thilmee M. Baduge; Akihito Hiromori; Hirozumi Yamaguchi; Teruo Higashino ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 787 KB

## Abstract In this paper, we propose a new protocol that constructs a spanning tree on an overlay network given by a complete graph, in a decentralized manner. This algorithm consists of two decentralized operations, which support joining of and leaving of the overlay network at any time in the se