Multi-objective scheme over multi-tree routing in multicast MPLS networks
LANC '03 Proceedings of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research
Solving multiobjective multicast routing problem with a new ant colony optimization approach
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
A multitree approach for multicast routing
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
Hashing based traffic partitioning in a multicast-multipath MPLS network model
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
Multi-objective optimization scheme for multicast flows: a survey, a model and a MOEA solution
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
QoS-based MPLS multicast tree selection algorithms
Proceedings of the 7th International Conference on Frontiers of Information Technology
Generalized multiobjective multitree model solution using MOEA
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
| Hi-index | 0.00 |
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 in this paper is to minimize the maximumof 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 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 mixed-integer programming problem and propose a new heuristic algorithm to find a multicast tree for multi-cast routing request. The presented heuristic algorithm uses the link-state information, i.e. link utilization, for multicast tree selection and is amenable todistributed implementation. The extensive simulation results show that the proposed traffic engineering technique and heurisitc algorithm efficiently minimize the maximum of link utilization better than the shortest path.