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

Exact algorithm for delay-constrained capacitated minimum spanning tree network

โœ Scribed by Lee, Y.J.; Atiquzzaman, M.


Book ID
117810207
Publisher
The Institution of Engineering and Technology
Year
2007
Tongue
English
Weight
273 KB
Volume
1
Category
Article
ISSN
1751-8628

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A distributed algorithm for constructing
โœ 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