Data networks
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Quality of service using traffic engineering over MPLS: an analysis
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
| Hi-index | 0.00 |
This paper presents a newtraffic 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 new heuristic 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 show that the proposed traffic engineering technique and heurisitc algorithm efficiently minimize the maximum of link utilization better than the shortest path.