Making Societies in Peer-to-Peer (P2P) Overlay Networks

A peer-to-peer (P2P) overlay network is composed of peer processes. Various kinds of group-based applications like social network service (SNS) are developed and widely used in P2P overlay networks. Here, societies of peers are dynamically and autonomously organized to achieve some objectives in the centralized coordination. In this paper, we discuss a how multiple peers organize societies in the distributed coordination. Each peer is assumed to manage its local own objects in the role-based access control (RBAC) model in this paper. A role is a collection of access rights, i.e. permissions. A peer defines roles on its own objects and grants and revokes a role to and from another peer. Only a peer granted a role is allowed to make an access to the objects in access rights of the role. In this paper, we discuss how to securely share objects with multiple peers in a society. A society is defined to share local objects. A society is a collection of society objects and society roles to manipulate the society objects without being conscious of which local peer holds the objects and whether or not the peer is granted access rights. In a society, each member peer plays one or more than one society role. On joining a society, a peer first negotiates with the society an agreement on which roles the peer can support to the society and which society role the peer is granted. In this paper, we discuss how peers do the negotiation with each other to grant and revoke roles in a society.

[1]  Seungyeop Han,et al.  Analysis of topological characteristics of huge online social networking services , 2007, WWW '07.

[2]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[3]  Alessandro Acquisti,et al.  Information revelation and privacy in online social networks , 2005, WPES '05.

[4]  Hanan Samet,et al.  An efficient nearest neighbor algorithm for P2P settings , 2005, DG.O.

[5]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[6]  Tomoya Enokido,et al.  Ranking factors in peer-to-peer overlay networks , 2007, TAAS.

[7]  Tomoya Enokido,et al.  Satisfiability and trustworthiness of peers in peer-to-peer overlay networks , 2006, First International Conference on Availability, Reliability and Security (ARES'06).

[8]  David Alan Hanson,et al.  Data security , 1979, ACM-SE 17.

[9]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[10]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[11]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[12]  Ravi S. Sandhu,et al.  Role-Based Access Control Models , 1996, Computer.

[13]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[14]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[15]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[16]  Tomoya Enokido,et al.  A Distributed Coordination Algorithm for a Heterogeneous Group of Peers , 2007, First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07).

[17]  Tomoya Enokido,et al.  A Distributed Coordination Protocol for a Heterogeneous Group of Peer Processes , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[18]  Tomoya Enokido,et al.  Role-based Concurrency Control in a Subject- and Purpose-Oriented (SPO) View , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).