Title :
On finding multicast paths in the Internet
Author :
Holopainen, Visa
Author_Institution :
Dept. of Commun. & Networking, Aalto Univ., Aalto, Finland
Abstract :
This paper evaluates the so-called Multicasting via Paths (MVP) protocol. Both an ILP-based (exact) algorithm and a greedy heuristic algorithm for finding MVP paths are presented. By numerical experiments, we find that MVP is usually cheaper than IP multicast within ISP networks (in terms of sum of edge costs), and is only about 0-30% more expensive between ISPs, where the number of destination Autonomous Systems (AS) was varied from 2 to 1024. For comparison, multiple unicast transmissions (IP unicast) is about 15-140% more expensive between ISPs. This suggests that, due to reduced forwarding complexity, the MVP protocol is a viable option for the future Internet.
Keywords :
IP networks; Internet; greedy algorithms; multicast protocols; AS; ILP-based algorithm; IP multicast; IP unicast; ISP networks; Internet; MVP path finding; MVP protocol; autonomous systems; greedy heuristic algorithm; multicasting via path protocol; multiple unicast transmissions; Data preprocessing; Delay; Heuristic algorithms; IP networks; Internet; Multicast communication; Protocols;
Conference_Titel :
Communications (ICC), 2012 IEEE International Conference on
Conference_Location :
Ottawa, ON
Print_ISBN :
978-1-4577-2052-9
Electronic_ISBN :
1550-3607
DOI :
10.1109/ICC.2012.6363812