Font Size: a A A

Study On The Distributed Routing Algorithm And Its Security For Peer-to-Peer Computing

Posted on:2005-11-24Degree:DoctorType:Dissertation
Country:ChinaCandidate:S J ZhouFull Text:PDF
GTID:1118360125463957Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
By virtue of its great efficiency and graceful architecture, the Client/Server model has been prevalent for more than twenty years, but some disadvantages are also recognized. It is not so suitable for the Next Generation Internet (NGI), which will provide a high-speed communication platform. Especially, the service bottleneck of Client/Server model will become more and more severe in such high-speed networking environment. Some approaches have been proposed to solve such kind of disadvantages. Among these, distributed computing is considered an important candidate for Client/Server model. As one of special distributed computing, the Peer-to-Peer (P2P) computing employs the features of distributed computing to achieve resource sharing directly among peers. The feature of free of central controlling and management makes it suitable for building application in NGI. P2P also has some similarities with Grid computing. Regarded as a novel application model, P2P is a valuable technology for the wired Internet, wireless network and ad hoc networks. Therefore, the researches on P2P and its application are becoming a new highlight in not only distributed computing field, but also the whole information field.While shifting from central Client/Server to fully distributed P2P, the routing algorithm plays an important role. It does figure out the method to build a connected P2P network and open a communication link for each peer. However, lacking centralized server makes the routing in P2P have many differences from the IP routing in TCP/IP network. The waste of networking resources and the inconvenience of "anarchism" in the flooding routing of the first generation P2P make it only suitable for small-scale application. Likewise, the rigorous architecture and no consideration about specific requirement of application of the Distributed Hash Table (DHT) routing drop the shadow on the second generation P2P, which relies on the DHT. Because of no considerations about the importance of security, the second generation P2P is also limited to particular application area. Hence, researching on the distributed routing algorithm in the next generation P2P is an open question in IT. On the background of P2P, the routing mechanism and its related secure issues are explored in this paper. The primary researching works include: Proposing a Community Sensitive Distributed Routing algorithm (CSDR). The method is simple,fully distributed, applicable, and provable correctness. The CSDR algorithm consists of peer adding, peer deleting, community initializing and information updating. The connectness of CSDR network is also proved. The application case studying shows this routing mechanism is helpful to build an interconnected P2P network.Proposing a new bidding-electing algorithm. A novel bidding-electing function, exponential module based bidding electing function, is proposed. The fairness, correctness and probability of success are argued. A multi-winner bidding-electing algorithm suitable for CSDR is also designed. This electing algorithm is based on ring topology and can be used to elect more than one winner. The details about how this algorithm can be used in CSDR to elect community eyes (CE) are also presented.Proposing a one-way accumulator based peer authentication solution. By analyzing the foundation of one-way accumulator, it shows that this technique is usable to the peer authentication in CSDR. Two accumulators are designed and analyzed. Then, three peer authentication protocols are also presented. The conclusions show the accumulator based scheme can reduce the secure incidents in CSDR based P2P network, especially in its routing process.Proposing some new P2P application models. By integrating the requirement of security with the "floating" feature of P2P network, a structured secure P2P model is presented. Based on this model, the new architecture of P2P is also addressed. Then, three novel application models are brought forward too. The PKey, P2P based distributed key management system, is a substitute for di...
Keywords/Search Tags:Peer-to-Peer Computing, P2P Distributed Computing, Information Security, Distributed Routing Algorithm, Bidding-Electing Algorithm, One-Way Accumulator
PDF Full Text Request
Related items