Abstract :
LSP path selection problem in MPLS network has been a hot research field. For unicast, there are already many algorithms to solve it, making the network more resource balanced and useable. Among these algorithms, Minimal Interference Routing Algorithm (MIRA) is the most valued one. This paper presents a novel algorithm for multicast LSP setting up problem based on MIRA, which replaces Maxflow with K time Dijkstra algorithm, and the experiment result shows it achieves much less complexity than traditional algorithm MIRA while providing a good conflict avoiding mechanism.
Keywords :
multicast communication; multiprotocol label switching; telecommunication network routing; LSP path selection; MPLS network; light multicast minimal interference routing module; Bandwidth; Communication system traffic control; Computer science; Costs; Interference; Multicast algorithms; Multiprotocol label switching; Routing; Throughput; Unicast;
