On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem

Authors:
Chor Ping Low;Xueyan Song
Affiliations:
Nanyang Technological Univ., Nanyang Avenue, Singapore;Nanyang Technological Univ., Nanyang Avenue, Singapore
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 10
Cited 10

On finding Steiner vertices

Networks
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Research: A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications
An efficient algorithm for group multicast routing with bandwidth reservation

Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols

IEEE Network: The Magazine of Global Internetworking

A hybrid method for solving ARWA problem on WDM network

Computer Communications
A distributed multicast routing algorithm for real-time applications in wide area networks

Journal of Parallel and Distributed Computing
Evolutionary algorithms for route selection and rate allocation in multirate multicast networks

Applied Intelligence
Guaranteed Bandwidth Requirement Mechanism for Multimedia Multicast Traffic in MANETs

PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
A unified approach for multiple multicast tree construction and max-min fair rate allocation

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Bandwidth-satisfied multicast trees in large-scale ad-hoc networks

Wireless Networks
Route selection and rate allocation using evolutionary computation algorithms in multirate multicast networks

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
On anycast routing with bandwidth constraint

Computer Communications
Bandwidth-satisfied multicast services in large-scale MANETs

IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

Group multicasting is a generalization of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. In this paper, we study the problem of finding feasible solutions for the delay constrained group multicast routing problem (DCGMRP). The routing problem in this case involves the construction of a set of delay bounded multicast trees with bandwidth requirements, one for each member of the group, for multicasting messages to other members of the group. We first show that the problem is NP-complete. Next, we propose a heuristic algorithm to find feasible solutions for this problem. Simulation results show that our proposed algorithm is able to achieve a high probability of finding feasible solutions for DCGMRP, whenever one exists.