TY - GEN
T1 - Efficient update propagation by speculating replica locations on peer-to-peer networks
AU - Hayakawa, Ai
AU - Asahara, Masato
AU - Kono, Kenji
AU - Kojima, Toshinori
PY - 2009
Y1 - 2009
N2 - As demand for high fidelity multimedia content has soared, content distribution has emerged as a critical application. Large multimedia files require effective content distribution services such as content distribution networks (CDNs). A recent trend in CDN development is the use of peer-to-peer (P2P) techniques to enhance scalability, fault resilience, and cost-effectiveness. Unfortunately, P2P-based content distribution poses a crucial problem in that update propagation is quite difficult to accomplish. This is because peers cannot obtain a global view of replica locations on the network. In this paper, we propose speculative update, which quickly propagates an update to all replicas in a pure P2P fashion. Each server attempts to determine the directions in which there will be replicas with high probability based on server's local state used for replica repositioning. Then, it relays update messages speculatively in those directions. Simulation results demonstrate that our mechanism propagates an update to all replicas faster than the current pure P2P-based approaches.
AB - As demand for high fidelity multimedia content has soared, content distribution has emerged as a critical application. Large multimedia files require effective content distribution services such as content distribution networks (CDNs). A recent trend in CDN development is the use of peer-to-peer (P2P) techniques to enhance scalability, fault resilience, and cost-effectiveness. Unfortunately, P2P-based content distribution poses a crucial problem in that update propagation is quite difficult to accomplish. This is because peers cannot obtain a global view of replica locations on the network. In this paper, we propose speculative update, which quickly propagates an update to all replicas in a pure P2P fashion. Each server attempts to determine the directions in which there will be replicas with high probability based on server's local state used for replica repositioning. Then, it relays update messages speculatively in those directions. Simulation results demonstrate that our mechanism propagates an update to all replicas faster than the current pure P2P-based approaches.
UR - http://www.scopus.com/inward/record.url?scp=77949619138&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77949619138&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2009.98
DO - 10.1109/ICPADS.2009.98
M3 - Conference contribution
AN - SCOPUS:77949619138
SN - 9780769539003
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 422
EP - 431
BT - ICPADS '09 - 15th International Conference on Parallel and Distributed Systems
T2 - 15th International Conference on Parallel and Distributed Systems, ICPADS '09
Y2 - 8 December 2009 through 11 December 2009
ER -