Cost analysis of multicast transport architectures in multiservice networks
IEEE/ACM Transactions on Networking (TON)
A Scalable Framework for Secure Group Communication
ICN '01 Proceedings of the First International Conference on Networking-Part 2
LVMSR: an efficient algorithm to multicast layered video
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
M-MENTOR: a design algorithm for IP networks with mixed traffic
WSEAS TRANSACTIONS on COMMUNICATIONS
QoS-based MPLS multicast tree selection algorithms
Proceedings of the 7th International Conference on Frontiers of Information Technology
An IP network design algorithm for mixed traffic
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Multicast routing protocol with heterogeneous and dynamic receivers
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Design diffserv multicast with selfish agents
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Algorithms for delay-constrained low-cost multicast tree construction
Computer Communications
| Hi-index | 0.07 |
The Internet is being used to distribute video programming to small, widely distributed audiences over a multicast backbone (Mbone). This type of service can be used to deliver specialized programming to the general population. As the service becomes more widely used, conserving the required transmission facilities becomes more important. We define the problem of designing multicast networks for video distribution. The problem is related to the Steiner tree problem, with an interesting twist. The line costs are not constant. An heuristic is developed to solve the problem and the new heuristic is related to and compared with heuristics, developed for the Steiner tree problem and algorithms to design minimum depth and minimum spanning trees