Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints

Authors:
Sheng-Yuan Tseng;Chang-Chun Lin;Yueh-Min Huang
Affiliations:
Department of Information Management, Kun-Shan University, No. 949, Da-Wan Road, Yungkang City, Tainan 710, Taiwan;Department of Information Management, Chang Gung University, 259 Wen-Hwa 1st Road, Kwei-Shan, Tao-Yuan 333, Taiwan;Department of Engineering Science, National Cheng-Kung University, No. 1, Ta-Shueh Road, Tainan 701, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2008

Citing 18
Cited 4

An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay

International Journal of Network Management
Enabling conferencing applications on the internet using an overlay muilticast architecture

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Delay-constrained, low-cost multicast routing in multimedia networks

Journal of Parallel and Distributed Computing
The Delay-Constrained Minimum Spanning Tree Problem

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Scattercast: an architecture for internet broadcast distribution as an infrastructure service

Scattercast: an architecture for internet broadcast distribution as an infrastructure service
Packet Permutation: A Robust Transmission Technique for Continuous Media Streaming Over the Internet

Multimedia Tools and Applications
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Proceedings of the 2003 ACM symposium on Applied computing
A Degree-Delay-Constrained Genetic Algorithm for Multicast Routing Tree

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
An ant-based algorithm for finding degree-constrained minimum spanning tree

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A new evolutionary approach to the degree-constrained minimumspanning tree problem

IEEE Transactions on Evolutionary Computation
Algorithms for delay-constrained low-cost multicast tree construction

Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

Computer Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm

Computer Communications
Decision support for the maintenance management of green areas

Expert Systems with Applications: An International Journal
QoS multicast routing using a quantum-behaved particle swarm optimization algorithm

Engineering Applications of Artificial Intelligence
A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

Heterogeneous ISP router policies prevent multimedia QoS applications, such as real-time media streaming, video conferencing, and distance learning, that require IP layer multicasting from wide deployment on the Internet. Thus, recent efforts have applied application layer multicast to implement such applications by organizing the multicast group in an overlay (virtual), peer-to-peer network. Such a communication scheme can be regarded as a broadcasting problem with degree and delay constraints in the overlay network. The degree and delay-constrained broadcasting problem with minimum-cost appears to be NP-complete. This study proposes an ant colony-based algorithm to solve the difficult broadcasting problem and compares it with some related methods. The results of a series of simulations show the efficiency and effectiveness of the proposed algorithm.