The Routing Algorithm Of P2P-based Social Networks Considering Balance Between Scalability And Sybil-proof

SN (Social Networks) have become popular because they make communicationeasier. Most of current SN are based on the client/server model, where servers,bandwidth and maintaining costs increase as the number of users increase. P2Ptechnology can reduce these costs. However in P2P network, there have some malicepeers forging identity to interrupt routing which is called Sybil attack. CurrentSybil-proof P2P networks need large routing information to support routing to avoidSybil-attack. However, a large size routing table constrains the scalability of thesystem.This research tries to find a P2P routing algorithm to fill the requirement of SNwhich have a good performance at Sybil-Proof and reasonable size of routing table.Reputation is used to get this purpose. Records of other peer’s reputation can helppeers route avoiding Sybil attack. So the routing table only needs to record few honestinformation instead of large uncertain routing information. That keeps routing table ina reasonable size.