Efficiency of social connection-based routing in P2P VoIP networks

Authors:
Vikram Chandrasekaran;Ram Dantu;Neeraj K. Gupta;Xiaohui Yang;Duminda Wijesekera
Affiliations:
Department of Computer Science, University of North Texas, Denton, TX;Department of Computer Science, University of North Texas, Denton, TX;Department of Computer Science, University of North Texas, Denton, TX;Department of Computer Science, George Mason University, Fairfax, VA;Department of Computer Science, George Mason University, Fairfax, VA
Venue:
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Year:
2010

Citing 7
Cited 0

Looking up data in P2P systems

Communications of the ACM
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Davis social links: integrating social networks with internet routing

Proceedings of the 2007 workshop on Large scale attack defense
Integrating Overlay and Social Networks for Seamless P2P Networking

WETICE '08 Proceedings of the 2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Achieving peer-to-peer telecommunication services through social hashing

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A survey of DHT security techniques

ACM Computing Surveys (CSUR)
SPROUT: P2P routing with social networks

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.