一個在對等網路架構底下使用上線時間為檔案分配基礎的儲存系統

Abstract

近年來，對等網路架構廣泛的應用在許多領域，例如檔案分享、網路電視和即時通訊等。在對等網路架構愈來愈受到重視的同時，本篇論文將探討如何在對等網路架構底下建構一個可靠的檔案儲存系統。 本篇論文在純對等，或稱之為全分散式的網路架構底下提出一個檔案分配的策略。這個策略會依據參與對等網路的節點其生命時間長度，來決定是否分配檔案。預期在這種分配方式底下，可以獲得較佳的檔案可得性。另一方面，也承襲了對等網路下的優勢，例如擴展性和負載平衡。實驗結果證明，採取這種策略的確可有效提高檔案的有效性。

In recent years, peer-to-peer technology has been widely applied to many areas, including file sharing, networked TV, and instant messaging. This thesis tried to build a storage system over this popular network architecture. This thesis proposed a file distribution strategy based on the nodes’ lifetimes. Some researches show that the longer a node stay online the more likely it still online in next hour. We take this observation as the basis of file distribution: putting the files over the nodes with longer life. We expect this strategy would bring a better file availability. This system is built over a pure P2P architecture, and we use Distributed Hash Table (DHT), a structured overlay network, to locate the data object efficiently. The experiment results show that the lifetime based distribution strategy performs well in file availability.