TY - GEN
T1 - A scheme to solve P2P ALTO problem
AU - Ye, Suqi
AU - Huang, Xinli
AU - Xiao, Rong
PY - 2010
Y1 - 2010
N2 - Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. But as the P2P systems has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay, which often leads to traffic management challenges for Internet Service Providers (ISPs) and poor QoS for users. To overcome these problems, we design a scheme, which clusters the P2P peers based on the topology information of the physical network they belong to, and employ caching mechanism then guides the users' behaviors globally, so the resources can be downloaded rapidly without taking wrong paths. Our event-based simulations show that with our algorithm, the time of downloading files in Bit Torrent (BT) is reduced compared to traditional BT. So that our algorithm can be used to the P2P file sharing systems which pay no attention to underlying network information to improve performance.
AB - Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. But as the P2P systems has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay, which often leads to traffic management challenges for Internet Service Providers (ISPs) and poor QoS for users. To overcome these problems, we design a scheme, which clusters the P2P peers based on the topology information of the physical network they belong to, and employ caching mechanism then guides the users' behaviors globally, so the resources can be downloaded rapidly without taking wrong paths. Our event-based simulations show that with our algorithm, the time of downloading files in Bit Torrent (BT) is reduced compared to traditional BT. So that our algorithm can be used to the P2P file sharing systems which pay no attention to underlying network information to improve performance.
KW - ALTO
KW - Optimization
KW - P2P
KW - Underlay
UR - https://www.scopus.com/pages/publications/77953185172
U2 - 10.1109/ETCS.2010.319
DO - 10.1109/ETCS.2010.319
M3 - 会议稿件
AN - SCOPUS:77953185172
SN - 9780769539874
T3 - 2nd International Workshop on Education Technology and Computer Science, ETCS 2010
SP - 459
EP - 462
BT - 2nd International Workshop on Education Technology and Computer Science, ETCS 2010
T2 - 2nd International Workshop on Education Technology and Computer Science, ETCS 2010
Y2 - 6 March 2010 through 7 March 2010
ER -