An Optimal Quality of Service Routing Model for Multicast Network

Shao Wei Feng; Jing Zhang; Rui Wang

doi:10.4028/www.scientific.net/AMR.211-212.988

Paper Titles

Bacterial Particle Swarm Optimization Algorithm
p.968

Study on the Package of MEMS High-G Acceleration Sensor
p.973

Realization of Handwheel and Tool Setting of Micro Milling Machine Based on PMAC
p.978

Comparison of Methods for Time-Frequency Analysis of Oil Whip Vibration Signal
p.983

An Optimal Quality of Service Routing Model for Multicast Network
p.988

Optimal Channel Assignment Algorithm for Wireless Networks
p.993

Research on State Recognition and Wear Lifetime Predication of Tribo-System
p.998

Analysis of Accelerated Life Test Data Involving Two Failure Modes
p.1002

Modeling and Analysis of Crash Pulse of Vehicle Body Based on Tipped Equivalent Square Wave Method
p.1007

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 211-212An Optimal Quality of Service Routing Model for...

An Optimal Quality of Service Routing Model for Multicast Network

Abstract:

The QoS requirement of a connection is given as a set of constraints, which can be link constraints, path constraints, or tree constraints. A feasible path (tree) is one that has sufficient residual resources to satisfy the QoS constraints of a connection. In this solution some complicated constraint are relaxed and the primal problem is decomposed into several sub problems. Primal feasible solutions are obtained by some heuristics and a link set adjusting method is proposed by the aggregate flow on links. In computational experiments, the proposed algorithm determines solutions that are within a few percent of an optimal solution with 30 nodes in the QoS model. In terms of performance, our solution has more significant improvement than simple heuristics. The improvement on the total revenue can reach 12% on the average in the QoS model. The improvement of heuristics 2 in the QoS model on the total revenue can reach 8% on the average.