Dynamic constrained traffic engineering for multicast routing

Abstract

This paper presents a new traffic engineering technique for dynamic constrained multicast routing, where routing request of traffic arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traffic engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwidth consumed, could be used 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 mixed-integer programming problem and propose a newheuristic algorithm to find a multicast tree for multicast routing request. The presented heuristic algorithm uses link-state information, i.e. link utilization, for multicast tree selection and is amenable to distributed implementation. The extensive simulation results showthat the proposed traffic engineering technique and heurisitc algorithm efficiently minimize the maximum of link utilization better than the shortest path.