TY - GEN
T1 - Performance evaluation of AS-friendly peer selection algorithms for P2P live streaming
AU - Fukushima, Yukinobu
AU - Inada, Kazuya
AU - Tao, Yin
AU - Fujiwara, Yasuyuki
AU - Yokohira, Tokumi
PY - 2009/12/1
Y1 - 2009/12/1
N2 - In this paper, we evaluate the performance of peer selection algorithms: MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) to increase the number of joining peers and to decrease inter-AS traffic volume in P2P live streaming, where we assume that every peer's logical hop count (the number of providing peers between an origin streaming server and the peer) is limited by a predetermined value in order to keep real-time property of live streaming. In MLH, a newly joining peer selects such providing peers that the logical hop count is minimum to increase the number of joining peers. And then if there are several such providing peers, the newly joining peer selects such providing peers that the number (physical hop count) of ASs between the newly joining peer and each of the providing peers is minimum to decrease the inter-AS traffic volume. In MPH, a newly joining peer selects providing peers in the reverse order of MLH. Simulation results show that MLH achieves about from 20% to 60% more maximum joining peers than MPH, and MPH shows smaller inter-AS traffic volume than MLH when the number of joining peers is small while MLH shows smaller inter-AS traffic volume when the number of joining peers is large.
AB - In this paper, we evaluate the performance of peer selection algorithms: MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) to increase the number of joining peers and to decrease inter-AS traffic volume in P2P live streaming, where we assume that every peer's logical hop count (the number of providing peers between an origin streaming server and the peer) is limited by a predetermined value in order to keep real-time property of live streaming. In MLH, a newly joining peer selects such providing peers that the logical hop count is minimum to increase the number of joining peers. And then if there are several such providing peers, the newly joining peer selects such providing peers that the number (physical hop count) of ASs between the newly joining peer and each of the providing peers is minimum to decrease the inter-AS traffic volume. In MPH, a newly joining peer selects providing peers in the reverse order of MLH. Simulation results show that MLH achieves about from 20% to 60% more maximum joining peers than MPH, and MPH shows smaller inter-AS traffic volume than MLH when the number of joining peers is small while MLH shows smaller inter-AS traffic volume when the number of joining peers is large.
UR - http://www.scopus.com/inward/record.url?scp=77949480661&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77949480661&partnerID=8YFLogxK
U2 - 10.1109/APCC.2009.5375467
DO - 10.1109/APCC.2009.5375467
M3 - Conference contribution
AN - SCOPUS:77949480661
SN - 9781424447855
T3 - 2009 15th Asia-Pacific Conference on Communications, APCC 2009
SP - 866
EP - 870
BT - 2009 15th Asia-Pacific Conference on Communications, APCC 2009
T2 - 2009 15th Asia-Pacific Conference on Communications, APCC 2009
Y2 - 8 October 2009 through 10 October 2009
ER -