AS-friendly peer selection algorithms without AS topology information in P2P live streaming

Yukinobu Fukushima, Yin Tao, Kazuya Inada, Tokumi Yokohira

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In recent years, peer-to-peer (P2P) live streaming systems are emerging because of their high scalability and robustness. In the systems, peer selection algorithms that determine logical topologies of P2P overlay networks have a great influence on important performance metrics such as the maximum number of joining peers and inter-AS (autonomous systems) traffic volume. As conventional algorithms that take account of those metrics, MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) have been proposed. In MLH, a newly joining peer (say Pnew) selects peers whose logical hop counts are as small as possible, where the logical hop count of a peer is defined as the number of hops from an origin streaming server (OSS) to itself. When there are too many such peers, Pnew selects peers whose physical hop counts are as small as possible, where the physical hop count between two peers is defined as the number of ASs between them. In MPH, Pnew selects peers in the reverse order of MLH. These conventional peer selection algorithms use physical hop count under the assumption that complete AS topology information is available. However, it is hard to obtain the complete information. In this paper, we modify the conventional algorithms so that they use each peer's belonging AS information only instead of AS topology information in order to make them practical. In the modified version of MLH and MPH (MLH' and MPH'), P new selects the peers within the same AS as Pnew instead of peers whose physical hop counts are as small as possible. In addition, in order to distribute top level peers (i.e., peers that directly retrieve video from an OSS) to many ASs, MPH' gives higher priority to selecting peers except OSSs in ASs with OSSs. We evaluate the performance of the modified algorithms by simulation. Simulation results show that 1) MLH' and MPH' achieve almost the same maximum number of joining peers as MLH and MPH, respectively, 2) MLH' shows a maximum of 37% larger inter-AS traffic volume than MLH, 3) MPH' shows larger traffic volume than MPH when the number of joining peers is small, while MPH' shows a maximum of 38% smaller traffic volume than MPH when the number of joining peers is large thanks to the distribution of top level peers to many ASs.

Original languageEnglish
Title of host publication8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
Publication statusPublished - 2010
Event8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 - Kuching, Malaysia
Duration: Jun 15 2010Jun 18 2010

Other

Other8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
CountryMalaysia
CityKuching
Period6/15/106/18/10

Fingerprint

Joining
Topology
Servers
Overlay networks
Scalability

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Fukushima, Y., Tao, Y., Inada, K., & Yokohira, T. (2010). AS-friendly peer selection algorithms without AS topology information in P2P live streaming. In 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 [5532050]

AS-friendly peer selection algorithms without AS topology information in P2P live streaming. / Fukushima, Yukinobu; Tao, Yin; Inada, Kazuya; Yokohira, Tokumi.

8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010. 2010. 5532050.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fukushima, Y, Tao, Y, Inada, K & Yokohira, T 2010, AS-friendly peer selection algorithms without AS topology information in P2P live streaming. in 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010., 5532050, 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010, Kuching, Malaysia, 6/15/10.
Fukushima Y, Tao Y, Inada K, Yokohira T. AS-friendly peer selection algorithms without AS topology information in P2P live streaming. In 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010. 2010. 5532050
Fukushima, Yukinobu ; Tao, Yin ; Inada, Kazuya ; Yokohira, Tokumi. / AS-friendly peer selection algorithms without AS topology information in P2P live streaming. 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010. 2010.
@inproceedings{351633b67a6c493d93f9223eeb8fb80d,
title = "AS-friendly peer selection algorithms without AS topology information in P2P live streaming",
abstract = "In recent years, peer-to-peer (P2P) live streaming systems are emerging because of their high scalability and robustness. In the systems, peer selection algorithms that determine logical topologies of P2P overlay networks have a great influence on important performance metrics such as the maximum number of joining peers and inter-AS (autonomous systems) traffic volume. As conventional algorithms that take account of those metrics, MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) have been proposed. In MLH, a newly joining peer (say Pnew) selects peers whose logical hop counts are as small as possible, where the logical hop count of a peer is defined as the number of hops from an origin streaming server (OSS) to itself. When there are too many such peers, Pnew selects peers whose physical hop counts are as small as possible, where the physical hop count between two peers is defined as the number of ASs between them. In MPH, Pnew selects peers in the reverse order of MLH. These conventional peer selection algorithms use physical hop count under the assumption that complete AS topology information is available. However, it is hard to obtain the complete information. In this paper, we modify the conventional algorithms so that they use each peer's belonging AS information only instead of AS topology information in order to make them practical. In the modified version of MLH and MPH (MLH' and MPH'), P new selects the peers within the same AS as Pnew instead of peers whose physical hop counts are as small as possible. In addition, in order to distribute top level peers (i.e., peers that directly retrieve video from an OSS) to many ASs, MPH' gives higher priority to selecting peers except OSSs in ASs with OSSs. We evaluate the performance of the modified algorithms by simulation. Simulation results show that 1) MLH' and MPH' achieve almost the same maximum number of joining peers as MLH and MPH, respectively, 2) MLH' shows a maximum of 37{\%} larger inter-AS traffic volume than MLH, 3) MPH' shows larger traffic volume than MPH when the number of joining peers is small, while MPH' shows a maximum of 38{\%} smaller traffic volume than MPH when the number of joining peers is large thanks to the distribution of top level peers to many ASs.",
author = "Yukinobu Fukushima and Yin Tao and Kazuya Inada and Tokumi Yokohira",
year = "2010",
language = "English",
isbn = "9781424464135",
booktitle = "8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010",

}

