Conference Paper

Explicit multicast routing algorithms for constrained traffic engineering

Seoul Nat. Univ.
DOI: 10.1109/ISCC.2002.1021715 Conference: Computers and Communications, 2002. Proceedings. ISCC 2002. Seventh International Symposium on
Source: IEEE Xplore

ABSTRACT This paper presents a new traffic engineering technique for dynamic constrained multicast routing, where the routing request of traffic arrives one-by-one. The objective we adopted is to minimize the maximum of link utilization. Although this traffic engineering is useful to relax the most heavily congested link in the Internet backbone, the total network resources, i.e. sum of link bandwidth consumed, could be wasted when the acquired path is larger (in terms of number of hops) than the conventional shortest path. Accordingly we find a multicast tree for routing request that satisfies the hop-count constraint. We formulate this problem as a mixed-integer programming problem and propose a new heuristic algorithm to find a multicast tree for multicast routing request. The presented heuristic algorithm uses the link-state information, i.e. link utilization, for multicast tree selection and is amenable to distributed implementation. The extensive simulation results show that the proposed traffic engineering technique and heuristic algorithm efficiently minimize the maximum of link utilization better than the shortest path.

0 Bookmarks
 · 
79 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: With the rapid growth of broadband network deployment and multimedia streaming development, Internet protocol (IP) multicast networks have become a delivery mechanism for Internet protocol television (IPTV). IPTV provides a two-way interactive service to the viewers, which generates the path request for IP multicast network. Thus, it is essential to evaluate the path rejection probability accurately and further to reduce it. In this paper, we propose a new dynamic multicast routing algorithm for broadband IPTV services and apply it to three legacy algorithms. These integrated multicast routing algorithms support the minimum cost and the traffic engineering features, in order to maximize the acceptance rate for bandwidth constraint path request under IPTV service environments. Furthermore, we compare their network performances in terms of the acceptance rate and delay by experimental simulations. The simulation result gives us that the nearest node first Dijkstra algorithm can be the optimal solution of multicast connection for IPTV service delivery.
    EURASIP Journal on Wireless Communications and Networking 2013(1). · 0.54 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA). Multitree traffic engineering uses several trees to transmit one multicast demand between a source and a set of destinations. The purpose of the M-MMA is to balance the traffic load and optimize the utilization of the network resources. For the accomplishment of the optimization goal, M-MMA proposes a local optimization procedure that finds solutions that improve the relative amount of information to be transmitted through each tree.The approach of the M-MMA is inspired in the ideas of the well-known Strength Pareto Evolutionary Algorithm (SPEA). It simultaneously optimizes six objective functions: maximum link utilization, total bandwidth consumption, total cost, hops count, average delay and maximum delay. Simulations on several network topologies prove an enhanced performance when compared to previously published results as the Multiobjective Multicast Algorithm (MMA).
    01/2005;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This work presents two multiobjective algorithms for Multicast Traffic Engineering. The proposed algorithms are new versions of the Multi-Objective Ant Colony System (MOACS) and the Max-Min Ant System (MMAS), based on Ant Colony Optimization (ACO). Both ACO algorithms simultaneously optimize maximum link utilization and cost of a multicast routing tree, as well as average delay and maximum end-to-end delay, for the first time using an ACO approach. In this way, a set of optimal solutions, know as Pareto set is calculated in only one run of the algorithms, without a priori restrictions. Experimental results show a promising performance of both proposed algorithms for a multicast traffic engineering optimization, when compared to a recently published Multiobjective Multicast Algorithm (MMA), specially designed for Multiobjective Multicast Routing Problems.
    01/2005;

Full-text

Download
1 Download
Available from