By Topic

An Ant Colony Optimization Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Gang Liu ; Dept. of Comput. Sci. & Technol., Shandong Univ., Jinan, China ; Hua Wang ; Hong Zhang

To support large-scale live Internet broadcasting services in the content delivery networks (CDNs) efficiently, we consider a cost-effective multicast approach among the CDN servers in the backbone. This way, the access bandwidth demand can be reduced. The problem is to optimize routing paths among the service nodes in the multicast overlay backbone, and it has been proved to be NP-Hard. We will minimize the accumulative weighted latency from the source to the service nodes according to the number of clients served by each service node. We proposed an algorithm to optimize the multicast tree directly different from the traditional solutions to find paths and integrate them into a multicast tree. Simulation results showed that our algorithm performs well in seeking, converging speed and adaptability scale.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2012 IEEE 11th International Conference on

Date of Conference:

25-27 June 2012