A Strategy for Efficient Update Propagation on Peer-to-Peer Based Content Distribution Networks

• Item type: Trans(1)
• 公開日: 2010-09-17
• タイトル: A Strategy for Efficient Update Propagation on Peer-to-Peer Based Content Distribution Networks
• タイトル / 言語: en
• タイトル: A Strategy for Efficient Update Propagation on Peer-to-Peer Based Content Distribution Networks
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 分散コンピューティング
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Information and Computer Science, Keio University
• 著者所属: Department of Information and Computer Science, Keio University
• 著者所属: Department of Information and Computer Science, Keio University
• 著者所属: Department of Information and Computer Science, Keio University
• 著者所属(英): en
• 著者所属(英): Department of Information and Computer Science, Keio University
• 著者所属(英): en
• 著者所属(英): Department of Information and Computer Science, Keio University
• 著者所属(英): en
• 著者所属(英): Department of Information and Computer Science, Keio University
• 著者所属(英): en
• 著者所属(英): Department of Information and Computer Science, Keio University
• 著者名: Ai, Hayakawa; Masato, Asahara; Kenji, Kono; Toshinori, Kojima
• 著者名(英): Ai, Hayakawa; Masato, Asahara; Kenji, Kono; Toshinori, Kojima
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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. P2P-based CDNs have several advantages over conventional non- P2P-based CDNs in 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. There are still several issues in conventional approaches to update propagation. They degrade the scalability, the fault resilience, and the cost-effectiveness of P2P-based content distribution, they also consume the network bandwidth, or take a long time. In this paper, we propose the speculative update, which quickly propagates an update to replicas with less bandwidth consumption in a pure P2P fashion. The speculative update enables a fast update propagation on structured P2P-based CDNs. Each server attempts to determine the directions in which there will be replicas with a high probability and speculatively relays update messages in those directions. Simulation results demonstrate that our mechanism quickly propagates an update to replicas with less bandwidth consumption. The The speculative update completes update propagation as fast as the simple gossip-based update propagation even with up to 69% fewer messages per second. Compared to the convergence-guaranteed random walk, the speculative update completes an update propagation faster by up to 92%.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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. P2P-based CDNs have several advantages over conventional non- P2P-based CDNs in 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. There are still several issues in conventional approaches to update propagation. They degrade the scalability, the fault resilience, and the cost-effectiveness of P2P-based content distribution, they also consume the network bandwidth, or take a long time. In this paper, we propose the speculative update, which quickly propagates an update to replicas with less bandwidth consumption in a pure P2P fashion. The speculative update enables a fast update propagation on structured P2P-based CDNs. Each server attempts to determine the directions in which there will be replicas with a high probability and speculatively relays update messages in those directions. Simulation results demonstrate that our mechanism quickly propagates an update to replicas with less bandwidth consumption. The The speculative update completes update propagation as fast as the simple gossip-based update propagation even with up to 69% fewer messages per second. Compared to the convergence-guaranteed random walk, the speculative update completes an update propagation faster by up to 92%.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11833852
• 書誌情報: 情報処理学会論文誌コンピューティングシステム（ACS）; 巻 3, 号 3, p. 138-152, 発行日 2010-09-17
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7829
• 出版者 / 言語: ja
• 出版者: 情報処理学会