Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks

Ling Xiu Wang; Ye Wen Cao

doi:10.4028/www.scientific.net/AMR.204-210.1399

Paper Titles

Risk Assessment for Remanufacturing System Based on Neural Network
p.1382

A WT-Based Edge Detection with Adaptive Threshold
p.1386

Efficient Robust Blind Beamforming Algorithm
p.1390

Traffic Sign Detection and Pattern Recognition Based on Binary Tree Support Vector Machines
p.1394

Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks
p.1399

On the Measure of Compactness of Fuzzy Clustering
p.1403

Moving Object Detection Based on Edge Pair Difference
p.1407

Gear Fault Detection Based on Angle Domain Average and Teager Kaiser Energy Operator Demodulation Technique
p.1411

Contour Extraction of Cerebrovascular Based on Maximum Optimization Cost
p.1415

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 204-210Ant Colony-Based Load Balancing Algorithm for...

Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks

Abstract:

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.