應用雜湊函數在基於Chord協定的複本位置服務

Applying Hash Function to Replica Location Service Based on Chord Protocol

李俊緯(Chun-Wei Li)

指導教授 ： 李程輝

國立交通大學/電機學院/電信工程系所/碩士(2013年)

https://doi.org/10.6842/NCTU.2013.00450

摘要

在大型對等系統(Peer-to-peer system, P2P)裡，由於點的新增與失效和存取資料很頻繁，因此系統的負載平衡(Load Balance)與資料可靠性(Reliable)顯得很重要，在之前Chord協定針對決定資料放置的位置與有效且快速的搜尋資料做了很好的解決方案。
而在這篇論文裡，我們則是基於Chord協定使用雜湊函數結合複本技術，我們稱之為雜湊式複本位置服務，我們使用這個方法來使得系統有良好負載平衡且維持資料的可靠性，事實上，雜湊式複本位置函數不需改變Chord核心技術，只需增加維護函式，因此我們可以容易且很快的實現在Chord協定上面。
比較相關的複本技術，我們的雜湊式複本位置服務擁有更好的負載平衡與可靠性。

關鍵字

對等系統 ； 雜湊式複本位置服務 ； 負載平衡 ； 分布式系統 ； 搜尋資源服務

並列摘要

In large-scale peer-to-peer system, the load balance and data reliable is very important because node arrivals and departures frequently. In fact, Chord protocol is a powerful solution which is the efficient location of the node that stores a desired data item.
In this paper, we use replication technology with hashing based on Chord protocol, called Replica Location Service with Hashing. We use it to get the great load balance and data reliable in P2P system. In fact, the Replica Location Service with Hashing doesn’t change any primary protocol and just adds new maintain function in Chord. We can implement on Chord protocol easily and quickly.
Compared with related replication technology on Chord protocol, the proposed Replica Location Service with Hashing is more balanced and more reliable.

並列關鍵字

peer-to-peer systems ； Replica Location Service with Hashing ； load balance ； distributed systems ； resource discovery service

參考文獻

[2] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, ‘A Scalable Content-Addressable Network,’ Proc. ACM SIGCOMM, 2001.

[4] B.Y. Zhao et al., ‘Tapestry: A Resilient Global-Scale Overlay for Service Deployment,’ IEEE J. Selected Areas in Comm.,vol. 22, 2004.

[7] A. Chervenak, and M. Cai, “Applying Peer-to-Peer Techniques to Grid Replica Location Services,” Journal of Grid Computing, vol. 4, no. 1, pp. 49-69, 2006.

[1] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, ‘Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications’, IEEE/ACM Trans. Netw., 11 (2003), 17-32.

[3] A. Rowstron, and P. Druschel, ‘Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems’, In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 11 (2001), 329–350.