考量QoS限制之複本放置近似演算法

A QoS-aware Heuristic Algorithm for Replica Placement

王相凱(Hsiang-Kai Wang)

指導教授 ： 劉邦鋒

國立臺灣大學/電機資訊學院/資訊工程學研究所/碩士(2006年)

https://doi.org/10.6342/NTU.2006.03119

摘要

此篇論文討論在考量QoS限制的情況下，擺放檔案複本達到系統最佳化的問題。雖然已經有許多關於複本放置的研究工作，但是其中大部分的研究都是考量系統的整體效能，而忽略掉個別伺服器的差異，所以可能會導致部分使用者的不便。而在異質的網路環境，這種差異性更加明顯，這個問題也越顯重要。我們提出一個新的近似演算法來解決這個問題，經由實驗，我們證實了我們提出的演算法的確是一個有效率的演算法，並且能夠得到一個與最佳解近似的放置方法。

關鍵字

品質 ； 複本

並列摘要

This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality assurance is very important, especially in heterogeneous environments. We propose a new heuristic algorithm that determines the positions of replicas in order to satisfy the quality requirements imposed by data requests. The experimental results indicate that the proposed algorithm finds a near-optimal solution effectively and efficiently. Our algorithm can also adapt to various parallel and distributed
environments.

並列關鍵字

QoS ； replication ； replica

參考文獻

[2] A. Chervenak, R. Schuler, C. Kesselman, S. Koranda, and B. Moe. Wide area data replication

[3] Israel Cidon, Shay Kutten, and Ran So er. Optimal allocation of electronic content. In

INFOCOM, pages 1773{1780, 2001.

[4] W. B. David. Evaluation of an economy-based le replication strategy for a data grid.

In International Workshop on Agent based Cluster and Grid Computing, pages 120{126,