(3.232.129.123) 您好!臺灣時間:2021/02/26 21:19
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:翁政豪
研究生(外文):Weng Cheng Hao
論文名稱:ORMAN:重疊式網路資源管理系統
論文名稱(外文):ORMAN : An Overlay network Resource MANagement System
指導教授:鍾添曜
指導教授(外文):Tein-Yaw Chung
學位類別:碩士
校院名稱:元智大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2005
畢業學年度:93
語文別:中文
論文頁數:50
中文關鍵詞:資源管理系統P2P網路重疊式網路資料整合
外文關鍵詞:Resource ManagementP2P NetworkOverlay NetworkData Aggregation
相關次數:
  • 被引用被引用:0
  • 點閱點閱:92
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
目前一些傳統的資源管理系統使用中央集權化的架構,這些資源管理系統會產生中央管理的節點負載過重的問題。因此一些新的研究提出了階層式管理架構,但節點大量的進入與離開,會讓資源管理系統的拓樸不穩定且無法運作。後來有學者提出在P2P網路上使用的資源管理系統,但是卻無法提供整合式資源查詢的功能。
本論文預期設計一套新架構的資源管理系統ORMAN(Overlay network Resource Management System)。ORAMN採用TLHBT(Three Levels Hierarchical-Based Topology)網路拓樸與多重SuperNode的方式來分散負載。且依據節點的資源(Resource)跟生存時間(Life Time)來調整拓樸的架構,提高整個拓樸的延伸性跟可調性。為了能達到負載平衡並提升查詢效率,ORAMN利用ULT(Update to Level Two)演算法實行資料整合的動作,再利用SLT(Search on Level Two)演算法來做查詢的功能。
本論文所提出的監控代理程式ORMAN Agent,是以模組化的方式來擷取被監控節點的系統資源資訊,監控模組可以隨時安插並監控新的屬性。
模擬結果顯示,本論文所提出之ULT與SLT演算法有較佳的搜尋效率,以及較低的節點資訊儲存變動率。
At the present day, current resource managements use centralized architecture. These have one problem that the centralized management node may become a bottleneck, so some solutions propose hierarchical-based architecture to decrease management load of the root. However, these resource management topologies are unstable and out of control because nodes up and down. Therefore, recent resource management uses decentralized topology that can work on P2P networks, but it can’t support complex resource searching functions.
This thesis presents new resource management architecture, ORMAN. In order to balance load, ORAMN uses TLHBT (Three Levels Hierarchical-Based Topology) architecture and multi supernodes. According to node resource and lifetime, ORMAN uses the information to adjust topology, and improves scalability and adaptability. For improving searching performance, ORAMN uses ULT (Update to Level Two) algorithm to aggregate resource information, and uses SLT (Search on Level Two) algorithm to search resource information.
This thesis proposes a monitor agent that uses module to probe system resource information. The monitor agent can dynamically insert new module to monitor new attribute.
The simulation result shows that ULT and SLT algorithm have better searching performance and low probability of node data changing.
1. 導論 9
1.1. 動機 10
1.2. 論文預期貢獻 10
1.3. 章節概要 11
2. 文獻探討 12
2.1. P2P探討 12
2.1.1. Chord 13
2.1.2. CAN 13
2.1.3. Pastry 14
2.1.4. Tapestry 15
2.1.5. CBT 16
2.2. 查詢資料整合 17
2.3. 資源管理系統 18
2.3.1. SNMP 19
2.3.2. Astrolabe 20
2.3.3. SDIMS 21
3. ORMAN系統架構與設計 23
3.1. 監控代理程式 24
3.2. 系統拓樸管理 26
3.2.1. 節點加入的方法 27
3.2.2. 節點離開的方法 27
3.2.3. 調整領導機器的方法 28
3.2.4. 節點錯誤處理 28
3.2.5. 設定備援節點的方法 28
3.3. 資料整合 29
3.3.1. 資料屬性 30
3.3.2. 資料整合策略 30
3.3.3. 資料整合範例 31
3.4. 資料查詢 32
3.4.1. 查詢範例 33
4. 模擬 35
4.1. 模擬環境與參數 35
4.2. 模擬結果 37
5. 結論與未來展望 46
6. 參考文獻 48
[1].RV. RENESSE, KP. BIRMAN, W. VOGELS,“Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining,”ACM Transactions on Computer Systems, Vol. 21, No. 2, pp 164–206, May 2003.
[2].OF. Rana, BJ. Daniel, DW. Walker,“Resource Discovery for Dynamic Clusters in Computational Grids,”IEEE Parallel and Distributed Processing Symposium, Proceedings 15th International, pp 759 - 767, 23-27 April 2001.
[3].K. Jun, L. B¨ol¨oni, K. Palacz,DC. Marinescu,“Agent-Based Resource Discovery,”IEEE Heterogeneous Computing Workshop, 2000. (HCW 2000) Proceedings. 9th , pp 43 – 52, 1 May 2000.
[4].P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, L. Zhang,“IDMaps: A Global Internet HostDistance Estimation Service”IEEE/ACM Transactions on Networking, Vol.9, pp 525 - 540, Oct. 2001.
[5].A. Goscinski, P. Jeffers, J. Silcock,“Data Collection for Global Scheduling in the GENESIS System”IEEE Parallel Architectures, Algorithms and Networks, I-SPAN '02. Proceedings. International Symposium on , pp 169 – 174, 22-24 May 2002.
[6].P. Yalagandula, M. Dahlin,“A Scalable Distributed Information Management System,”ACM SIGCOMM’04, Aug. 30–Sept. 3, 2004.
[7].J. Cao, DJ. Kerbyson, GR. Nudd,“Performance Evaluation of an Agent-Based Resource Management Infrastructure for Grid Computing,”IEEE/ACM International Symposium on , pp 311–318, 15-18 May 2001.
[8].H.A. Duran-Limon, G.S. Blair, G. Coulson,“Adaptive Resource Management in Middleware: A Survey,”IEEE Distributed Systems Online, Vol.5, Issue 7, pp 1-1, July 2004.
[9].RFC 1157 - Simple Network Management Protocol (SNMP)
[10].RFC 2271 - An Architecture for Describing SNMP Management Frameworks
[11].K. Kojima,“Grouped Peer-to-Peer networks and self-organization algorithm,” IEEE International Conference on Systems, Man and Cybernetics, 2003 , Vol.3 , pp 2970– 2976, 5-8 Oct. 2003.
[12].A. Tirumala, F. Qin, J. Dugan, J. Ferguson, K. Gibbs,“Iperf Version 1.7.0,” http://dast.nlanr.net/Projects/Iperf/
[13].W. Smith,“A system for monitoring and management of computational grids,”IEEE International Conference on Parallel Processing, 2002. Proceedings., pp 55-62, 18-21 Aug. 2002.
[14].B. Tierney, B. Crowley, D. Gunter, M. Holding, J. Lee, M. Thompson,“A monitoring sensor management system for grid environments,”IEEE International Symposium on High-Performance Distributed Computing, 2000. Proceedings. The Ninth , pp 97-104, 1-4 Aug. 2000.
[15].C. Junwei, DP. Spooner, JD. Turner, SA. Jarvis, DJ. Kerbyson, S. Saini, GR. Nudd, “Agent-based resource management for grid computing,” IEEE/ACM International Symposium on Cluster Computing and the Grid 2nd CCGRID2002 , pp 323–324, 21-24 May 2002.
[16].P. Gonzalez, MJ. Martin, JC. Mourino, R. Doallo,“Increasing the throughput of available resources using management tools based on Grid technologies,” International Parallel and Distributed Processing Symposium, 2003. Proceedings. pp 8, 22-26 April 2003.
[17].Z. Xu, R. Min, Y. Hu,“Reducing maintenance overhead in DHT based peer-to-peer algorithms,”International Conference on Peer-to-Peer Computing, 2003. (P2P 2003). Proceedings. The Third, pp 218–219, 1-3 Sept. 2003.
[18].Dowlatshahi M., MacLarty G., Fry M., “A scalable and efficient architecture for service discovery,”IEEE International Conference on Networks, 2003. ICON2003. The 11th , pp 51–56, 28 Sept.-1 Oct. 2003.
[19].M. Ripeanu,“Peer-to-Peer Architecture Case Study : Gnutalla Network,” Proceeding . on Peer-to-Peer Computing, pp 99-100, 2001.
[20].I. Stoica, R. Morris, D. Liben-Nowell, DR. Karger, MF. Kaashoek, F. Dabek, H. Balakrishnan,”Chord :a scalable peer-to-peer lookup protocol for Internet applications,”IEEE/ACM Transactions on Networking, pp 17-32, 2003.
[21].S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A scalable content-addressable network,”ACM SIGCOMM Proc., pp 161-172, 2001.
[22].A. Rowstron, P. Druschel, ”Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems,” Proc. 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware 2001), pp 329-350, 2001.
[23].B. Zhao, J. Kubiatowicz, A. Joseph, “Tapestry:An infrastructure for fault-tolerant wide-area location and routing,” in Comput. Sci. Div., Univ. California, Berkeley, Tech. Rep. UCB/CSD-01-1141, 2001.
[24].Napster, http://www.napster.com
[25].TY. Chung, CH. Tsai, MH. Wu, MY. Lai,“Architecture and Implementation of Cluster-based Peer-to-Peer Topology and Its Application in Search,”Journal of Internet Technology (JIT), 2005.
[26].B. Gedik, L. Liu,“PeerCQ: a decentralized and self-configuring peer-to-peer information monitoring system,” International Conference on Distributed Computing Systems, Proceedings. 23rd, pp 490–499, 19-22 May 2003.
[27].I. Foster, C. Kesselman., “Globus: A metacomputing infrastructure toolkit,”Int. Journal of Supercomputing Applications, 11(2), 1997.
[28].G. Kwon, KD. Ryu,“An efficient peer-to-peer file sharing exploiting hierarchy and asymmetry,”Proceedings. 2003 Symposium on Applications and the Internet, pp 226–233, 27-31 Jan. 2003.
[29].eDonkey, http://www.edonkey2000.com/
[30].KaZaA, http://www.kazaa.com/
[31].J. M.,Y. Lee,“The Multi-Ring Topology High Performance Group Communication in Peer-to-Peer Networks,” Peer-to-Peer Computing, 2002. (P2P 2002). Proceedings, pp 49-56, 2002.
[32].K. Shin, S. Lee, G. Lim, Y. H., JS. Ma, “Grapes: Topology-based Hierarchical Virtual Network for Peer-to-Peer Lookup Services,”Parallel Processing Workshops Proceedings, pp 159-164, 2002.
[33].鍾添曜, 林康司, “主動式網路之多媒體串流轉送服務,”Active Network Workshop 2004, Taiwan, Sept. 2004.
[34].P. C., YH. Chu, A. F., J. Gao, C. K., TS. E., P. S., E. T., H. Z.,“Darwin: Customizable Resource Management for Value-Added Network Services,”IEEE Network, pp 22-35, January/February 2001.
[35].SETI@home, http://setiweb.ssl.berkeley.edu/
[36].United Devices, http://www.ud.com/home.htm
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