P2P Networks Considering Sybil-Proof with the Reputation of Social Link
| Autor: | Carlos Madrazo, Keiichi Koyanag, Zong Yuan Guo |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Routing protocol
Dynamic Source Routing Equal-cost multi-path routing Computer science media_common.quotation_subject Routing table Wireless Routing Protocol Geographic routing Computer security computer.software_genre Routing Information Protocol Sybil attack Destination-Sequenced Distance Vector routing Hierarchical routing media_common Triangular routing Static routing business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Path vector protocol DSRFLOW General Medicine Routing domain Link-state routing protocol Multipath routing business computer Computer network Reputation |
| Zdroj: | Applied Mechanics and Materials. :1596-1600 |
| ISSN: | 1662-7482 |
| Popis: | In P2P networks, malice peers forge identity to interrupt routing, called Sybil attack. To avoid it, methods in related works consider routing as random walk. Since the destination of random walk is hard to predict, Sybil-proof P2P networks need large routing information to support routing. However, a large size routing table constrains the scalability of the system. Therefore, we aim to develop a routing algorithm to satisfy the requirement of P2P networks which has a good performance at Sybil-Proof by using a reasonable size of routing table. Social links are useful to prevent a Sybil attack because friend peers have little chance to be a Sybil peer. In this proposed method, reputation of social link is useful for achieving this objective. Considering the distance to destination peers can help for routing efficiency and considering the reputation can make routing to have better performance resisting Sybil-attacks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|