請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28930完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 劉邦鋒 | |
| dc.contributor.author | Chieh-Wen Cheng | en |
| dc.contributor.author | 鄭傑文 | zh_TW |
| dc.date.accessioned | 2021-06-13T00:30:08Z | - |
| dc.date.available | 2009-07-31 | |
| dc.date.copyright | 2007-07-31 | |
| dc.date.issued | 2007 | |
| dc.date.submitted | 2007-07-26 | |
| dc.identifier.citation | [1] GT Internetwork Topology Models (GT-ITM), 2000. http://wwwstatic.
cc.gatech.edu/projects/gtitm/. [2] A. Chervenak, R. Schuler, C. Kesselman, S. Koranda, and B. Moe. Wide area data replication for scientific collaborations. In In Proceedings of the 6th International Workshop on Grid Computing, November 2005. [3] Israel Cidon, Shay Kutten, and Ran Soffer. Optimal allocation of electronic content. In INFOCOM, pages 1773–1780, 2001. [4] W. B. David. Evaluation of an economy-based file replication strategy for a data grid. In International Workshop on Agent based Cluster and Grid Computing, pages 120–126, 2003. [5] W. B. David, D. G. Cameron, L. Capozza, A. P. Millar, K. Stocklinger, and F Zini. Simulation of dynamic grid rdeplication strategies in optorsim. In In Proceedings of 3rd Intl IEEE Workshop on Grid Computing, pages 46–57, 2002. [6] M.M. Deris, Abawajy J.H., and H.M. Suzuri. An efficient replicated data access approach for large-scale distributed systems. In IEEE International Symposium on Cluster Computing and the Grid, April 2004. [7] W. Hoschek, F. J. Janez, A. Samar, H. Stockinger, and K. Stockinger. Data management in an international data grid project. In In Proceedings of GRID Workshop, pages 77–90, 2000. [8] Won J. Jeon, Indranil Gupta, and Klara Nahrstedt. Qos-aware object replication in overlay networks. 2005. [9] Xiaohua Jia, Deying Li, Xiao-Dong Hu, and Ding-Zhu Du. Placement of read-write web proxies in the internet. In ICDCS, pages 687–690, 2001. [10] Konstantinos Kalpakis, Koustuv Dasgupta, and Ouri Wolfson. Optimal placement of replicas in trees with read, write, and storage costs. IEEE Trans. Parallel Distrib. Syst., 12(6):628–637, 2001. [11] Christof Krick, Harald Rぴacke, and Matthias Westermann. Approximation algorithms for data management in networks. In SPAA ’01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 237–246, New York, NY, USA, 2001. ACM Press. [12] H. Lamehamedi, B. Szymanski, Z. Shentu, and E. Deelman. Data replication strategies in grid environments. In In Proceedings of 5th International Conference on Algorithms and Architecture for Parallel Processing, pages 378–383, 2002. [13] K. Ranganathan, A. Iamnitchi, and I.T. Foste. Improving data availability through dynamic model-driven replication in large peer-to-peer communities. In In 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, pages 376–381, 2002. [14] K. Ranganathana and I. Foster. Identifying dynamic replication strategies for a high performance data grid. In In Proceedings of the International Grid Computing Workshop, pages 75–86, 2001. [15] H. Stockinger, A. Samar, B. Allcock, I. Foster, K. Holtman, and B. Tierney. File and object replication in data grids. In In 10th IEEE Symposium on High Performance and Distributed Computing, pages 305–314, 2001. [16] Xueyan Tang and Jianliang Xu. Qos-aware replica placement for content distribution. IEEE Trans. Parallel Distrib. Syst., 16(10):921–932, 2005. Member-Xueyan Tang and Member-Jianliang Xu. [17] Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, and Farokh B. Bastani. On the optimal placement of secure data objects over internet. In IPDPS ’05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05) - Papers, page 14, Washington, DC, USA, 2005. IEEE Computer Society. [18] Oren Unger and Israel Cidon. Optimal content location in multicast based overlay networks with content updates. World Wide Web, 7(3):315–336, 2004. [19] Bernard M. Waxman. Routing of multipoint connections. pages 347– 352, 1991. [20] Ouri Wolfson and Amir Milo. The multicast policy and its relationship to replicated data placement. ACM Trans. Database Syst., 16(1):181– 205, 1991. 33 | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28930 | - |
| dc.description.abstract | 在網路上有一份資料需要被很多人使用到，我們可以將這一份資料複製成好幾分複品，放在網路上不同的地方，供大家使用以增加存取的速度。但是網路上在溝通時會有延遲，所以我們需要一個好的放置策略，來降低這些延遲。這篇論文同時考慮了服務品質的保證以及整個系統的效能，我們提出兩個演算法來決定副本的放置策略，實驗結果顯示我們的方法找到的結果很接近最佳解。 | zh_TW |
| dc.description.abstract | This paper studies the QoS-aware replica placement problem in grid environments, given the workload capacity restriction of each replica server. Although there has been much work on replica placement problem, most of them concern average system performance and ignore quality assurance issue. However, we believe that quality assurance is very important, especially in heterogeneous environments. The capacity that each replica server can
process is also a key factor in service quality assurance. In this paper, we propose two heuristic algorithms that determine the positions of replicas in order to minimize the sum of update, storage and access cost and satisfy the quality requirements imposed by data requests and the capacity constraint of each replica server. The experimental results indicate that the proposed algorithms find a near-optimal solution effectively and efficiently. Our algorithms can also adapt to various parallel and distributed environments. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T00:30:08Z (GMT). No. of bitstreams: 1 ntu-96-R94922135-1.pdf: 310356 bytes, checksum: cce4a620da8bcbb0c898095040ffa377 (MD5) Previous issue date: 2007 | en |
| dc.description.tableofcontents | 1 Introduction 1
2 Related Works 4 3 System Model 7 3.1 Replication Cost . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2 Service Quality Requirement . . . . . . . . . . . . . . . . . . . 9 3.3 Workload Capacity Constraint . . . . . . . . . . . . . . . . . . 10 3.4 QoS-aware Replica Placement With Capacity Constraint . . . 10 4 Heuristic Algorithms 12 4.1 QoS Satisfying Set . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2 Greedy Remove . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2.1 Time Complexity Analysis . . . . . . . . . . . . . . . . 14 4.3 Greedy Add . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.3.1 Time Complexity Analysis . . . . . . . . . . . . . . . . 18 4.4 Random . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 5 Performance Evaluation 20 5.1 The effects of Workload . . . . . . . . . . . . . . . . . . . . . 22 5.2 The effects of Capacity Constraint . . . . . . . . . . . . . . . . 22 5.3 The effects of QoS . . . . . . . . . . . . . . . . . . . . . . . . 24 5.4 The effects of Storage Cost . . . . . . . . . . . . . . . . . . . . 26 5.5 Execution Time . . . . . . . . . . . . . . . . . . . . . . . . . . 26 6 Conclusion 30 | |
| dc.language.iso | en | |
| dc.subject | 效能 | zh_TW |
| dc.subject | 服務品質 | zh_TW |
| dc.subject | 演算法 | zh_TW |
| dc.subject | 複品 | zh_TW |
| dc.subject | 放置策略 | zh_TW |
| dc.subject | performance | en |
| dc.subject | QoS | en |
| dc.subject | heuristic | en |
| dc.subject | replica | en |
| dc.subject | placement | en |
| dc.title | 具有服務品質保證,高存取效能及高儲存效能適用於格網系統之資料複品放置方法 | zh_TW |
| dc.title | QoS-Aware, Access-Efficient and Storage-Efficient Replica Placement in Grid Environments | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 95-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 王大為,薛智文 | |
| dc.subject.keyword | 服務品質,演算法,複品,放置策略,效能, | zh_TW |
| dc.subject.keyword | QoS,heuristic,replica,placement,performance, | en |
| dc.relation.page | 33 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2007-07-26 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-96-1.pdf 未授權公開取用 | 303.08 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。