Efficiency of social connection-based routing in P2P VoIP networks

We have proposed using Social Hashing as a means to provide trust relations and routing in Peer-to-Peer VoIP networks. Social hashing helps in using the social trust relationships to thwart spam and DoS attacks against peers. Social hashing also helps in routing in P2P systems by facilitating a node to find its peer node(s) that contains a required data item, referred to as the lookup problem. Distributed Hash Tables (DHTs) solve this problem by storing (key, value) pairs for data so that data items can be found by searing for a unique key for that data. These tables are stored in several nodes in a P2P network and the (key, value) pairs are updated periodically. In this paper we evaluate the efficiency of Distributed Hash Table (DHT) based social hashing over non social hashing in a series of experiments.