TY - JOUR
T1 - Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks
AU - Tseng, Sheng Yuan
AU - Huang, Yueh Min
AU - Lin, Chang Chun
PY - 2006/11/8
Y1 - 2006/11/8
N2 - Heterogeneous ISP router policies prevent QoS multimedia applications requiring IP layer multicasting, such as real-time media streaming, video conferencing and distance learning, from wide deployment on the Internet. Therefore recent studies have implemented such applications by application layer multicasting through organizing the multicast group in a peer-to-peer overlay network. QoS requirements limit the transmission time and the number of receivers to which each node can transmit. Such a communication scheme in an overlay network can be regarded as a degree- and delay-constrained minimum-cost broadcasting problem, and appears to be NP-complete. This study proposes a novel genetic algorithm for resolving this difficult broadcasting problem and, then, compares it with some state-of-the-art methods. Simulation results with a series of problems demonstrate the efficiency and effectiveness of the proposed algorithm.
AB - Heterogeneous ISP router policies prevent QoS multimedia applications requiring IP layer multicasting, such as real-time media streaming, video conferencing and distance learning, from wide deployment on the Internet. Therefore recent studies have implemented such applications by application layer multicasting through organizing the multicast group in a peer-to-peer overlay network. QoS requirements limit the transmission time and the number of receivers to which each node can transmit. Such a communication scheme in an overlay network can be regarded as a degree- and delay-constrained minimum-cost broadcasting problem, and appears to be NP-complete. This study proposes a novel genetic algorithm for resolving this difficult broadcasting problem and, then, compares it with some state-of-the-art methods. Simulation results with a series of problems demonstrate the efficiency and effectiveness of the proposed algorithm.
UR - http://www.scopus.com/inward/record.url?scp=33750304763&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750304763&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2006.06.003
DO - 10.1016/j.comcom.2006.06.003
M3 - Article
AN - SCOPUS:33750304763
SN - 0140-3664
VL - 29
SP - 3625
EP - 3632
JO - Computer Communications
JF - Computer Communications
IS - 17
ER -