Skip to Main Content
It generally utilized either peer-to-peer overlay network or server clusters to offer wide area network storage service. These network storage systems suffered from performance penalties or single-point failure. This paper proposed a network storage structure which combines regular graph with distributed hash table, and presented corresponding data accessing methods. The results of simulation demonstrated the improvement of the proposal in both accessing delay and searching hops compared to distributed hash table.