by Hussein F. Salama, Yannis Viniotis, Douglas S. Reeves
ftp://ftp.eos.ncsu.edu/pub/ccsp/papers/ppr9646.pdf
Add To MetaCart
Abstract:
We study the problem of constructing delay-constrained shared multicast trees for real-time applications in connection-oriented high-speed networks. We formulate the problem as a diameter-constrained minimum Steiner tree problem, and prove that it is NP-complete. Then we propose distributed, dynamic heuristics for solving this problem. Most previous work on shared multicast trees starts by selecting a multicast center, and then constructs a shared tree around it. One of the heuristics we propose eliminates the need for a dedicated center selection phase. We use simulation to evaluate the performance of the proposed heuristics.
Citations
|
834
|
Reducibility among Combinatorial Problems
– Karp
- 1972
|
|
461
|
The PIM architecture for wide-area multicast routing
– Deering
- 1996
|
|
277
|
Core Based Trees (CBT): An Architecture for Scalable Inter-Domain Multicast Routing
– Ballardie, Francis, et al.
- 1993
|
|
173
|
Multicast routing for multimedia communication
– Kompella, Pasquale, et al.
- 1993
|
|
123
|
The trade-offs of multicast trees and algorithms
– Wei, Estrin
- 1994
|
|
76
|
A Distributed Algorithm for Delay-Constrained Unicast Routing
– Salama, Reeves, et al.
- 1997
|
|
66
|
Multicast Routing with End-to-End Delay and Delay Variation Constraints
– Rouskas, Baldine
- 1996
|
|
61
|
Mechanisms for Broadcast and Selective Broadcast (excerpts from
– Wall
- 1980
|
|
59
|
The Design and Evaluation of Routing Algorithms for Real-Time Channels
– Widyono
- 1994
|
|
50
|
Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks
– Salama, Reeves, et al.
- 1997
|
|
41
|
et al., “Resource ReSerVation
– Braden
- 1997
|
|
40
|
Core Selection Methods for Multicast Routing
– Calvert, Zegura, et al.
- 1995
|
|
39
|
A source-based algorithm for delay-constrained minimum-cost multicasting
– Zhu, Parsa, et al.
- 1995
|
|
39
|
Distance Vector Multicast Routing
– Waitzman, Partridge, et al.
- 1988
|
|
31
|
Two Distributed Algorithms for the Constrained Steiner Tree Problem
– Kompella, Pasquale, et al.
- 1993
|
|
19
|
Optimum Routing of Multicast Streams
– Noronha, Tobagi
- 1994
|
|
18
|
A Comparison of Multicast Trees and Algorithms
– Wei, Estrin
- 1993
|
|
17
|
Efficient Multicast Routing for Delay-Sensitive Applications
– Sun, Langendoerfer
- 1995
|
|
15
|
Multicast routing for real-time communication on high-speed networks
– Salama
- 1996
|
|
12
|
Multicast Tree Construction in Network Topologies with Asymmetric Link Loads
– Shukla, Boyer, et al.
- 1994
|
|
11
|
Routing Information
– Hedrick
- 1988
|
|
6
|
Distributed Center-Location Algorithms: Proposals and Comparisons
– Thaler, Ravishankar
- 1996
|
|
1
|
Prycker, Asynchronous Tranfer Mode, Solution for Broadband ISDN
– de
- 1995
|
