𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed path finding algorithm for stream multicast

✍ Scribed by Xiaofeng Jiang

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
810 KB
Volume
16
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new heuristic algorithm for finding mi
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
✍ Anna HaΔ‡; Kelei Zhou πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn

An Algorithm for finding optimum path in
An Algorithm for finding optimum path in networks
✍ Kabekode V.S. Bhat πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.