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.

1 Follower
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The IPTV service, in which high-capacity content is broadcast from the IPTV server to a huge number of users, is becoming very popular. To establish an effective IPTV network, we need to minimize the cost of the IPTV multicast tree. That tree consists of a node, to which an IPTV server is connected, as the root node and other nodes, to which users are connected. In addition, we have to consider users who belong to multiple network domains. In this paper, we apply hierarchically distributed path computation elements (HDPCEs) to cooperatively create appropriate IPTV trees for multidomain users. Each HDPCE shares the burden of creating a multidomain multicast tree. Thus, we can reduce the computational burdens of creating a multicast tree. In addition, we enable choosing three different algorithms to create the cheapest multicast trees in individual domains. One of them is a new multiplex-aware-route- selection (MARS) algorithm. We evaluated the applicability of the three algorithms to various types of domains depending on network conditions.
    Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE; 12/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a new traffic engineering load balancing taxonomy, classifying several publications and including their objective functions, constraints and proposed heuristics. Using this classification, a novel Generalized Multiobjective Multitree model (GMM-model) is proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a new version of a multiobjective multicast routing algorithm (MMA) for traffic-engineering, based on the strength Pareto evolutionary algorithm (SPEA), which simultaneously optimizes the maximum link utilization, the cost of the tree, the maximum end-to-end delay and the average delay. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. Simulation results show that MMA is able to find Pareto optimal solutions. They also show that for dynamic multicast routing, where the traffic requests arrive one after another, MMA outperforms other known algorithms
    Computer Communications and Networks, 2004. ICCCN 2004. Proceedings. 13th International Conference on; 11/2004


Available from