臺灣博碩士論文加值系統

電腦資訊的普遍以及網路的快速發展造成了個人、企業的資訊化應用，現今日新月異的快速發展之中，不論是企業、學術、醫療、天文、生物等，所需要的運算能力和儲存空間越來越高，電腦硬體設備雖然不斷往上提升，但為了追求效能更佳的處理速度、更大的硬碟空間，所需要的花費也相對的越來越高。利用網路高速的功能加上各地閒置的電腦資源組合起來構成一個環境，這個環境將可以提供不輸超級電腦的高速運算、以及儲存空間，如此一來，使用者無需顧慮地點，就可從這環境中取得資源，包括處理能力、儲存系統、數據及軟體。這就是網格環境。
網格環境中，掌握住最適當的複本就等於掌握了較快的速度。因此，要如何能在世界各地的網路複本當中，找尋到最適合、最快速的複本來幫助我們用較快的速度存放數據、檔案、資料，這是很重要的問題。
在這個研究當中，我們提出比例配置的方法，網路頻寬速度與歷史訊息都是影響結果的關鍵，藉由這兩個值設計出適合的比例配置，進而達到理想的完成時間。本研究使用的是網格環境模擬器：OptorSim[4]。OptorSim提供了一個模擬的網格環境，在OptorSim中，我們可以研究不同的網路位置的配置，使用不同的複製演算法，分別比較出優缺點，分辨出合適的複製位置，提高資料傳遞的速度和效率。

Among the rapid development of today, we require computing and storage resources increasingly. Although computer hardware and peripheral will upward and improve, but in order to seek better performance, processing speed, and more storage space. We need also to cost more expense than before. Use high-network and to let something lie idle of everywhere''s computers resources at the world to combine that to an environment. The environment will provide high performance computing capacity, and storage resources. Users can access resources in this environment, not need to worry about location that resources include computing, storage system, data, and software. This is data grid environment.
In this thesis, we design a method of Proportional Allocation. Bandwidth and history are the key factor in the result of experiment. With these two values for proportional allocation of design configuration, and achieve the ideal of completion time. we use data grid simulator "OptorSim" in this thesis. OptorSim provides a simulated grid environment, We can study the configuration of different network location in OptorSim. We use different replication algorithms, and compare the respective advantages and disadvantages of algorithms. OptorSim can identify a suitable location to replicas, and improve the speed and efficiency of the transmission of information.

摘要 I
ABSTRACT III
誌謝 V
目錄 VII
圖目錄 IX
第一章、緒論 1
1.1 研究背景 1
1.2 研究動機與目的 1
1.3 研究方法 2
1.4 論文架構 4
第二章、相關文獻探討 5
2.1 資料網格 5
2.2 儲存資源仲介(SRB) 9
2.3 檔案複製 15
2.4 複本選擇 15
2.4.1 分配傳輸位置 16
2.5 複本取代 18
第三章、實驗環境及實驗方法 20
3.1 實驗環境 20
3.2 實驗方法 23
第四章、實驗步驟與結果分析 24
4.1 實驗步驟(一) 24
4.2 實驗步驟(二) 27
4.3 兩個群體之實驗方法 32
4.4三個群體之實驗討論 37
4.5 結論 43
第五章、結論與未來展望 44
5.1 結論 44
5.2 未來展望 45
參考文獻 50
附錄A：三群比例分配表 53
附錄B：兩群模組程式碼 54
附錄C：OPTORSIM內部參數設定 56

