Efficient update propagation by speculating replica locations on peer-to-peer networks

Ai Hayakawa, Masato Asahara, Kenji Kono, Toshinori Kojima

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

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Pages422-431
Number of pages10
DOIs
Publication statusPublished - 2009
Event15th International Conference on Parallel and Distributed Systems, ICPADS '09 - Shenzhen, Guangdong, China
Duration: 2009 Dec 82009 Dec 11

Other

Other15th International Conference on Parallel and Distributed Systems, ICPADS '09
CountryChina
CityShenzhen, Guangdong
Period09/12/809/12/11

Fingerprint

Peer to peer networks
Electric power distribution
Servers
Cost effectiveness
Scalability

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Hayakawa, A., Asahara, M., Kono, K., & Kojima, T. (2009). Efficient update propagation by speculating replica locations on peer-to-peer networks. In Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS (pp. 422-431). [5395309] https://doi.org/10.1109/ICPADS.2009.98

Efficient update propagation by speculating replica locations on peer-to-peer networks. / Hayakawa, Ai; Asahara, Masato; Kono, Kenji; Kojima, Toshinori.

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. 2009. p. 422-431 5395309.

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

Hayakawa, A, Asahara, M, Kono, K & Kojima, T 2009, Efficient update propagation by speculating replica locations on peer-to-peer networks. in Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS., 5395309, pp. 422-431, 15th International Conference on Parallel and Distributed Systems, ICPADS '09, Shenzhen, Guangdong, China, 09/12/8. https://doi.org/10.1109/ICPADS.2009.98
Hayakawa A, Asahara M, Kono K, Kojima T. Efficient update propagation by speculating replica locations on peer-to-peer networks. In Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. 2009. p. 422-431. 5395309 https://doi.org/10.1109/ICPADS.2009.98
Hayakawa, Ai ; Asahara, Masato ; Kono, Kenji ; Kojima, Toshinori. / Efficient update propagation by speculating replica locations on peer-to-peer networks. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. 2009. pp. 422-431
@inproceedings{d128d299593a4c489951c3061990a7cc,
title = "Efficient update propagation by speculating replica locations on peer-to-peer networks",
abstract = "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.",
author = "Ai Hayakawa and Masato Asahara and Kenji Kono and Toshinori Kojima",
year = "2009",
doi = "10.1109/ICPADS.2009.98",
language = "English",
isbn = "9780769539003",
pages = "422--431",
booktitle = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

}

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

SP - 422

EP - 431

BT - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

ER -