Local Area Networks (LAN) White Papers
An Optimal Dynamic Multicast Routing Algorithm for High-Speed LAN/MAN Interconnections
Overview This paper proposes a Dynamic Delay-bounded Multicasting Routing algorithm (DDMR) that satisfies the network conditions of delay constraints, cost minimization and can adapt to a dynamically changing network condition of adding and deleting a node from the group for the high-speed LAN/MAN interconnections. The paper views the following network requirements: the efficient dynamic group support, high-quality data distribution, and adaptability to dynamically changing events. First of all, delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost. In addition, the paper constructs the dynamic delay-bounded optimal multicast tree using partial multicast routing.
| Publisher | Kangnung National University | File Format | |
|---|---|---|---|
| Date Published | June 2000 | Downloads | 1 |
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
