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. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1109/ISCC.2002.1021715 | ISCC |
Keywords | Field | DocType |
mixed-integer programming,multicast tree,internet backbone,simulation results,hop-count constraint,simulation environment,multicast tree selection,total network resources,constrained traffic engineering,new traffic engineering technique,integer programming,explicit multicast routing algorithms,link utilization,heuristic algorithm,congested link,request routing,proposed traffic engineering technique,internet,digital simulation,performance evaluation,dynamic constrained multicast routing,telecommunication traffic,telecommunication network routing,multi-cast routing request,link-state information,multicast routing,link bandwidth,maximumof link utilization,multicast communication,mixed integer programming,routing,shortest path,packet switching,satisfiability,spine,bandwidth | Protocol Independent Multicast,Source-specific multicast,Inter-domain,Multicast address,Link-state routing protocol,Computer science,Xcast,Computer network,Distance Vector Multicast Routing Protocol,Multicast,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-1346 | 0-7695-1671-8 | 14 |
PageRank | References | Authors |
0.98 | 10 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yongho Seok | 1 | 304 | 23.09 |
Young-Seok Lee | 2 | 438 | 54.04 |
Yanghee Choi | 3 | 2235 | 188.82 |
Changhoon Kim | 4 | 1716 | 121.18 |