Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
Multicast: concept, problems, routing protocols, algorithms and QoS extensions
Distributed multimedia databases
Heuristic algorithms for packing of multiple-group multicasting
Computers and Operations Research
An Adaptive Multicast Tree with QoS Support for Heterogeneous Recipients
Journal of VLSI Signal Processing Systems
Real-time multicast in wireless communication
ICPP '97 Proceedings of the international Conference on Parallel Processing
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
On Multicasting with Minimum Costs for the Internet Topology
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
The Delay-Constrained Minimum Spanning Tree Problem
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Fault Recovery for a Distributed QoS-Based Multicast Routing Algorithm
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
A dynamic multicast routing satisfying multiple QoS constraints
International Journal of Network Management
An efficient QoS routing algorithm for quorumcast communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture
The Journal of Supercomputing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
A QoS multicast routing protocol for dynamic group topology
Information Sciences: an International Journal
Dynamic delay-constrained minimum-energy dissemination in wireless sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Applying tabu search to backup path planning for multicast networks
Computers and Operations Research
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
IEEE Transactions on Mobile Computing
A QoS multicast routing protocol for clustering mobile ad hoc networks
Computer Communications
A degree-constrained QoS-aware routing algorithm for application layer multicast
Information Sciences: an International Journal
Group multicast routing problem: A genetic algorithms based approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cost-effective multicast approaches for time-critical applications in dynamic network environments
Journal of High Speed Networks
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Advanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A multi-constrained multicast QoS routing algorithm
Computer Communications
Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem
Computer Communications
QoS Multicast Routing Algorithms Based on Tabu Search with Hybrid Candidate List
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
On the methodology for the evaluation of unconstrained multicast routing algorithms
ICT'09 Proceedings of the 16th international conference on Telecommunications
An effective candidate list strategy for tabu search based QoS multicast routing
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
The application of ant colony algorithm on mobile multicast routing
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
On bandwidth adjusted multicast in pipelined routing architecture for mobile environment
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
QoS-based MPLS multicast tree selection algorithms
Proceedings of the 7th International Conference on Frontiers of Information Technology
AS-level source routing for multi-provider connection-oriented services
Computer Networks: The International Journal of Computer and Telecommunications Networking
An optimal VP-based multicast routing in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
An algorithm for multicast tree generation in networks with asymmetric links
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Multicast routing with end-to-end delay and delay variation constraints
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
QoS and resource management in distributed interactive multimedia environments
Multimedia Tools and Applications
Proceedings of the Nineteenth International Workshop on Quality of Service
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
On multicast communications with minimum resources
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Multicast ω-trees based on statistical analysis
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Research: A new distributed routing algorithm for supporting delay-sensitive applications
Computer Communications
A fuzzy genetic algorithm for QoS multicast routing
Computer Communications
QoS-guaranteed one-to-many and many-to-many multicast routing
Computer Communications
A QoS-guaranteed multicast routing protocol
Computer Communications
QoS-driven multicast tree generation using Tabu search
Computer Communications
An efficient and easily deployable QoS-based routing scheme for online Internet multicasting
Computer Communications
Dynamic multicast routing in VLSI
Computer Communications
A routing algorithm for dynamic multicast trees with end-to-end path length control
Computer Communications
Wireless Personal Communications: An International Journal
The cost optimal solution of the multi-constrained multicast routing problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
Discrete Applied Mathematics
| Hi-index | 0.00 |
A new heuristic algorithm is presented for constructing minimum-cost multicast trees with delay constraints. The new algorithm can set variable delay bounds on destinations and handles two variants of the network cost optimization goal: one minimizing the total cost (total bandwidth utilization) of the tree, and another minimizing the maximal link cost (the most congested link). Instead of the single-pass tree construction approach used in most previous heuristics, the new algorithm is based on a feasible search optimization method which starts with the minimum-delay tree and monotonically decreases the cost by iterative improvement of the delay-bounded tree. The optimality of the costs of the delay-bounded trees obtained with the new algorithm is analyzed by simulation. Depending on how tight the delay bounds are, the costs of the multicast trees obtained with the new algorithm are shown to be very close to the costs of the trees obtained by the Kou, Markowsky and Berman's algorithm (1981).