[1]林誠謙，全球網格(World Wide Grid)發展趨勢，中央研究院計算中心，pp.73-77
[2]Grid Café 中文版，http://www2.twgrid.org/gridcafe/index.htm.
[3]SDSC SRB, http://www.sdsc.edu/srb.
[4]OptorSim, http://edg-wp2.web.cern.ch/edg-wp2/optimization/optorsim.html.
[5]J.H. Abawajy, “Placement of File Replicas in Data Grid Environments”, in Proceedings of ICCS’2004 International Conference on Computational Science, LNCS 3038, Springer, pp.66-73, 2004.
[6]C. Baru, Moore R, A. Rajasekar, M. Wan, “The SDSC Storage Resource Broker”, in Proceedings of CASCON''98 Conference, Canada, 1998.
[7]W.H. Bell, D.G. Cameron, L. Capozza, A.P. Millar, K. Stockinger, F. Zini,” Simulation of Dynamic Grid Replication Strategies in OptorSim,” M. Parashar (Ed.): GRID 2002, LNCS 2536, pp. 46–57, 2002.
[8]D. G. Cameron, R. C. Schiaffino, P. Millar, C. Nicholson, K. Stockinger, and F. Zini, “Evaluating Scheduling and Replica Optimization Strategies in OptorSim”, in Proceeding of the 4rd International Workshop on Grid Computing (Grid2003), Phoenix, USA, November 2002.
[9]C.H., Chen, C.T., Yang, C.L., Lai,”Towards an Efficient Replica Selection for Data Grid”, In Proceedings of the First Workshop on Grid Technologies and Applications (WoGTA’04) pp. 89–94, 2004.
[10]A. Chervenak, I. Foster, C. Kesselman, C. Salisbury, S. Tuecke, “The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets”, in Proceedings of Journal of Network and Computer Applications, vol. 23, no. 3, pp. 187-200, 2000.
[11]I. Foster and C. Kesselman (Eds.), “The Grid: Blueprint for a New Computing Infrastructure”, Morgan Kaufmann, USA, 1999.
[12]I. Foster, C. Kesselman, S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations”, in Proceedings of the International Journal of High Performance Computing Applications, vol. 15, no. 3, 2001.
[13]H. Lamehamedi, B. Szymanski, Z. Shentu, and E. Deelman, “Data Replication Strategies in Grid Environments”, Proceedings of ICA3PP''02 The 5th International Conference on Algorithms and Architecture for Parallel Processing, IEEE CS Press, China, pp. 378-383, 2002.
[14]P.F. Liu, and J.J. Wu, “Optimal Replica Placement Strategy for Hierarchical Data Grid Systems”, in Proceedings of CCGrid’2006, The 6th ACM/IEEE International Symposium on Cluster Computing and the Grid, IEEE CS Press, Singapore, pp. 417-420, 2006.
[15]A. Rajasekar, M. Wan, R. Moore, G. Kremenek, T. Guptil, “Data Grids, Collections, and Grid Bricks”, in Proceedings of the 20th IEEE Symposium on Mass Storage Systems and the 11th Goddard Conference on Mass Storage Systems and Technologies, San Diego, 2003.
[16]A. Rajasekar, M. Wan and R. Moore, “MySRB & SRB - Components of a Data Grid”, in Proceedings of the 11th International Symposium on High Performance Distributed Computing, Scotland, 2002.
[17]M. Sun, J. Sun, E. Lu, C. Yu,” Ant Algorithm for File Replica Selection in Data Grid,” Proceedings of the First International Conference on Semantics, Knowledge, and Grid, SKG 2005.
[18]P.C. Shih, H.M. Chen, Y.C. Chung, C.M. Wang, R.S. Chang, C.H. Hsu, K.C. Huang, C.T. Yang, “Middleware of Taiwan UniGrid”, SAC’08, March 16-20, 2008.
[19]S. Takizawa, Y. Takamiya, H. Nakada, S. Matsuoka, “A Scalable Multi-Replication Framework for Data Grid”, in Proceedings of SAINT Workshops, pp. 310-315, 2005.
[20]S. Vazhkudai, “Enabling the Co-Allocation of Grid Data Transfers,” Proceedings of Fourth International Workshop on Grid Computing, pp. 44–51, 2003.
[21]S. Vazhkudai, S. Tuecke, and I. Foster, “Replica Selection in the Globus Data Grid”, in Proceedings of CCGRID’2001, The First IEEE/ACM International Conference on Cluster Computing and the Grid, IEEE CS Press, Australia, pp. 106-113, 2001.
[22]C.M., Wang, C.C., Hsu, H.M., Chen, J.J, Wu,”Efficient Multi-Source Data Transfer in Data Grids,” Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID’06) pp. 421–424, 2006.
[23]T.Y. Wu, K.C. Li, H.H. Wang, C.H. Hsu, K.Y. Cheng, W.S. Su, M.H. Lee,” Towards Design of a File Location Selection System in Grid Environments,” 2006 International Conference on Hybrid Information Technology, ICHIT''06.
[24]Chao-Tung Yang, Yao-Chun Chi, Tsu-Fen Han, and Ching-Hsien Hsu, "Redundant Parallel File Transfer with Anticipative Recursively-Adjusting Scheme in Data Grids", in ICA3PP 2007, LNCS 4494, pp. 242–253, 2007.