高效率可延展的檔案搜尋協定

Abstract

在一個大型儲存系統的網路裡，設計一個能夠有效並且能夠快速搜尋檔案的資料結構是一件很重要的事情。以目前來說，樹狀結構跟雜湊是兩種比較通用的解決辦法。

在這個論文裡，我們呈現了一種新穎的分散式搜尋的協定來應付這個問題，我們命名為動態雜湊(Dynamic Hash)，這個動態雜湊使用一個刻度化的結構，用來提供如何將檔案定位到某個節點上，並且能夠支持著節點的加入以及刪除。另外，它能夠以移動節點的方式輕鬆的達成負載平衡，並且能夠動態的減少節點來降低他的電力消耗。

比較相關的雜湊作法，我們的動態雜湊在於熱點的問題能夠表現得更加有效率。

In distributed storage networks, it is important to design a scalable data structure for efficient data retrieval. Generally speaking, tree structures and hash tables are common ways to solve this kind of problems.

In this paper, we present a novel distributed lookup protocol, called Dynamic Hash, to address this problem. The proposed Dynamic Hash is a scalable structure which provides support for locating the data stored on a node and efficiently handles nodes joining and leaving the system. Besides, it can easily achieve load balancing by adding nodes and reduce power consumption by removing nodes dynamically.

Compared with related hash schemes, the proposed Dynamic Hash protocol is more scalable, relieves hot spots and requires very little overhead.