Paper Info
Title
Efficient Heuristic for Multicasting in Arbitrary Networks
Abstract
Multicast is a communication model in which a message is sent from a source to an arbitrary number of distinct destinations. Two main parameters that are used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic, i.e., the total number of links involved in the multicast process. It has been proved that finding an optimal multicast solution on both time and traffic is NP-hard. We propose a heuristic for the multicasting problem in an arbitrary network. We performed extensive simulations on for pure random network topologies and two types of N-Level Hierarchical topologies. We tested our heuristic against a random algorithm for multicasting and we present comparative results.
Year
DOI
Venue
2009
10.1109/WAINA.2009.148
AINA Workshops
Keywords
Field
DocType
arbitrary networks,n-level hierarchical topology,total number,pure random network topology,arbitrary number,multicasting problem,random algorithm,multicast routing,efficient heuristic,arbitrary network,multicast process,optimal multicast solution,data mining,transmitters,networks,unicast,computational complexity,pediatrics,communication model,algorithms,topology,telephony,randomized algorithm,testing,network topology,tree graphs,multicasting,broadcasting,np hard,probability density function
Protocol Independent Multicast,Source-specific multicast,Heuristic,Multicast address,Computer science,Xcast,Computer network,Pragmatic General Multicast,Multicast,Distance Vector Multicast Routing Protocol,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
9
Authors
3
Name
Order
Citations
PageRank
Hovhannes A. Harutyunyan120628.18
Rahul Katragadda2423.74
Calin D. Morosan3153.60