Multimedia systems: enabling computer engineering education

Burleson, Wayne; Thampuran, Santhosh; Ramaswamy, N.

doi:10.1109/fie.2002.1157944

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The rise of various distributed multi-mediaapplications has strict requirements of network QoS [1]. As the critical technology of those real-time applications, multicast has gradually become a research hotspot [2].…”

Section: Introductionmentioning

confidence: 99%

The Tree-Based Ant Colony Algorithm for Multi-Constraints Multicast Routing

Wang

Zhao

et al. 2007

The 9th International Conference on Advanced Communication Technology

View full text Add to dashboard Cite

Based on the principle of ant colony algorithm this paper proposes a new ant colony algorithm based on trees, and applies it to the solution of multi-constraints QoS network multicast routing. An ant moves constantly on the network to find a multicast tree including source nodes and destination nodes. This action is operated repetitively and pheromones are updated regularly, and an optimal multicast tree satisfying different QoS constraints can finally be found. Simulation results indicate that in solving multicast routing problems the convergence speed of the tree-based ant colony algorithm is much higher than that of conventional ant colony algorithm. And the performance of the best solution found by the new algorithm is not worse.

show abstract

Section: Introductionmentioning

confidence: 99%

The Tree-Based Ant Colony Algorithm for Multi-Constraints Multicast Routing

Wang

Zhao

et al. 2007

The 9th International Conference on Advanced Communication Technology

View full text Add to dashboard Cite

show abstract

An Cross-Entropy Algorithm for multi-Constraints QoS Multicast Routing

Wang

Zhao

2007

2007 Second International Conference on Communications and Networking in China

View full text Add to dashboard Cite

Many applications in the network like multimedia transmission have strict demands for QoS, such as bandwidth, delay, packet loss rate, etc. Finding the multicast tree that satisfies those requirements is an NP-complete problem. Among the existing algorithms for multi-constraints QoS multicast are local search algorithms or centralized algorithms, which cannot guarantee the finding of global solutions in real network. In this paper, we propose an ant colony algorithm based on crossentropy for multi-Constraints QoS multicast routing. Simulation results in NS-2 environment indicate that this algorithm can quickly find the close-to-the-best solution I.

show abstract