| Summary: | 碩士 === 國立臺灣科技大學 === 電子工程系 === 93 === In order to provide for peer-to-peer networks efficient lookup and more load balancing, Distributed Hash Table (DHT) and various topologies of overlay network have become the fundamental parts to build peer-to-peer network systems. With its multi-dimensional, regular and symmetric features, hypercube architecture can provide messages routing with routing hops in average and efficient fault-tolerant. By employing the hypercube architecture, this paper proposes a hypercube-based peer-to-peer network (HBN), which possesses the characteristics of decentralizing, self-organizing and fault-tolerance, scalability, load balance and efficient lookup. According to the concept of uniform partitioning proposed in CAN (Content-Addressable Network), HBN can achieve more load balance. In addition, every node would backup its data to its predecessor node and successor node in a Hamiltonian cycle found in HBN according to Gray code order, resulting in enhancing the performance of recovering massive failed nodes.
|
|---|