TY - GEN

T1 - AS-friendly peer selection algorithms without AS topology information in P2P live streaming

AU - Fukushima, Yukinobu

AU - Tao, Yin

AU - Inada, Kazuya

AU - Yokohira, Tokumi

PY - 2010

Y1 - 2010

N2 - In recent years, peer-to-peer (P2P) live streaming systems are emerging because of their high scalability and robustness. In the systems, peer selection algorithms that determine logical topologies of P2P overlay networks have a great influence on important performance metrics such as the maximum number of joining peers and inter-AS (autonomous systems) traffic volume. As conventional algorithms that take account of those metrics, MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) have been proposed. In MLH, a newly joining peer (say Pnew) selects peers whose logical hop counts are as small as possible, where the logical hop count of a peer is defined as the number of hops from an origin streaming server (OSS) to itself. When there are too many such peers, Pnew selects peers whose physical hop counts are as small as possible, where the physical hop count between two peers is defined as the number of ASs between them. In MPH, Pnew selects peers in the reverse order of MLH. These conventional peer selection algorithms use physical hop count under the assumption that complete AS topology information is available. However, it is hard to obtain the complete information. In this paper, we modify the conventional algorithms so that they use each peer's belonging AS information only instead of AS topology information in order to make them practical. In the modified version of MLH and MPH (MLH' and MPH'), P new selects the peers within the same AS as Pnew instead of peers whose physical hop counts are as small as possible. In addition, in order to distribute top level peers (i.e., peers that directly retrieve video from an OSS) to many ASs, MPH' gives higher priority to selecting peers except OSSs in ASs with OSSs. We evaluate the performance of the modified algorithms by simulation. Simulation results show that 1) MLH' and MPH' achieve almost the same maximum number of joining peers as MLH and MPH, respectively, 2) MLH' shows a maximum of 37% larger inter-AS traffic volume than MLH, 3) MPH' shows larger traffic volume than MPH when the number of joining peers is small, while MPH' shows a maximum of 38% smaller traffic volume than MPH when the number of joining peers is large thanks to the distribution of top level peers to many ASs.

AB - In recent years, peer-to-peer (P2P) live streaming systems are emerging because of their high scalability and robustness. In the systems, peer selection algorithms that determine logical topologies of P2P overlay networks have a great influence on important performance metrics such as the maximum number of joining peers and inter-AS (autonomous systems) traffic volume. As conventional algorithms that take account of those metrics, MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) have been proposed. In MLH, a newly joining peer (say Pnew) selects peers whose logical hop counts are as small as possible, where the logical hop count of a peer is defined as the number of hops from an origin streaming server (OSS) to itself. When there are too many such peers, Pnew selects peers whose physical hop counts are as small as possible, where the physical hop count between two peers is defined as the number of ASs between them. In MPH, Pnew selects peers in the reverse order of MLH. These conventional peer selection algorithms use physical hop count under the assumption that complete AS topology information is available. However, it is hard to obtain the complete information. In this paper, we modify the conventional algorithms so that they use each peer's belonging AS information only instead of AS topology information in order to make them practical. In the modified version of MLH and MPH (MLH' and MPH'), P new selects the peers within the same AS as Pnew instead of peers whose physical hop counts are as small as possible. In addition, in order to distribute top level peers (i.e., peers that directly retrieve video from an OSS) to many ASs, MPH' gives higher priority to selecting peers except OSSs in ASs with OSSs. We evaluate the performance of the modified algorithms by simulation. Simulation results show that 1) MLH' and MPH' achieve almost the same maximum number of joining peers as MLH and MPH, respectively, 2) MLH' shows a maximum of 37% larger inter-AS traffic volume than MLH, 3) MPH' shows larger traffic volume than MPH when the number of joining peers is small, while MPH' shows a maximum of 38% smaller traffic volume than MPH when the number of joining peers is large thanks to the distribution of top level peers to many ASs.

UR - http://www.scopus.com/inward/record.url?scp=77956455058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956455058&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781424464135

BT - 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010

ER -