TY - GEN
T1 - Personal social graph as an anonymous vehicle for P2P applications
T2 - 44th Annual Conference on Information Sciences and Systems, CISS 2010
AU - Kokalj-Filipović, Silvija
AU - Le Fessant, Fabrice
N1 - Funding Information:
This work was supported by Taiwan’s Ministry of Science and Technology under Grant Numbers MOST101-2410-H-002-083-MY3 to S.-L.Y. and MOST103-2420-H-002-027-DR to Y.-H.Y.
PY - 2010
Y1 - 2010
N2 - We introduce a trusted self-organized network infrastructure for running anonymous P2P applications, which leverages real-life social links and the basic need for privacy that each individual converts into a carefully built structure dubbed Personal Social Graph (PSG). The PSG is a list owned by each person (enacted by a node in the infrastructure graph), with entries that represent strict trust relationships with other individuals. Each entry consists of a friend's identity and a set of encryption keys, established out-of-band for the purpose of secure communication between the owner and the friend. The real-life small-world connections result in a large network of interconnected PSGs, which we refer to as the Personal Social Graph Network (PSGN). The PSGN is meant to be universal, used as a trusted infrastructure by various distributed applications that encompass subsets of PSGN nodes. In this paper we consider only data-exchange applications relying on in-network caching. Since many applications share the trusted resources of this infrastructure, we introduce a cost per social network edge, incurred whenever the application rents the trusted edge for data exchange in the application context. We assume that the cost is zero when both vertices belong to the application. As edge utilization may be accounted for in a distributed way, the overconsumption could be ultimately sanctioned by the excommunication of the application from the PSGN. For dissemination strategies designed to evenly cache the data across peer nodes, we study the cost of the PSGN usage to a P2P application as a function of the application popularity and activity. We find that the dissemination that caches data as linear combinations of different source packets is costlier than simple packet replication in unit-size data-cache buffers, but manages to fully and evenly distributes the content among application nodes. In addition, adapting the dissemination infrastructure to each application by using a PSGN subgraph that encompasses the application nodes, and the nodes directly attached to them, we lower the price of renting. This is position paper that explores the social infrastructure as a shared resource.
AB - We introduce a trusted self-organized network infrastructure for running anonymous P2P applications, which leverages real-life social links and the basic need for privacy that each individual converts into a carefully built structure dubbed Personal Social Graph (PSG). The PSG is a list owned by each person (enacted by a node in the infrastructure graph), with entries that represent strict trust relationships with other individuals. Each entry consists of a friend's identity and a set of encryption keys, established out-of-band for the purpose of secure communication between the owner and the friend. The real-life small-world connections result in a large network of interconnected PSGs, which we refer to as the Personal Social Graph Network (PSGN). The PSGN is meant to be universal, used as a trusted infrastructure by various distributed applications that encompass subsets of PSGN nodes. In this paper we consider only data-exchange applications relying on in-network caching. Since many applications share the trusted resources of this infrastructure, we introduce a cost per social network edge, incurred whenever the application rents the trusted edge for data exchange in the application context. We assume that the cost is zero when both vertices belong to the application. As edge utilization may be accounted for in a distributed way, the overconsumption could be ultimately sanctioned by the excommunication of the application from the PSGN. For dissemination strategies designed to evenly cache the data across peer nodes, we study the cost of the PSGN usage to a P2P application as a function of the application popularity and activity. We find that the dissemination that caches data as linear combinations of different source packets is costlier than simple packet replication in unit-size data-cache buffers, but manages to fully and evenly distributes the content among application nodes. In addition, adapting the dissemination infrastructure to each application by using a PSGN subgraph that encompasses the application nodes, and the nodes directly attached to them, we lower the price of renting. This is position paper that explores the social infrastructure as a shared resource.
UR - http://www.scopus.com/inward/record.url?scp=77953714246&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953714246&partnerID=8YFLogxK
U2 - 10.1109/CISS.2010.5464904
DO - 10.1109/CISS.2010.5464904
M3 - Conference contribution
AN - SCOPUS:77953714246
SN - 9781424474172
T3 - 2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
BT - 2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
Y2 - 17 March 2010 through 19 March 2010
ER -