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.

[1]  David R. Karger,et al.  Looking up data in P2P systems , 2003, CACM.

[2]  Ram Dantu,et al.  A society-integrated testbed architecture for peer-to-peer telecommunications , 2009, 2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops.

[3]  Hector Garcia-Molina,et al.  SPROUT: P2P Routing with Social Networks , 2004, EDBT Workshops.

[4]  D. A. Kenny,et al.  Interpersonal Perception: A Social Relations Analysis , 1988 .

[5]  Pierre St. Juste,et al.  Integrating Overlay and Social Networks for Seamless P2P Networking , 2008, 2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises.

[6]  Ram Dantu,et al.  Achieving Peer-to-Peer Telecommunication Services through Social Hashing , 2009, 2009 6th IEEE Consumer Communications and Networking Conference.

[7]  Guillaume Pierre,et al.  A survey of DHT security techniques , 2011, CSUR.

[8]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[9]  Shaozhi Ye,et al.  Davis social links: integrating social networks with internet routing , 2007, LSAD '07.