Digital social networks promise to activate the social participants and to support them in their interactivity patterns. Private relationships evolve to friendships, professional contacts define competence networks and political opinions emerge to revolutionary trends. Social networks often act as driving force to intensify the social and global relationships.
In future, using the „Peer-to-Peer Framework for Social Networks“ everybody may host easily and out-of-the-box his personal online social network, without operating costs and without security risks. The framework offers a large set of interactive apps, which can be are freely combinable and technically limitless in their applicability.
The operating costs for such a social network are a revolutionary: no expenses arise. Whether a network for 10 users or for a global network of Millions of users, one aspect is common: due to the peer-to-peer technology used, no expenses arise. Researchers led by Dr.-Ing. Kalman Graffi at the University of Paderborn combined in the framework the advantages of decentralized peer-to-peer applications, of an app market as well as the cloud principle.
The social network is maintained in a peer-to-peer fashion through the computational power of the users’ devices, expensive servers are not needed. Still the availability, retrievability and security of the users‘ data are guaranteed. Each user keeps total control on the access control rights of his data. Similar to the main property of the cloud, the network’s capabilities grow elastically with the number of users. Further plugins can be developed easily. An app market that is included allows to provide these plugins in order to extend the capabilities and applications in the social network on the fly.
Enormous application opportunities without operating costs are the main reason to use the „P2P Framework for Social Networks“ emphasize the researchers of the corresponding project group at the University of Paderborn. The software as a prototype is already in use. Contact us for more information.
IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...Kalman Graffi
The document describes research into secure distributed data structures for peer-to-peer social networks. It proposes using distributed lists to store social media content like guestbook entries or photos, partitioned into buckets stored on different nodes. Remote operations are introduced to allow efficient list manipulation with less network traffic than retrieving full buckets. Access control is implemented cryptographically by encrypting or signing list elements and buckets. Evaluation shows the approach reduces network traffic compared to naïve distributed list implementations.
Vitaliy Rapp and Kalman Graffi. Continuous Gossip-based Aggregation through Dynamic Information Aging. In IEEE ICCCN ’13: Proceedings of the International Conference on Computer Communications and Networks, 2013.
Abstract—Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate.
IEEE HPCS 2013 - Comparative Evaluation of Peer-to-Peer Systems Using Peerfac...Kalman Graffi
Matthias Feldotto and Kalman Graffi. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In IEEE HPCS’13: Proceedings of the International Conference on High Per- formance Computing and Simulation, 2013.
Peer-to-peer and mobile networks gained significant attention of both research community and industry. Applying the peer-to-peer paradigm in mobile networks lead to several problems regarding the bandwidth demand of peer-to-peer networks. Time-critical messages are delayed and delivered unacceptably slow. In addition to this, scarce bandwidth is wasted on messages of less priority. Therefore, the focus of this paper is on bandwidth management issues at the overlay layer and how they can be solved. We present HiPNOS.KOM, a priority based scheduling and active queue management system. It guarantees better QoS for higher prioritized messages in upper network layers of peer-to-peer systems. Evaluation using the peer-to-peer simulator PeerfactSim.KOM shows that HiPNOS.KOM brings significant improvement in Kademlia in comparison to FIFO and Drop-Tail, strategies that are used nowadays on each peer. User initiated lookups have in Kademlia 24% smaller operation duration when using HiPNOS.KOM.
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia CaseKalman Graffi
Lars Bremer and Kalman Graffi. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In IEEE ICC ’13: Proceedings of the International Conference on Communications, 2013.
Abstract—Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the per- formance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer- to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems.
Abstract—Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud.
IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...Kalman Graffi
The document describes research into secure distributed data structures for peer-to-peer social networks. It proposes using distributed lists to store social media content like guestbook entries or photos, partitioned into buckets stored on different nodes. Remote operations are introduced to allow efficient list manipulation with less network traffic than retrieving full buckets. Access control is implemented cryptographically by encrypting or signing list elements and buckets. Evaluation shows the approach reduces network traffic compared to naïve distributed list implementations.
Vitaliy Rapp and Kalman Graffi. Continuous Gossip-based Aggregation through Dynamic Information Aging. In IEEE ICCCN ’13: Proceedings of the International Conference on Computer Communications and Networks, 2013.
Abstract—Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate.
IEEE HPCS 2013 - Comparative Evaluation of Peer-to-Peer Systems Using Peerfac...Kalman Graffi
Matthias Feldotto and Kalman Graffi. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In IEEE HPCS’13: Proceedings of the International Conference on High Per- formance Computing and Simulation, 2013.
Peer-to-peer and mobile networks gained significant attention of both research community and industry. Applying the peer-to-peer paradigm in mobile networks lead to several problems regarding the bandwidth demand of peer-to-peer networks. Time-critical messages are delayed and delivered unacceptably slow. In addition to this, scarce bandwidth is wasted on messages of less priority. Therefore, the focus of this paper is on bandwidth management issues at the overlay layer and how they can be solved. We present HiPNOS.KOM, a priority based scheduling and active queue management system. It guarantees better QoS for higher prioritized messages in upper network layers of peer-to-peer systems. Evaluation using the peer-to-peer simulator PeerfactSim.KOM shows that HiPNOS.KOM brings significant improvement in Kademlia in comparison to FIFO and Drop-Tail, strategies that are used nowadays on each peer. User initiated lookups have in Kademlia 24% smaller operation duration when using HiPNOS.KOM.
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia CaseKalman Graffi
Lars Bremer and Kalman Graffi. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In IEEE ICC ’13: Proceedings of the International Conference on Communications, 2013.
Abstract—Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the per- formance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer- to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems.
Abstract—Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud.
Timo Klerx and Kalman Graffi. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In IEEE P2P ’13: Proceedings of the International Conference on Peer-to-Peer Computing, 2013.
Abstract—Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer- to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals.
A Batch-authenticated And Key AgreementFramework For P2p-based Online Social...Sahithi Naraparaju
The document proposes a security framework for authenticating multiple users simultaneously to improve efficiency and security in peer-to-peer online social networks. It identifies weaknesses in existing protocols such as only supporting one-to-one authentication and high communication costs. The proposed framework includes three batch authentication protocols using one-way hash functions, ElGamal proxy encryption, and certificates. The protocols aim to reduce communication costs, support one-to-many authentication, and allow trusted users to help authenticate others. Formal analysis shows the protocols are secure against attacks and implicit key authentication.
Security Aspects of Social Networks at Campus Party 2010Anchises Moraes
Presentation that discuss the general security aspects and threats to social networking users. A brief overview of Social Network history amd statistics is also provided. This presentation took place at Campus Party Brasil, on January 2010.
A social networking service is an online platform that allows people to build social networks by connecting with others who share interests. Popular social networks include Facebook, Twitter, LinkedIn, and Google+. While social networks provide benefits like low-cost connections and access to information, they also present privacy, data mining, misuse, and safety issues. The document demonstrates privacy settings on Facebook and provides references for further information.
Interop 2011 las vegas - session se31 - rothkeBen Rothke
Ben Rothke presented on social networks and security. He discussed the security risks of social networks like information leakage, social engineering attacks, and geotagging. However, he argued that social networks are not going away and blocking them is not effective. Instead, organizations should develop social media strategies, perform risk assessments, implement user awareness training, and establish governance policies to help secure the use of social networks.
My keynote at 1st International Workshop on Social Multimedia Computing (SMC), Melbourne, Australia, 9 July 2012.
see: http://www.icme2012.org or
http://smc2012.idm.pku.edu.cn/
This document discusses security and privacy issues related to social networks. It begins by defining social networks and providing examples. It then outlines common web vulnerabilities like phishing, spam, XSS attacks, and discusses how these risks are increased in social networks due to features like third-party apps, public profiles, and the amount of personal data shared. The document provides tips for securing accounts including using strong unique passwords, checking privacy settings, and being wary of emails or links asking for private information.
The document discusses various security threats that exist on social networks, including phishing attacks, vulnerabilities in third-party applications, weak password security, cross-site scripting attacks, clickjacking, insecure frameworks, SQL injections, and DDOS attacks. It provides examples of each type of attack, such as phishing links that install malware, apps that access too much user data if hacked, passwords being easily guessed, malicious JavaScript that can be installed through photo tags, and privacy settings being exploited to view other profiles. The document emphasizes that with over a billion users exchanging personal information, social networks face many potential threats but that Facebook focuses heavily on security to prevent hacks of its own system.
People tempt to transfer their natural needs feeling and behaviors from the off line communication to the online world. One of the most important human needs is desire for security. Emotional, physical, mental, national, social, cyber: security has various levels and meanings.
Our lecture about Security on Social networks was presented to Students of Faculty of Social Science at Charles University. It covers issues connected to the cybercrime, threats and mechanism of scams, as well as privacy and security settings on Social Networks
Utilizing Social Networks for User Model Priming: User AttitudesAdam Moore
The study found that while medical students frequently use social networks like Facebook and Twitter, they are generally unwilling to provide their social media identities and user profiles to researchers. When asked to provide social media IDs, only a small number (13 total) agreed. When asked for explanations, most participants cited privacy concerns as the primary reason for not sharing their IDs. The study suggests that more work needs to be done to help users understand the benefits of sharing social media data for research purposes and give them more transparency and control over how their information would be used.
Multiparty Access Control For Online Social Networks : Model and Mechanisms.Kiran K.V.S.
• Online social networks (OSNs) have experienced tremendous growth in recent years and become a de facto portal for hundreds of millions of Internet users.
• While OSNs allow users to restrict access to shared data, they currently do not provide any mechanism to enforce privacy concerns over data associated with multiple users.
• To this end, we propose an approach to enable the protection of shared data associated with multiple users in OSNs.
• We formulate an access control model to capture the essence of multiparty authorization requirements, along with a multiparty policy specification scheme and a policy enforcement mechanism.
Twitter in Disaster Mode: Security ArchitectureTheus Hossmann
The document proposes a security architecture called Twimight that allows for Twitter-like functionality during disasters when centralized connectivity is disrupted. Twimight uses opportunistic communication between devices using Bluetooth to spread tweets. It introduces the Twimight Disaster Server which acts as a certificate authority to sign keys and tweets to authenticate users and ensure integrity and confidentiality even when devices are disconnected. The server also helps manage revocation of keys if devices are lost or stolen.
Tencent QQ is a popular instant messaging client in China with over 700 million registered users. It provides basic IM functions like text, voice and video chat. In addition, QQ offers various value-added services including online games, virtual pets, avatars, music and video streaming, online shopping and payments to engage users. These services have helped QQ become the dominant IM platform in China and one of Tencent's major sources of revenue.
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Twitter provides a platform for user-generated content in the form of short messages called tweets. It handles a massive volume of data, with over 230 million tweets and 2 billion search queries per day. Twitter has developed a customized search and indexing system to handle this scale. It uses a modular system that is scalable, cost-effective, and allows for incremental development. The system includes components for crawling Twitter data, preprocessing and aggregating tweets, building an inverted index, and distributing the index across server machines for low-latency search.
Facebook uses a LAMP stack with additional services and customizations for its architecture. The LAMP stack includes PHP, MySQL, and Memcache. PHP is used for its web programming capabilities but has scaling issues. MySQL is used primarily as a key-value store and is optimized for recency of data. Memcache provides high-performance caching. Additional services are created using Thrift for tasks better suited to other languages. Services include News Feed, Search, and logging via Scribe. The architecture emphasizes scalability, simplicity, and optimizing for common use cases.
These is the slide deck I used during my talk at Software Architect about how using architecture in order to create maintainable, secure and fast mobile applications.
IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...Kalman Graffi
The phenomenon of online social networks reaches millions of users in the Internet nowadays. In these, users present themselves, their interests and their social links which they use to interact with other users. We present in this paper LifeSocial.KOM, a p2p-based platform for secure online social networks which provides the functionality of common online social networks in a totally distributed and secure manner. It is plugin-based, thus extendible in its functionality, providing secure communication and access-controlled storage as well as monitored quality of service, addressing the needs of both, users and system providers. The platform operates solely on the resources of the users, eliminating the concentration of crucial operational costs for one provider. In a testbed evaluation, we show the feasibility of the approach and point out the potential of the p2p paradigm in the field of online social networks.
IEEE ISM 2008: Kalman Graffi: A Distributed Platform for Multimedia CommunitiesKalman Graffi
Online community platforms and multimedia content delivery are merging in recent years. Current platforms like Facebook and YouTube are client-server based which result in high administration costs for the provider. In contrast to that peer-to-peer systems offer scalability and low costs, but are limited in their functionality. In this paper we present a framework for peer-to-peer based multimedia online communities.We identified the key challenges for this new application of the peer-to-peer paradigm and built a plugin based, easily extendible and multifunctional framework. Further, we identified distributed linked lists as valuable data structure to implement the user profiles, friend lists, groups, photo albums and more. Our framework aims at providing the functionality of common online community platforms combined with the multimedia delivery capabilities of modern peer-to-peer systems, e.g. direct multimedia delivery and access to a distributed multimedia pool.
Timo Klerx and Kalman Graffi. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In IEEE P2P ’13: Proceedings of the International Conference on Peer-to-Peer Computing, 2013.
Abstract—Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer- to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals.
A Batch-authenticated And Key AgreementFramework For P2p-based Online Social...Sahithi Naraparaju
The document proposes a security framework for authenticating multiple users simultaneously to improve efficiency and security in peer-to-peer online social networks. It identifies weaknesses in existing protocols such as only supporting one-to-one authentication and high communication costs. The proposed framework includes three batch authentication protocols using one-way hash functions, ElGamal proxy encryption, and certificates. The protocols aim to reduce communication costs, support one-to-many authentication, and allow trusted users to help authenticate others. Formal analysis shows the protocols are secure against attacks and implicit key authentication.
Security Aspects of Social Networks at Campus Party 2010Anchises Moraes
Presentation that discuss the general security aspects and threats to social networking users. A brief overview of Social Network history amd statistics is also provided. This presentation took place at Campus Party Brasil, on January 2010.
A social networking service is an online platform that allows people to build social networks by connecting with others who share interests. Popular social networks include Facebook, Twitter, LinkedIn, and Google+. While social networks provide benefits like low-cost connections and access to information, they also present privacy, data mining, misuse, and safety issues. The document demonstrates privacy settings on Facebook and provides references for further information.
Interop 2011 las vegas - session se31 - rothkeBen Rothke
Ben Rothke presented on social networks and security. He discussed the security risks of social networks like information leakage, social engineering attacks, and geotagging. However, he argued that social networks are not going away and blocking them is not effective. Instead, organizations should develop social media strategies, perform risk assessments, implement user awareness training, and establish governance policies to help secure the use of social networks.
My keynote at 1st International Workshop on Social Multimedia Computing (SMC), Melbourne, Australia, 9 July 2012.
see: http://www.icme2012.org or
http://smc2012.idm.pku.edu.cn/
This document discusses security and privacy issues related to social networks. It begins by defining social networks and providing examples. It then outlines common web vulnerabilities like phishing, spam, XSS attacks, and discusses how these risks are increased in social networks due to features like third-party apps, public profiles, and the amount of personal data shared. The document provides tips for securing accounts including using strong unique passwords, checking privacy settings, and being wary of emails or links asking for private information.
The document discusses various security threats that exist on social networks, including phishing attacks, vulnerabilities in third-party applications, weak password security, cross-site scripting attacks, clickjacking, insecure frameworks, SQL injections, and DDOS attacks. It provides examples of each type of attack, such as phishing links that install malware, apps that access too much user data if hacked, passwords being easily guessed, malicious JavaScript that can be installed through photo tags, and privacy settings being exploited to view other profiles. The document emphasizes that with over a billion users exchanging personal information, social networks face many potential threats but that Facebook focuses heavily on security to prevent hacks of its own system.
People tempt to transfer their natural needs feeling and behaviors from the off line communication to the online world. One of the most important human needs is desire for security. Emotional, physical, mental, national, social, cyber: security has various levels and meanings.
Our lecture about Security on Social networks was presented to Students of Faculty of Social Science at Charles University. It covers issues connected to the cybercrime, threats and mechanism of scams, as well as privacy and security settings on Social Networks
Utilizing Social Networks for User Model Priming: User AttitudesAdam Moore
The study found that while medical students frequently use social networks like Facebook and Twitter, they are generally unwilling to provide their social media identities and user profiles to researchers. When asked to provide social media IDs, only a small number (13 total) agreed. When asked for explanations, most participants cited privacy concerns as the primary reason for not sharing their IDs. The study suggests that more work needs to be done to help users understand the benefits of sharing social media data for research purposes and give them more transparency and control over how their information would be used.
Multiparty Access Control For Online Social Networks : Model and Mechanisms.Kiran K.V.S.
• Online social networks (OSNs) have experienced tremendous growth in recent years and become a de facto portal for hundreds of millions of Internet users.
• While OSNs allow users to restrict access to shared data, they currently do not provide any mechanism to enforce privacy concerns over data associated with multiple users.
• To this end, we propose an approach to enable the protection of shared data associated with multiple users in OSNs.
• We formulate an access control model to capture the essence of multiparty authorization requirements, along with a multiparty policy specification scheme and a policy enforcement mechanism.
Twitter in Disaster Mode: Security ArchitectureTheus Hossmann
The document proposes a security architecture called Twimight that allows for Twitter-like functionality during disasters when centralized connectivity is disrupted. Twimight uses opportunistic communication between devices using Bluetooth to spread tweets. It introduces the Twimight Disaster Server which acts as a certificate authority to sign keys and tweets to authenticate users and ensure integrity and confidentiality even when devices are disconnected. The server also helps manage revocation of keys if devices are lost or stolen.
Tencent QQ is a popular instant messaging client in China with over 700 million registered users. It provides basic IM functions like text, voice and video chat. In addition, QQ offers various value-added services including online games, virtual pets, avatars, music and video streaming, online shopping and payments to engage users. These services have helped QQ become the dominant IM platform in China and one of Tencent's major sources of revenue.
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Twitter provides a platform for user-generated content in the form of short messages called tweets. It handles a massive volume of data, with over 230 million tweets and 2 billion search queries per day. Twitter has developed a customized search and indexing system to handle this scale. It uses a modular system that is scalable, cost-effective, and allows for incremental development. The system includes components for crawling Twitter data, preprocessing and aggregating tweets, building an inverted index, and distributing the index across server machines for low-latency search.
Facebook uses a LAMP stack with additional services and customizations for its architecture. The LAMP stack includes PHP, MySQL, and Memcache. PHP is used for its web programming capabilities but has scaling issues. MySQL is used primarily as a key-value store and is optimized for recency of data. Memcache provides high-performance caching. Additional services are created using Thrift for tasks better suited to other languages. Services include News Feed, Search, and logging via Scribe. The architecture emphasizes scalability, simplicity, and optimizing for common use cases.
These is the slide deck I used during my talk at Software Architect about how using architecture in order to create maintainable, secure and fast mobile applications.
IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...Kalman Graffi
The phenomenon of online social networks reaches millions of users in the Internet nowadays. In these, users present themselves, their interests and their social links which they use to interact with other users. We present in this paper LifeSocial.KOM, a p2p-based platform for secure online social networks which provides the functionality of common online social networks in a totally distributed and secure manner. It is plugin-based, thus extendible in its functionality, providing secure communication and access-controlled storage as well as monitored quality of service, addressing the needs of both, users and system providers. The platform operates solely on the resources of the users, eliminating the concentration of crucial operational costs for one provider. In a testbed evaluation, we show the feasibility of the approach and point out the potential of the p2p paradigm in the field of online social networks.
IEEE ISM 2008: Kalman Graffi: A Distributed Platform for Multimedia CommunitiesKalman Graffi
Online community platforms and multimedia content delivery are merging in recent years. Current platforms like Facebook and YouTube are client-server based which result in high administration costs for the provider. In contrast to that peer-to-peer systems offer scalability and low costs, but are limited in their functionality. In this paper we present a framework for peer-to-peer based multimedia online communities.We identified the key challenges for this new application of the peer-to-peer paradigm and built a plugin based, easily extendible and multifunctional framework. Further, we identified distributed linked lists as valuable data structure to implement the user profiles, friend lists, groups, photo albums and more. Our framework aims at providing the functionality of common online community platforms combined with the multimedia delivery capabilities of modern peer-to-peer systems, e.g. direct multimedia delivery and access to a distributed multimedia pool.
LifeSocial - A P2P-Platform for Secure Online Social NetworksKalman Graffi
LifeSocial is a peer-to-peer platform for online social networks that aims to address issues with centralized social networks like high costs and limited scalability. It uses a distributed architecture that stores data across user devices instead of centralized servers to reduce costs. The platform provides rich functionality through an extensible plugin architecture and ensures security, reliability and quality of service through its monitoring and management capabilities. The goal is to satisfy both users and providers by offering a flexible yet controlled social networking environment at lower operational costs compared to centralized solutions.
Peer-to-peer Systems – Introduction – Napster and its legacy – Peer-to-peer – Middleware – Routing overlays. Overlay case studies: Pastry, Tapestry- Distributed File Systems –Introduction – File service architecture – Andrew File system. File System: Features-File model -File accessing models – File sharing semantics Naming: Identifiers, Addresses, Name Resolution – Name Space Implementation – Name Caches – LDAP.
Everyday life with Cloud Foundry in a big organization (Cloud Foundry Days To...CAFxX
Rakuten has been running the open-source version of Cloud Foundry internally for over 5 years. In this talk we will discuss our experience on three important topics: how we integrated Cloud Foundry with our internal systems, what are the most common issues users face when migrating their apps to Cloud Foundry and how to work with your users to make them advocates for the platform.
This document summarizes a thesis on developing a distributed architecture for web browsing troubleshooting. The architecture integrates network measurement and analysis techniques through real-time data sharing across peers. It applies a dynamic distributed K-means clustering algorithm to partition browsing data from different locations into clusters representing performance issues. Experiments using the architecture identified local and non-local network problems affecting different peers. Future work could include testing with more peers, optimizing resource usage, and developing a user-friendly interface.
The document summarizes the speaker's fellowship in Manchester e-Science and various projects they have worked on. It discusses tools developed like Biocatalogue and SearchByData for finding biological web services, as well as GeneSilico web services. It also covers the speaker's work on FileQuirks and collaboration methodology used by MyGrid that could be adopted. The speaker seeks feedback on deploying services and sharing software development practices.
The document provides an overview of open source software, its history and uses in libraries. It discusses evaluating open source solutions and factors to consider such as community support, total cost of ownership, and technical requirements. Resources for finding and evaluating open source software are also listed.
In this presentation I provide a gentle introduction to successful open web protocols such as OpenID, OAuth, Atompub and OpenSocial in terms of what they provide as well as how they can be useful to developers. Presented at the inaugural MSCOSCON 2009 in Malaysia.
Note: This presentation draws from a lot of existing content online and I have attempted to ensure that the sources have copyright that allowed reuse as well as all sources have been duly attributed. If there is any attribution missing or misuse of content please do contact me and I will rectify it.
An Ad-hoc Smart Gateway Platform for the Web of Things (IEEE iThings 2013 Bes...Darren Carlson
The Web of Things (WoT) aims to extend the Web into the physical world by promoting the adoption of Web protocols by situated services and smart objects (ambient artifacts). However, real-world ambient artifacts often adopt proprietary and/or non-Web protocols, making them invisible to Web search engines and inaccessible to conventional Web agents. Smart Gateways have been proposed as a way to “Web-enable” proprietary ambient artifacts through intermediary proxy nodes; however, the requisite infrastructure is difficult to deploy at Web scale. To address such challenges, we are developing Ambient Dynamix (Dynamix): a plug-and-play context framework for mobile devices, which enables Web agents to interoperate with non-Web ambient artifacts – directly from the browser. In this paper, we describe how Dynamix can be used to transform the user’s device into an ad-hoc Smart Gateway in-situ, enabling Web applications (in the device’s browser) to seamlessly interact with non-Web ambient artifacts in the physical environment. We describe an operational prototype implementation, which enables Web apps to discover and control nearby UPnP and AirPlay media devices uniformly. We also present a performance evaluation that indicates the prototype imposes low processing and memory overhead, and is suitable for deployment on many commodity mobile devices.
Maintaining and Releasing Open Source SoftwareJoel Nothman
An introduction to software maintenance in the open source context, focusing on software and human quality controls, oriented towards . Presented in July 2019 by Joel Nothman for an internal cross-skilling session in the Sydney Informatics Hub, Core Research Facilities, The University of Sydney.
This document discusses network softwarization and the role of open source. It begins by defining network softwarization as the trend toward more programmable, software-defined networks achieved through SDN and NFV. It then discusses how open source has played a role in networking, particularly through projects that enable network softwarization like OpenDaylight, OpenStack, and OPNFV. The document concludes by discussing some experiences with open source networking projects at UNICAMP like RouteFlow, libfluid, and Mininet-WiFi, which aim to advance the state of SDN and network programmability through open collaboration.
This document discusses network softwarization and the role of open source. It begins by defining network softwarization as the trend toward more programmable, software-defined networks achieved through SDN and NFV. It then discusses how open source has played a role in networking, particularly through management plane and software appliance projects. Several ongoing open source SDN/NFV projects and standards organizations are presented. Experiences with open source projects like RouteFlow, softswitch13, and Mini-CCNx are summarized. The role of open source in accelerating standardization is also discussed.
This is a presentation for my final year project at the Unicaf university. it was a description more about a social networking site where users in a society get to communicate to each other online using their smartphones or laptops
stackconf 2021 | First hand experience: How Nextcloud stayed productive durin...NETWAYS
1. Nextcloud allows companies and individuals to stay productive during the COVID-19 pandemic by enabling fully remote work.
2. Nextcloud provides collaboration tools like file sharing, video conferencing, messaging and editing that allow distributed teams to work remotely.
3. The Nextcloud developer community consists of over 2,000 volunteers worldwide who contribute to the project through testing, translations, packaging, promotions, bug fixes and new features.
Peer to Peer Network with its Architecture, Types, and Examples!!DigitalThinkerHelp
Today, here we are going to cover all possible things about is peer to peer network with its architecture and types; involving with several examples of peer to peer network with ease.
The document discusses the OpenDaylight Project, an open source SDN platform. It provides an overview of OpenDaylight's goals of developing open source SDN code, increasing adoption among vendors and users, and building a thriving community. Key aspects covered include OpenDaylight's controller platform and north/south APIs, its growing community of contributors and committers, integration with OpenStack, potential uses for NFV, and resources for getting involved.
Adding P2P support to WengoPhone, an open-source VoIP and ...Videoguy
This document proposes adding peer-to-peer (P2P) support to the open-source VoIP and video conferencing application WengoPhone. The author plans to implement a P2P-SIP architecture using a Chord distributed hash table within a hierarchical network of super nodes. Key aspects to be addressed include integrating the P2P layer into the SIP protocol stack, supporting locality and proximity, and evaluating security through analyzing potential attacks and implementing countermeasures. The proposed timeline is to complete the work by the end of April 2006, with evaluation based on scalability testing and damage assessment from conducted attack scenarios.
Similar to LibreSocial - P2P Framework for Social Networks - Overview (20)
Kalman Graffi - IEEE HPCS 2013 - Comparative Evaluation of P2P Systems Using ...Kalman Graffi
The document discusses the PeerfactSim.KOM simulator for evaluating peer-to-peer systems. It describes how PeerfactSim.KOM allows for:
1) Automated execution of large numbers of simulations in parallel by specifying simulation setups once.
2) Automated compilation and plotting of results from all simulations to compare performance of different protocols and parameters.
3) A layered architecture and common interfaces that enable flexible testing and evaluation of individual components like overlays, applications and network models.
Kalman Graffi - Monitoring and Management of P2P Systems - 2010Kalman Graffi
This is the long presentation of the contributions made in the dissertation of Dr.-Ing. Kalman Graffi - Monitoring and Management of P2P Systems. The talk was given at 29. Sept. 2009 in Madrid / Spain.
Kalman Graffi - 15 Slide on Monitoring P2P Systems - 2010Kalman Graffi
The document discusses monitoring and managing peer-to-peer (P2P) overlays. It notes that as P2P applications have evolved to support real-time services like voice/video, there is a need to coordinate millions of autonomous peers to provide controlled quality of service (QoS). The modular nature of P2P software also necessitates monitoring and management components to optimize performance across dynamic, heterogeneous networks of peers.
Dagstuhl 2010 - Kalman Graffi - Alternative, more promising IT Paradigms for ...Kalman Graffi
This document discusses alternative IT paradigms for digital social networks, specifically a peer-to-peer (P2P) based approach. It introduces LifeSocial.KOM, a secure P2P digital social network developed by the KOM research group. LifeSocial.KOM uses a distributed architecture that shifts costs and load to users, in contrast to traditional client-server social networks. It provides functionality for user profiles, content sharing, messaging, and interaction through a framework of reusable components and an underlying P2P overlay network.
This document discusses monitoring and managing peer-to-peer systems. It aims to coordinate millions of autonomous peers to provide controlled quality of service. Specifically, it addresses how to monitor system-specific and peer-specific metrics to analyze the current system state. It then proposes a self-configuration framework where the root peer derives and distributes new parameter configurations to reach predefined quality goals. The evaluation shows this approach enables quick convergence to quality intervals while imposing low overhead.
The document discusses monitoring and management of peer-to-peer (P2P) systems. It describes monitoring P2P systems to gather global statistics and peer-specific information. A self-configuration control loop is used to automate rule application and reach and maintain quality goals through incremental steps. The contact is Kalman Graffi of Paderborn University for further information.
Kalman Graffi - 3rd Research Talk - 2010Kalman Graffi
The document discusses monitoring and managing peer-to-peer overlays through a self-configuration cycle that involves monitoring the system state, analyzing the metrics to derive a new parameter configuration, and distributing the new configuration to peers in order to meet predefined quality goals for the overlay. The goal is to coordinate millions of autonomous peers to provide controlled quality of service through an automated process of reconfiguring established peer-to-peer overlays.
IEEE P2P 2009 - Kalman Graffi - Monitoring and Management of Structured Peer-...Kalman Graffi
The peer-to-peer paradigm shows the potential to provide the same functionality and quality like client/server based systems, but with much lower costs. In order to control the quality of peer-to-peer systems, monitoring and management mechanisms need to be applied. Both tasks are challenging in large-scale networks with autonomous, unreliable nodes. In this paper we present a monitoring and management framework for structured peer-to-peer systems. It captures the live status of a peer-to-peer network in an exhaustive statistical representation. Using principles of autonomic computing, a preset system state is approached through automated system re-configuration in the case that a quality deviation is detected. Evaluation shows that the monitoring is very precise and lightweight and that preset quality goals are reached and kept automatically.
The document discusses aspects of autonomic computing applied to peer-to-peer (P2P) systems to manage quality of service. It describes using a monitoring mechanism called SkyEye.KOM to gather statistics on P2P systems in a scalable and self-organizing way. Based on the monitoring data, the system can analyze for deviations from preset quality levels, plan adaptations like changing routing table sizes, and execute adaptations to reach and maintain quality goals. Simulations showed the approach enables P2P systems to precisely reach and hold preset quality intervals through self-configuration.
Cebit 2008 - PeerfactSim.KOM - A Simulator for Large Scale Peer-to-Peer SystemsKalman Graffi
This document describes a simulator called PeerfactSim.KOM for large scale peer-to-peer systems. PeerfactSim.KOM will be presented at CeBIT from March 4-10, 2008. The simulator models different aspects of peer-to-peer networks including user behavior, applications, overlay structures, transport protocols, and network effects. It aims to support research and development of new peer-to-peer applications.
Kalman Graffi - 2rd Research Talk - 2009Kalman Graffi
This document outlines a framework for self-optimizing peer-to-peer (P2P) systems. It discusses using a distributed control loop across peers to enable parameter-specific quality of service (QoS) adaptation. This involves optimizing overlay bandwidth management within individual peers and load balancing in heterogeneous P2P networks. It also proposes a system-wide information management architecture using an over-overlay called SkyEye.KOM to facilitate distributed analysis and decision making across the P2P system. Future work involves further developing the distributed analysis and decision components and evaluating the self-optimization framework.
The document proposes a system management framework using an information management system to allow peer-to-peer networks to self-optimize. The information management system would gather statistics across different layers and modules. It would analyze the statistics to identify correlations and propose optimized parameter settings. This would allow the system to find appropriate peers according to their capacities and derive settings to improve quality of service and efficiency.
IEEE ICPADS 2008 - Kalman Graffi - SkyEye.KOM: An Information Management Over...Kalman Graffi
In order to ease the development and maintenance of more complex P2P applications, which combine multiple P2P functionality (e.g. streaming and dependable storage), we suggest to extend structured P2P systems with a dedicated information management layer. This layer is meant to generate statistics on the whole P2P system and to enable capacity-based peer search, which helps the individual functionality layers in the P2P application to find suitable peers for layer-specific role assignment. We present in this paper SkyEye.KOM, an information management layer applicable on DHTs, which fulfills these desired functionality. SkyEye.KOM builds an over-overlay, which is scalable by leveraging the underlying DHT, easy to deploy as simple add-on to existing DHTs and efficient as it needs O(log N) hops per query and to place peer-specific information network wide accessible. Evaluation shows that SkyEye.KOM has a good query performance and that the costs for maintaining the over-overlay are very low.
ACM NOTERE 2008 - Kalman Graffi - From Cells to Organisms - Long-Term Guarant...Kalman Graffi
The peer-to-peer paradigm gained more and more impact in the last years. The reason for P2P arising now is related to the continuous development of device capabilities in the last years, like CPU power, storage space and bandwidth. However, the demand for services and resources is permanently increasing, although the peers have a variety of other resources themselves. In this paper we present the idea of a P2P system acting as a service provider using the resources of participating peers and stating guarantees on the quality of the service it provides. In order to fulfill these service level agreements, the peers confederate to a distributed supervisor of peer resources (P2PCLOUD), monitoring the network, predicting trends on resource availabilities and deciding on resource allocation strategies. This paper discusses the challenges and a solution draft of the concept of P2PCLOUD.
APNIC Foundation, presented by Ellisha Heppner at the PNG DNS Forum 2024APNIC
Ellisha Heppner, Grant Management Lead, presented an update on APNIC Foundation to the PNG DNS Forum held from 6 to 10 May, 2024 in Port Moresby, Papua New Guinea.
Bridging the Digital Gap Brad Spiegel Macon, GA Initiative.pptxBrad Spiegel Macon GA
Brad Spiegel Macon GA’s journey exemplifies the profound impact that one individual can have on their community. Through his unwavering dedication to digital inclusion, he’s not only bridging the gap in Macon but also setting an example for others to follow.
Discover the benefits of outsourcing SEO to Indiadavidjhones387
"Discover the benefits of outsourcing SEO to India! From cost-effective services and expert professionals to round-the-clock work advantages, learn how your business can achieve digital success with Indian SEO solutions.
Ready to Unlock the Power of Blockchain!Toptal Tech
Imagine a world where data flows freely, yet remains secure. A world where trust is built into the fabric of every transaction. This is the promise of blockchain, a revolutionary technology poised to reshape our digital landscape.
Toptal Tech is at the forefront of this innovation, connecting you with the brightest minds in blockchain development. Together, we can unlock the potential of this transformative technology, building a future of transparency, security, and endless possibilities.
LibreSocial - P2P Framework for Social Networks - Overview
1. A P2P-Framework
for Social Networks
Jun.-Prof. Dr.-Ing.
Kalman Graffi
www.p2pframework.com
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 1
2. A P2P-Framework for Social Networks
Overview – A quick 101
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 2
3. LifeSocial – A Secure P2P-based OSN Platform
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 3
History
Developed since 2007
• > 55 students worked on it
• See you at CeBIT 2013
Aiming at applicable results in p2p research
Goal
Facebook-like user experience
• Basis functionality extendible through plugins
• Data-centric (profiles) and user-to-user (chat,video) interaction
• BUT: security guarantees
Operator view
• Completely p2p-based
• BUT: with quality of service control and guarantees
Research
• New application leads to new requirements
• New requirements to new results
4. Main Ideas in LifeSocial
General p2p platform
Combining a wide set of useful modules
• Storage, messaging, security, caching, app-hosting, multicast, pub/sub …
• Distributed data structures, monitoring, automated self-control
Social network on top of platform
• Build through “plugins” (apps), using platform and each other
• Extendable, configurable GUI supports app growth
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 4
Security goals
Access controlled secure storage
Secure (encrypted, authenticated, integer) communication
No trust assumptions anybody may be bad
Functional goals
For the users: Facebook-like
Also thinking of providers: quality monitoring and control plane
5. User View: Rich Functionality
Wide set of functionality
GUI-Framework like in Eclipse
Fast and user-friendly performance
Plugin-based application:
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 5
• Profile
• Login
• Friends
• Groups
• Mails
• Photos
• Chat
• …
K. Graffi et al., “LifeSocial.KOM: A P2P-based Platform for Secure Online Social Networks”, In: IEEE P2P’10
8. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 8
Management View
9. P2P Framework for Social Networks
Graphical User Interface Framework
Plugin GUI Plugin GUI Plugin GUI
Commands Interface
Optional Plugins
OpOtipotnioanl aPll uPgluingsins
Mandatory Plugins
Mandatory Plugins
Mandatory Plugins
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Structured P2P Overlay
Internet
Storage and
Replication
Testing
Communication
Channels:
Monitoring
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 9
P2P Framework Plugins and Apps GUI
App - Market
10. P2P Framework - Overlay
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 10
Structured p2p overlay
FreePastry
For security reasons
• Buckets as routing entries
• Redundant routing
• Iterative routing
Identity management
To identify users uniquely:
Create private & public key
Use public key as node ID
• Integrates public key infrastructure
• Enables signing & encryption of
communication
User & group management
Group keys
Group member management
Forming of nested groups (subsets)
and group key inheritance
Internet
User & Group
Management
Structured P2P Overlay
11. P2P Framework - Storage
Access Control
Storage and
Replication User & Group
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 11
PAST
Storage and replication
Verification of authorship
Modified to
• allow in place updates of data
• serve data from previous
downloaders (load balancing)
Access control
Sign and encrypt content
Access control based on
• User lists
• Groups
Internet
Management
Structured P2P Overlay
12. P2P Framework – Communication and Data Structures
Distributed data structures
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 12
Normal approach:
• Get data, change locally, upload
Remote operations:
• Send only information to change
• E.g. insert “alice” in list
Supported structures:
• Set, list, groups, prefix tree
Communication channels
1-to-1 (based on ID)
• E.g. to copy/stream file
Topic-based pub/sub
• Using Scribe
Streaming
• Using Splitstream
Multi-criterion indexing and search
• E.g. Person name, age, location …
Aggregation tree
• Sum, min, max, avg
• For individual topics
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
P2P Framework
13. P2P Framework - Services
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 13
Monitoring
Captures events from plugins
and in framework
Uses aggregation tree to gather
statistics on system
Testing
Enables to initiate remote
commands for testing
E.g. Initiates in a 50 nodes network
defined behavior set (based on
measurements)
App – Market
All Plugins are OSGi – bundles
Can be loaded, installed at runtime
Define dependencies
App market:
• Host, search and install plugins
• Determine and get dependencies
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
Monitoring
Testing
P2P Framework
App - Market
14. LifeSocial: Plugins implementing a Social Network
Commands Interface
Optional Plugins
OpOtipotnioanl aPll uPgluingsins
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Storage and
Replication
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 14
Plugins:
Using the P2P Framework
Written in Java, OSGi
• Open Services Gateway initiative
• Supports component model
(bundle/service)
Functionality of social networks
Easy Plugin-to-Plugin
communication
• Over shared storage
– E.g. photos
• Over Plugin ID based messaging
– E.g. Chat-app to chat-app
Mandatory Plugins
Login, Profile, Friends, Wall,
Groups, Photos, Chat, Messaging,
Filetransfer (1-to-1), App-Market
Optional Plugins
Voting, Multi-Chat, One-Click-
Filehosting, Forum Internet
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
Monitoring
Testing
Mandatory Plugins
Mandatory Plugins
Mandatory Plugins
P2P Framework Plugins and Apps
App - Market
15. LifeSocial: Graphical User Interface
Graphical User Interface
GUI Framework able to host
individual Plugin Views
Allows to arrange views
• Save / load arrangements
Graphical User Interface Framework
Plugin GUI Plugin GUI Plugin GUI
Commands Interface
Optional Plugins
OpOtipotnioanl aPll uPgluingsins
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 15
Views
Each Plugin comes with 1+
views
Some views use several
Plugins
E.g. friends selector
E.g. message views
• inbox, outbox, compose
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
Monitoring
Testing
Mandatory Plugins
Mandatory Plugins
Mandatory Plugins
P2P Framework Plugins and Apps GUI
App - Market
16. A P2P-Framework for Social
Networks
P2P Overlay – Pastry
Root of Trust
Modified Routing – Buckets
Iterative Routing
Parallel Routing
Handling Weak Nodes
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 16
17. P2P Framework - Overlay
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 17
Structured p2p overlay
FreePastry
For security reasons
• Buckets as routing entries
• Redundant routing
• Iterative routing
Identity management
To identify users uniquely:
Create private & public key
Use public key as node ID
• Integrates public key infrastructure
• Enables signing & encryption of
communication
User & group management
Group keys
Group member management
Forming of nested groups (subsets)
and group key inheritance
Internet
User & Group
Management
Structured P2P Overlay
18. Pastry / FreePastry – Introduction
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 18
Pastry: P2P overlay
Providing DHT functionality and Key-based Routing interface
Two metrics
ID distance
Physical distance (“Proximity”)
128-bit-IDs, arranged in a circle
Variable b defines the size of the routing steps = 2^b; usual value = 4
Tradeoff between routing table size and maximum number of hops
Lookup hops scale with 푂(푙표푔2푏 푁 )
FreePastry: prototypical implementation of Pastry
Current version 2.1: released on 13.3.2009
Java based, Sun JDK version 1.5.0
NodeID: 160 bits, 20 byte: 10 hexadecimal number
Custom modification (2012)
Java package is now part of p2p framework code
Allows modification
19. State Information in FreePastry
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 19
ID Space: [0 , 2^160[
Randomly assigned while joining
Base b (2 in example)
b=4 hexadecimal in FreePastry
Routing table
Used for prefix-based routing
Typical size:
• log_(2^b) (N) rows
• 2^b – 1 entries per row
Row nr. i contains only nodeIDs
sharing a prefix of length i with current
node
Leaf set
|L| closest node IDs
Typical size: L = 2^b or 2x2^b
Neighborhood set
M entries (typically M = 2x2^b)
Contains the nodeIDs and IP
addresses of locally closest nodes
Routing state of node 10233102, base 4
20. Pastry – Original Routing Procedure
In each routing step:
Prefix-based forwarding:
A node forwards a message to another node
• whose ID shares with the target key a prefix
• that is at least one digit (= b bits) longer
• than the prefix that is shared with the current node’s ID
If no such node is found:
Numerical distance based forwarding:
the message is forwarded to a node
• with the same shared prefix length which is numerically closer
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 20
21. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 21
Routing Protocol
Message for key K arrives at node X
Let X= 10233102, b=2
1. Check if K in scope of Leaf Set
E.g. K = 10233030
Direct forwarding to 10233033
2. If not (1) use Routing Table
Let l:= prefix length of K and X
E.g. K = 10320102, l=2
Check level 3, prefix 103 10-3-
23302
3. If not (1) and no routing table
entry
E.g. K = 10233300
Pick closest peer from routing table:
10233-2-32, as closer than 10233102
4. If X is closest to K than any node
in Leaf Set (and Routing Table)
X is responsible for K, routing ends
Routing state of node 10233102, base 2
22. A
B
…
T
Z
X
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 22
Pastry – Node join
New node X wants to join
A is assumed to be physically close to X
Z is assumed to be responsible for the key “X”
Join protocol
X asks existing node A to route JOIN message to key X
JOIN message will be routed to node Z which is closest to key X
A, Z and all nodes on the route send their state tables to X
X uses following sets as basis for its routing sets
A’s neighborhood set
Z’s leaf set
The n-th row of the routing table is copied from the n-th node encountered
during the JOIN message routing process
n = 0: A’s row 0
n = 1: B’s row 1…
Finally, X sends a copy of its state tables to all nodes contained in them
so that those nodes can update their state tables
23. Modification of Pastry’s Routing Table: Buckets
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 23
Introduction of Buckets
Each routing table entry contains k
many contacts
Allows for
• Parallel routing
• Node replacement
upon node failure
Coping with node failures
Nodes leave unexpectedly (fail)
For detection:
• Periodic checks of table entries
• Keep-alive messages
If node does not answer: failed
• Failure in Leaf Set:
– Update entry with leaf set of
furthest node
• Failure in Routing Table:
– Ask nodes in same row as failed
node
– If all in row failed: as nodes in
higher row
Contact 1
Contact 2
Contact 3
…
Contact k
24. Pastry – Modified Routing Procedure
Prefix-based, parallel and iterative routing
Loop until no closer node to target ID is revealed
• Lookup initiator sends out alpha parallel lookups
– To the alpha nodes sharing the longest prefix in his routing table with target ID
• Contacted nodes answer alpha contacts closest to the target ID
Closest found node is responsible
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 24
Protocol details
Alpha answers arrive randomly
• Process their results only
if their sent contacts are better
than previous contacts
Joining protocol requires
adaptation
25. Modification of Pastry’s Routing Table: Weak Nodes
Handling of weak nodes
Weak nodes should not
participate in
• Routing, routing maintenance
• Storage
Simply marking weak nodes
• Odd port: strong node
• Even port: weak node
• Port information part of contact
info
• Other marking solution requires
additional marking information
(+data structures in code) or
signaling protocols
Routing to/from weak nodes
Weak nodes are inserted only in
the leaf set (of close nodes)
Their routing table also contains
only the leaf set entries
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 25
26. Root of Trust: Authenticated Node IDs
Approach
Immutable UserID
• Identifying the user throughout the
system/application
• To be used by the plugins: in
friendlists, groups …
Mutable NodeID = PublicKey
• PublicKey uses 160 bit Elliptic Curve
• Username and Password are
hashed, used as basis for the Private
Key
• Private Key is used for calculation of
Public Key
Mapping from the NodeID to the
UserID stored at NodeID
• At IDs hash(UserID_i) (with i=1,…)
store link to NodeID
• Initial link at new user registration
– Requires no proof on user
– Is signed with new NodeID/PubKey
• Further changes of UserIDNodeID
link
– Are only allowed for previous signer
– Single Items only to be modified by
original author (signature check)
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 26
Goals
Users should be authenticated
Messages confidentially, integer
and authenticated sent/received
Login from any device possible,
credentials in the network
27. Root of Trust: Effects
Integrated Publiy Key Infrastructure
If UserID known, easy to obtain PublicKey
PublicKey can be stored
Secure communication
Confidential, integer, authenticated
Sending messages
• Message is signed with Public Key (=PubKey) of sender
• Message is encrypted with PubKey of addressed peer
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 27
Receiving messages
• Decrypt message using Private Key (=PrivKey) auth., confidentiality
• Receiver checks signature of sender integrity
For ease:
• User-User specific symmetric shared key might be exchanged securely before
– E.g. using Diffie-Hellman
Secure Storage
Items are signed when stored, can only be changed by original author
28. Properties of Pastry / FreePastry
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 28
Advantages
Well documented, clear APIs
Modular, extendable software
Large user base, still
maintained
Basic functionality
Routing, DHT (key-value
mapping)
Distributed storage
Disadvantages solved
Now: support for heterogeneity
All nodes are treated equally
Strong, long-living peers should
do more
See at storage part
Now: built-in security
mechanisms
Identity attacks, routing attacks
Sensitive to malicious nodes
Limited API P2P Framework
“Only DHT”
Also requires sufficient
replication, additional services
29. A P2P-Framework for Social
Networks
Storage and Replication
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 29
Replication
Access Control
Load-balancing
30. P2P Framework - Storage
Access Control
Storage and
Replication User & Group
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 30
PAST
Storage and replication
Verification of authorship
Modified to
• allow in place updates of data
• serve data from previous
downloaders (load balancing)
Access control
Sign and encrypt content
Access control based on
• User lists
• Groups
Keys
160 bit elliptic curve keys
128 bit AES symmetric keys
Internet
Management
Structured P2P Overlay
31. Positioning in the Network
User albums
object key =
„user name“+“album“
List of user albums:
1. object key a
2. object key b
3. object key c
4. object key d
User album A
Image x
Image y
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 31
...
object key a
List of images:
1. object key x
2. object key y
3. object key v
4. object key r
...
object key x
image
object key y
image
Distributed Storage
Object ID based Routing
User album D
object key d
List of images:
1. object key n
2. object key m
3. object key k
4. object key l
...
P2P Overlay
Peer ID based Routing
Internet
IP based Routing
32. Document Types, Obvious Storage Keys
Image x
Image y
High granularity of stored data objects
Better load balancing of the resources
Used for
Atomic data: profiles, login info, “emails”
Linked lists: friend lists, groups, multicast
Allows for complex data structures
User album A
Image n
Image m
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 32
User Albums
storage key =
„user name“+“album“
List of user albums:
1. storage key a
2. storage key b
3. storage key c
4. storage key d
...
storage key a
List of images:
1. storage key x
2. storage key y
3. storage key v
4. storage key r
...
storage key x
image
storage key y
image
User album D
storage key d
List of images:
1. storage key n
2. storage key m
3. storage key k
4. storage key l
...
storage key n
image
storage key m
image
Profile
storage key p =
“User_Kalman_Graffi”
Name: Kalman
Age: 30
University:
Universität
Düsseldorf
33. Atomic Single Item Operations
Basis for security must be
Easy to deploy, fast and reliable
Requirements for access control and item security
All sensible information is stored in DHT (no trust assumed)
Integrity / authentication
• Author is authenticated through signatures
• Signature allow to detect modifications
• Only one author for one data item
• Content integrity can be checked, false authorship can be rejected
Confidentiality: only authorized users should be able to read content
• The storing node is typically not allowed
• Data items can/should be encrypted
Data object must be atomic
Must contain all relevant security information
Replication
• Multiple storage of the same content
• Find 1 copy to read, all copies to write consistently
• Replication independent of security
Support for inplace modification
Support for group-based rights
H(„my data“ )
= 3107
2207
2906
1008 1622 2011
PeerID = PubKey
3485
709
611
?
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 33
34. Replication Extension of Pastry: PAST
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 34
Idea
Store objects also on k further nodes in leaf set
Remember Key-based Routing (KBR):
• nodehandle [] replicaSet (key k, int max rank)
– Returns an ordered set of peers of magnitude (max rank)
on which replicas of the object with key k can be stored
– The nodes which become roots for the key k when the local node fails
• update(nodehandle n, bool joined)
– Upcall: informs that node n has either joined or left the local neighbor set
If responsible peer fails
• New responsible node (is in replicaSet)
– Is informed of peer leave by update upcall
– Answers to lookups for new objects it is responsible for
– Calls new replicaSet and deployes replicas (if needed)
35. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 35
PAST Evaluation
Good
ID related replication: 1 lookup sufficient to find object
Replication ratio flexible (might depend on object / peer properties)
Failed replica nodes are detected by overlay: easy to react
Drawback
Replication not peer heterogeneity aware
• Weak nodes might be overloaded by replication task
• See next slide how to handle that in the P2P Framework
Security
• Replicas all in one ID area: easier to attack
• Still open
36. Modification: Heterogeneity Aware Storage
Best strategy to match nodes
having and wanting a file?
Object i
Requester
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 36
Considering:
• Memory, storage and bandwidth
Leading to
• Balanced load regarding the
load provision in the system
Approach
Responsible node remembers
downloading nodes (providers)
• Maintains a provider list
• Periodically checks their
bandwidth
– Through message size and
transmission time
• Forwards download query
(1 hop) to them based on load
• High capacity high probability
to be chosen
P3
P4
P5
P1
P2
P6
P7
Object i
Requester
Object i
Provider
P3
P4
P5
Object i
Provider
P1
P2
P6
P7
10
Responsible
for object 3
Peer Qual./Load
P1
P2
P6
ok
good
weak
P7 ok
Get object 3
from peer 2
Provider to
use: peer 2
37. Discussion: Heterogeneity Aware Storage
Heterogeneity aware storage
In addition to replication
Local solution
• If responsible node wants to share load, he may, but does not have to
• Source of file irrelevant for requester
– As files are atomically authenticated
Periodic capacity checks
Required some overhead
Are propagated back, so that nodes are aware of their capacities
Can be used for further purpose
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 37
38. Evaluation: Heterogeneity Aware Storage
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 38
Setup:
10 Machines, 3x TestCaseLoadPhoto in 12 secodns
Evaluation:
Red: responsible node, blue: a chosen provider
39. Simple Distributed Access Control for Single Objects
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 39
Goals:
Authentification of hosts (original author)
• Allows „Write“ access control
„Read“ access control on individual data items
Idea:
Remember established public key infrastructure
Write access control
• Initial write is free, data item is signed, authors Public Key is added
• Overwrite on existing Object ID only allowed to original author
• Protection against replay attacks:
– Random nonce is stored with item; nonce must also be signed with new item
• Storing nodes verifies signature
• ToDo: Replication nodes must also verify signature and verify correct
behavior of storing node
Read access control:
• Encrypt all stored data with unique symmetric key: Key_S
• Encrypt the symmetric key for all privileged reader: (Key_S)enc(PubKey_i)
• Attach the encrypted symmetric key to the encrypted data
40. Example of Distributed Access Control
SharedItem
objectID Header
Privileged users
Payload
Signed CryptedItem
objectID Key list
userID A – key A
userID B – key B
userID C – key C
…
3
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 40
Byte array
containing
encrypted
SharedItem
Symmetric Key
Pub
User A
Encrpyted
with
Symmetric Key
Pub
User B
Encrpyted
with
Pub
User A
Pub
User B
[userID A] =
[userID B] =
1
extract
Serialized and encrypted with
symmetic key
2
userIDs
are public
keys
wrap symmetric key
with public key
4
5
Signature
41. Group-based Access Control
Group-based Access Control
Groups have own keys Treated as single user
• Single data objects encrypted/signed with group keys
• Only group members can read / write
Group key is stored in single item by group creator
• Read access for group members
Group provides for its members
A symmetric key S_G and an asymmetric key pair (Public: e_G, Private: d_G)
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 41
42. Group-based Access Control
Challenge: Hierarchical structures of groups
Share content with combination of groups:
• G1 OR G2: Encrypt with 2 keys, provide both
• G1 AND G2: Encrypt data with first key,
encrypt result with second key
Hierarchical groups: G1 subgroup of G2
Groups may contain
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 42
User (keys)
Group (keys)
Encrypted item has a reference
to the group used for encryption
43. A P2P-Framework for Social
Networks
Peer-to-Peer Framework
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 43
Storage
• Distributed Data Structures
– Sets, Lists, Prefix-Hash Trees
• Remote Operations
• Access Control for Distributed Data Structures
Information Cache and Callbacks
Communication Channels
• 1-to-1, Multicast, Publish / Subscribe
• Search
App-Store
44. P2P Framework – Communication and Data Structures
Distributed data structures
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 44
Normal approach:
• Get data, change locally, upload
Remote operations:
• Send only information to change
• E.g. insert “alice” in list
Supported structures:
• Set, list, groups, prefix tree
Communication channels
1-to-1 (based on ID)
• E.g. to copy/stream file
Topic-based pub/sub
• Using Scribe
Streaming
• Using Splitstream
Multi-criterion indexing and search
• E.g. Person name, age, location …
Aggregation tree
• Sum, min, max, avg
• For individual topics
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
P2P Framework
45. Distributed Data Structures (DDS)
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 45
Motivation:
Put / Get of single data items does not match social network
Social network data structures:
• (Unorderd) Set: Friends, Group members, …
• (Ordered) List: Wall entries, Email posts, Forum entries
• Prefix Hash Trees: App categories, User categories …
Distributed Data Structures
Concept: Single data items with
• Characteristic meta data
• Payload
• Pointers to next elements in the
„distributed“ data structure
On right: functions of the list
Location of i-th element
– Key hash(„listname“ + i/bucketsize)
46. Basics of Distributed Data Structures
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 46
Interfaces
Common access to a DDS instance
for application
DDS in framework split in several
buckets
Buckets handled individually
Requirements:
Only owner allowed to edit/ delete a
list entry
Everyone allowed to add a list entry
Support groups: only group users
allowed to read or add a list entry
Buckets contain:
Individual entries
• May belong to different users
• Number of entries per bucket
configurable
Pointer to next bucket
Application using the Distributed Linked List
47. Distributed Data Structures: Write and Read Access
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 47
Add entry to the list
Free to write:
• Sign element with private key
of the owner
Write only for group members
• Sign element with private key
of the owner
• Encrypt each element of the
bucket with symmetric group
key
• Sign the bucket with private
group key
Read entry
Find and retrieve entry
Verify entry and bucket
signature
Edit an existing element
Create and sign new entry
Sign bucket (all entries of it)
Storing node recognizes list
buckets and verifies signatures
of bucket and elements
48. Distributed Data Structures: Deletion of Entries
Deleting an existing element
Deletion = overwrite with empty “Delete”-Entry (deletedItem)
Create and sign new “Delete”-entry
Sign bucket (all entries of it)
Storing node recognizes list buckets and verifies signatures of bucket
and elements
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 48
Problem
deletedItems stay in list
With time: list might contain almost only deleted Items
Solution:
Algorithm consolidates two buckets
• deletedItems shifted one bucket to the right
Called after each write operation if list contains deletedItem
• Only users with write rights can sign consolidated buckets
49. Consolidate Protocol
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 49
Before
BK contains a deletedItem
Consolidate(BK,BK+1) is called
After
BK BK‘, BK+1 BK+1‘
DeletedItem now on most right
position in BK+1‘
All other elements shifted to left
by one position
50. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 50
Remote Operations
DistributedList use the idea of remote operations
User wants to change a stored item
User sends request for change to storing node
Storing node performs change and stores the file
Advantage:
User need not transfer whole file but just the changes
Problem:
Write protection needs to be considered
Storing node performs changes and stores the modified item
But: storing node is usually not owner of the item
• Cannot compute valid signature
User sends delta information, how to sign whole new data item?
51. Protocol for Remote Operation with Write Access
Node C wants to modify an object stored at S:
If C does not have the current object
• It requests the current version of the file that should be changed from S.
C has the current object
• If C already has a version of the file, it sends a hash of it to S.
S compares the received hash with the hash of its current object version
• If the hashes differ: S replies with the current version
• If the hashes match: it acknowledges briefly.
C performs its changes locally and afterwards computes the signature of
the modified file and the hash of the file that should be overwritten
It sends a request containing the desired changes, the signature and the
hash of the file on which C locally performed the changes to S.
S checks whether its current version and the version on which C has
performed its changes are the same by comparing the hashes
• If they are not equal, step 3 is applied.
• If the hashes are equal: S performs the desired changes and then inserts the
file into the network using the signature received from C.
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 51
52. Evaluation of the Remote Operation and Deletion Consolidation
Setup: 1000 operations
Setting A presented
Traffic savings:
Through remote operations
and buckets with 10 entries
Consolidation further saves
traffic
Action distribution:
Consolidation
Reduces number of
deletedItems in list drastically
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 52
53. Accessing the Data: Information Cache and Callbacks
Pull approach: Information
Cache
Interface: getData(key)
Immediate response:
Plugins Plugins
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 53
• Data
– Lifetime x min, then new
lookup
• Pending
– While pending: data is
retrieved
• Not available
– Negative lookup
Allows data reuse by several
plugins – information container
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
P2P Framework
Information Cache
54. Accessing the Data: Information Cache and Callbacks
Push Approach: Callbacks /
Continuations
Plugins register for data(key)
If lookup for it is successfull
• Data is deliverd to waiting plugin
Framework supports different
situations:
Continuation - Asynchronous
operations
• e.g. storing and continue after it
Receiver - Register for receiving
content
• e.g. message receiving functions
Listener - Listen to ongoing
operations
e.g. status reports for file
transfers
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 54
55. Communication Structures
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 55
1-to-1 (based on ID)
E.g. to copy/stream file
For files also 1-click-hosting
• Store encrypted (Key K) file
• Under specific ID
• Retrieve by (ID+Key) (“link“)
Scribe: topic-based pub/sub
Using Scribe
Create channel, e.g. for
hash(“p2phhu”)
Send invitation via 1-to-n to
selected users they join
p2phhu channel
Messages sent to channel
p2phhu are received by
subscribed users
1-to-n
Send message 1-to-1 to n users
Multi-criterion indexing and
search
File has metadata: attributes
• Attributes: E.g. Person name,
age, location …
Attributes have values
Search for file with attr_i = x_i
Aggregation tree
Sum, min, max, avg, std dev
For individual topics
• One channel per metric
56. Main Communication Classes
Communication Classes
1-1, 1-N: MessageChannel
• Identified by unique name
• Both comm. partners need to create
this channel
• 1-to-N: Sender defines list of
receivers
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 56
N-to-m: TopicChannel
• Identified by unique name
• Participants subscribe at unique
name
• All messages sent to list are
forwarded to subscribers
Aggregate
• Attribute<T> holds for a single
measurement:
– name, unit, aggregation strategy
and the sensor it was measured
• Aggregation strategies
– Sum, count, average, min, max…
• Statistics on all nodes in AggChannel
57. Multi-Criterion Search
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 57
Query Language:
Keyword: describes a document
through a string
Attribute/Value: attribute
attached with numeric value
Query:
collection of keywords or
attribute/value pairs
(Keyword | (Attribute = Value))*
void indexItemWithTags ( Serializable
identifier,Collection <String > keywords );
void removeItemIndexWithTags ( Serializable
identifier, Collection <String > keywords );
Collection <Serializable>
searchAllItemsWithTags
(Collection <String > keywords );
Serializable searchItemWithTags (Collection
<String > keywords);
Distributed Query Engine:
Indexing
Takes any object and a collection of
keywords
Afterwards the object can be retrieved
throughout the p2p network
Querying
Takes a query (collection of keywords)
Returns the collection of objects,
where the query-keywords subset of
index-keywords of the objects
58. Implemented Search Engines, Common Indexing
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 58
LocalJoin
NetworkJoin
ScribeJoin
BloomNetJoin
59. Testing the Query Engines
Observation:
Churn disrupts system performance (even at
5%)
ScribeEngine has best query latency
• but long reconnect reconnect and indexing
latencies
BloomJoin does not signicantly reduce
network costs
ScribeEngine handles queries with many
keywords good
The others handle queries with very popular
keywords good
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 59
60. A P2P-Framework for Social
Networks
Peer-to-Peer Framework - Continued
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 60
Monitoring
• Tree-based Monitoring
Testing
• Test-Plugin
61. P2P Framework - Services
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 61
Testing
Enables to initiate remote
commands for testing
E.g. Initiates in a 50 nodes network
defined behavior set (based on
measurements)
Monitoring
Captures events from plugins
and in framework
Uses aggregation tree to gather
statistics on system
App – Market
All Plugins are OSGi – bundles
Can be loaded, installed at runtime
Define dependencies
App market:
• Host, search and install plugins
• Determine and get dependencies
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
Monitoring
Testing
P2P Framework
App - Market
62. Motivation for Testing and Monitoring
Test Plugin for LifeSocial
Coordinated automated
execution & delegation of tasks
Easy test setup
Generation of content
Expandable / Support for new
LifeSocial plugins
Wall
23 %
Initial
71 %
Messages
16 %
Profile and
Friends
71 %
Search
9 %
11 %
64 %
22 %
10 %
16 %
69 %
9 % 5 %
Photos Communities
67 %
86 %
82 %
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 62
Monitoring:
Information on system status can be used
for optimized decisions
• E.g. peer count defines size of time-to-live
• E.g. churn pattern defines stabilization
frequency
Necessary to identify (bad) quality of
mechanisms
• Too much overhead
• Too slow routing
• Efficiency leaks
Helps in designing better mechanisms
63. Test Plugin I – Easy Setup & Generation of Content
Automated Setup using Java RMI
“First” node creates P2P network and serves as bootstrap node
(Master node)
Other nodes join P2P network and await orders (Slave nodes)
User content is generated without need for user interaction
Resource folder contains photos and files
Values for messages, group names, city names, country names, user
interests, usernames, …
• Example: login.txt file contains more than 4000 possible usernames
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 63
64. Test Plugin II – Automated Execution of Activities
Activity: Execution of a social network function
Has parameters and preconditions
Example
• Activity: Send a chat message to a friend
• Precondition: Logged in and at least one friendship to another user
• Parameter: Actual message content and name of the friend
• If user has no friendship to another user, Test Plugin automatically sends
a friend request to a random (online) user
Preconditions are fulfilled if necessary
If activity parameters are missing
they are chosen randomly from
the resource files
Wall
23 %
Initial
71 %
Messages
16 %
Profile and
Friends
71 %
Search
9 %
11 %
64 %
22 %
10 %
16 %
69 %
9 % 5 %
Photos Communities
67 %
86 %
82 %
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 64
65. Test Plugin II – Automated Execution of Activities
View Group
Send Friend
Request
View Wall
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 65
Bootstrap Server Running
Existing User
Logged in User
Register
Login
Relogin Logout
Change Profile
Picture / Information
View
Profile
Friendship to other User
Send Chat Message
Active Chat Conversation
Reply to
Chat Message
Send Offline
Message
Active Conversation
Reply to
Offline Message
Create Group
View Friends
Groups
Group exists
Join Group
Member of Group
Send Group
Message
Send Wall Post
Wall Post Exists
Comment Wall Post
Search
User / Group
Incoming Friend Request
Accept Friend
Request
Existing Photo
View Friends
Photo
Create Photo Album
Existing Photo Album
Upload Photo
View Chat History
View
Offline Message
66. Test Plugin III – Delegation of Tasks
Every test participant can delegate tasks (social network
activities) to other test participants
Using 1-m messaging communication
Queue with remaining tasks to execute
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 66
Timed test plans
Realisitic churn model
67. Structured
Overlay: DHT
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 67
Monitoring
Is everything running fine?
How to debug and to gain insight?
How to improve the running
system?
Underlay:
The Internet
H(„my data“ )
= 3107
2207
7.31.10.25
12.5.7.31
peer-to-peer.info
95.7.6.10
berkeley.edu planet-lab.org
86.8.10.18
2906
3485
2011
1008 1622
709
611
89.11.20.15
?
68. Design decisions in SkyEye.KOM
New layer (vs. integrated)
New layer allows wider applicability
Set on top of KBR-compatible structured p2p overlays
Proactive (vs. reactive)
System state information is continuously interesting for all users
Monitoring topology: tree (vs. bus, ring, star, mesh)
Fixed out and in degree
Position assignment: dynamic and deterministic
Deterministic IDs used in topology, dynamically resolved with DHT
For all structured P2P overlays
Covered by DHT-function: route(msg, key), lookup(key)
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 68
69. Reliable structured p2p overlay
“Key-based Routing” – operations
• boolean isMyKey(Key K)
• void route(key K, Message M, node hint)
Building a tree topology
Introduce new overlay layer
• With own ID space ([0,1[)
Create tree topology in new overlay
• Using routing of p2p structured overlay
Concept of new layer
Decouples from specific p2p overlay
Unified ID space [0,1]
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 69
Assumptions
70. Tree-based Monitoring Mechanism
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 70
Idea:
Create (additional) tree topology
Protocol:
• Periodically
– Calculate aggregate of own local view and received from child nodes
– Send aggregate to parent node
• Root calculates global view
– And passes global view to all peers
Used in the p2p framework: SkyEye.KOM
Assumes structured p2p overlay
Aims at high precision with low overhead
71. SkyEye.KOM: Tree Topology
Tree of information domains
Domain Domain ID
0.09 0.2 0.31 0,4 0.5 0.6 0.75 0.9
0 1
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 71
Domain: ID interval
• E.g. [0, 0.5[ or [0.75, 0.875[
• Largest domain, level 0: [0,1[
Domain ID: “middle value” in interval
Domain size split in β parts per level
Domain IDs build tree topology
Node degree: β child nodes
Tree topology of domains does not change
over time!
Assignment of peers to domains dynamic
Peers to Domain ID assignment
Peers calculate Domains in which they are
located
For those domains, they calculate the
Domain IDs (퐾푝푙
)
If peer is responsible: position defined
1
10
50
20
30
40
45
15 P2P Overlay
Internet
0.25
0.375
0,3125
0.75
0.125 0.625 0.875
0.3125
0.5
72. SkyEye.KOM: Communication
Tree-overlay p2p overlay
Reconvert 푡푟푒푒퐼퐷 ∈ [0,1[
to 푝푒푒푟퐼퐷 ∈ {0, … , 2160 − 1}
Coordinator:
• Responsible for Domain ID
• Check via DHT function
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 72
– isMyKey(Key K)
For communication in tree
• Use route-function of overlay
• route(Msg M,Key K,Node next)
Example tree
Tree degree (β) = 2
• Results in logarithmic tree size
Balanced, if ID space balanced
Not always β children
• Peers may be Coordinators at
various levels
73. SkyEye.KOM: Communication Protocol
Gathering global view
All peers measure local status 푥푖
Periodically sent to parent peer
• Update Interval (UI)
1. Independent updates
in UI intervals per node
2a
Aggregated
view
1b
2. ACKs with view of parent
peer for every update
1β
2b
… 1a
β child nodes
2β
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 73
Aggregation
Direct: count, sum, minimum,
maximum, sum of squares
Derived: mean, variance, std.
deviation
Dissemination of global view
Global view in root
Every update message is
acknowledged
Contains global view from level
above
Global view
Local measures, (synchronized signal in simulations)
75. Activity Amount of Repetitions Planned Duration (in
Minutes)
Login 1 15
Change Profile Picture 1 3
Send Friend Request 10 3
Create Photo Album 10 2
Upload Photo 200 15
View Friend’s Photo 100 10
Join Group 30 10
Send Group Message 100 10
View Group Messages 10 5
Send Wall Post 100 10
Comment Wall Post 100 50
View Friend’s Wall 5 5
Random Activities - 30
Logout 1 50
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 75
Example: Test Plan
76. Example: Test 3 – Results
Amount of Nodes Available and Used Storage
60000
50000
40000
30000
20000
10000
Storage Dispatcher Size
Used Storage
Available Storage
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 76
125
100
75
50
25
0
Nodes
Global network nodes
0 60 120 180 240
Nodes
Time [m]
0
0 60 120 180 240
Data [MB]
Time [m]
77. Example: Test 3 – Results
Load – Messages Load – StorageItems
Social Network Load - Messages
25000
20000
15000
10000
5000
Social Network Load - StorageItems
Groups created
Photo albums created
Photos uploaded
Login items created
Profiles created
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 77
14000
12000
10000
8000
6000
4000
2000
0
Group Messages sent
Wall Posts sent
Wall Comments sent
Friend Requests sent
0 60 120 180 240
Units
Time [m]
0
0 60 120 180 240
Units
Time [m]
78. Example: Test 3 – Results
Photos Plugin Wall Plugin
12000
10000
8000
6000
4000
2000
Wall Plugin
Wall posts send
Wall posts commented
Walls requested
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 78
90000
80000
70000
60000
50000
40000
30000
20000
10000
0
Photos Plugin
0 60 120 180 240
Units
Time [m]
Albums created
Photos uploaded
Albums stored
Photos stored
0
0 60 120 180 240
Units
Time [m]
79. Example: Test 3 – Results
Groups Plugin Login Plugin
700
600
500
400
300
200
100
Login Plugin
Login Items created
Login Items stored
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 79
14000
12000
10000
8000
6000
4000
2000
0
Groups Plugin
Groups Items created
Group Items stored
Group Messages sent
0 60 120 180 240
Units
Time [m]
0
0 60 120 180 240
Units
Time [m]
80. Example: Test 3 – Results
Storage per Node Replication Count
Storage Used per Node
Maximum Storage Used per Node
Mean Storage Used per Node
Minimum Storage Used per Node
1e+06
100000
10000
1000
100
10
Replication Count
Overall Replications
Maximum Replications per Node
Mean Replications per Node
Minimum Replications per Node
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 80
600
500
400
300
200
100
0
0 60 120 180 240
Data [MB]
Time [m]
1
0 60 120 180 240
Units
Time [m]
81. Example: Test 3 – Results
Bandwidth – Messages Traffic
Bandwidth - Messaging
60
50
40
30
20
10
Bandwidth - Storage
Bandwidth - Data sent
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 81
2500
2000
1500
1000
500
0
Bandwidth - Messages sent
0 60 120 180 240
messages/sec
Time [m]
0
0 60 120 180 240
KB/sec
Time [m]
82. Example: Test 3 – Results
Amount of Errors Memory Usage
FreePastry Errors
900
800
700
600
500
400
300
200
100
Memory Usage
Maximum memory used by an instance
Mean memory used by an instance
Minimum memory used by an instance
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 82
6000
5000
4000
3000
2000
1000
0
0 60 120 180 240
Errors
Time [m]
Pastry errors
Decryption errors
PAST errors
0
0 60 120 180 240
Memory [MB]
Time [m]
83. Test Results – Summary I
Synthetic Behavior of P2P Framework tested with 25, 50 and 100 nodes
Amount of actual executed activities measured (uploaded photos, commented
wall posts, …)
Measured values match the expected values (according to the test plans)
LifeSocial behaves as expected during synthetic tests
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 83
Performance
All activities finished in scheduled time or earlier (except for commenting wall
posts)
• > 19.000 photos in 13 minutes, 9600 group messages in 8 minutes, 9600 wall posts sent
in 7 minutes
Bandwidth usage per node
Always below 30 Kb/s
In average: around 3 Kb / s
Data Storage
Each Item replicated at least 2 times (matches defined replication factor)
An average node contributed around 200 Mb storage space with a max-min load
divergence of 350Mb:50Mb
84. Test Results – Summary II
Monitoring and Test Plugin work reliable
Small variances on monitoring results, still precise
Test Plugin is a powerful tool to coordinate large-scale distributed tests
But: Prior tests revealed errors in LifeSocial
Memory leak in FreePastry (has been fixed)
Failure in MessageDispatcher
• Deadlock leads to unresponsive application
• Chat Plugin has been disabled for remaining tests
Error-prone usage of LoginItem to obtain node ID
• If the application crashes, the system assumes the user is still online
Failures in Search & Wall Plugin occur in unstable test
environment (with churn)
Failure in Search Plugin
• Leads to endless search operations
Failure in Wall Plugin
• ClassCastException leads to application crash
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 84
85. Appstore - Requirements
Appstore: Offer and retrieve new plugins
Some Requirements:
Two roles: plugin provider and plugin user
Plugin provider can publish new plugins, release new versions, edit or
delete them
Plugin user can search for plugins, download, install them and
manage installed plugins
Installed plugins: start/stop/update/uninstall
Related GUI for the above mentioned functionalities:
Publisher View
Search View
Installed Plugins View
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 85
86. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 86
Appstore - Details
Plugin – Model
Plugin object
Metadata: Plugin meta, version meta
Private repository (with unique user-related name)
Contains the information of:
• Published plugins
– Offered plugins
• Installed plugins
– In order to maintain app-list in the network
– Allows to install all apps at other device
Publisher actions: publish, remove, release new version, edit metadata
Storage: Plugin object and metadata network
Meta-information of the published plugins private repository
Search actions: precise search by name, download and install
Exact plugin name is required
Output: list of avaliable versions
Plugin user actions: start, stop, update, uninstall
87. A P2P-Framework for Social
Networks
Plugins and Graphical User Interface
Mandatory Plugins
Optional Plugins
Graphical User Interface
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 87
GUI Framework
Perspectives
Individual Views
88. LifeSocial: Plugins implementing a Social Network
Commands Interface
Optional Plugins
OpOtipotnioanl aPll uPgluingsins
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Storage and
Replication
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 88
Plugins:
Using the P2P Framework
Written in Java, OSGi
• Open Services Gateway initiative
• Supports component model
(bundle/service)
Functionality of social networks
Easy Plugin-to-Plugin
communication
• Over shared storage
– E.g. photos
• Over Plugin ID based messaging
– E.g. Chat-app to chat-app
Mandatory Plugins
Login, Profile, Friends, Wall,
Groups, Photos, Chat, Messaging,
Filetransfer (1-to-1), App-Market
Optional Plugins
Voting, Multi-Chat, One-Click-
Filehosting, Forum Internet
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
Monitoring
Testing
Mandatory Plugins
Mandatory Plugins
Mandatory Plugins
P2P Framework Plugins and Apps
App - Market
89. LifeSocial: Graphical User Interface
Graphical User Interface
GUI Framework able to host
individual Plugin Views
Allows to arrange views
• Save / load arrangements
Graphical User Interface Framework
Plugin GUI Plugin GUI Plugin GUI
Commands Interface
Optional Plugins
OpOtipotnioanl aPll uPgluingsins
Remote Operations:
Distributed Data
Structures: Prefix
tree, List, Set, Groups
Access Control
Identity Management
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 89
Views
Each Plugin comes with 1+
views
Some views use several
Plugins
E.g. friends selector
E.g. message views
• inbox, outbox, compose
Internet
Storage and
Replication
Communication
Channels:
1-to-1, Pub/Sub,
Aggregation Tree
User & Group
Management
Structured P2P Overlay
Monitoring
Testing
Mandatory Plugins
Mandatory Plugins
Mandatory Plugins
P2P Framework Plugins and Apps GUI
App - Market
90. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 90
Current Plugins
Login
Create and login to user account
Profile
Create and share personal information
Friends
Link to friends
Mails
Send and receive messages
Photos
Upload, share and watch photos
Wall
Write public messages, post own
status, comment messages
Chat
Chat with a friend
Multi-Chat
Create / Join a topic channel and chat
Browser
Extended views to display formated
entries or websites
Groups
Join groups and use dedicated working
environments
Forum (Group element)
Create threads and topics
Discuss on topics
Voting
Create polls, define answers, invite
participants for public/private votes
File Storage
One-click file hosting: upload, get a link,
share the link and allow other users to
download files
App Store
Create and share new plugins
Maintain own plugin list independent of used
device
Monitoring
Monitor usage of the network
Existing graphical user interface
Test plugin
Remotely control network peers for
automatic test plan execution
Content generation and real user
environment simulation
91. (Outdated) Plugin Architecture Overview
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 91
92. Plugins to GUI Relation
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 92
95. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 95
Management View
96. Graphical User Interface Details
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 96
Task of views
Combine functionality from framework to applications
Often uses several plugins
Plugins might come with 0-n views
Email has 2+ views
• Compose, inbox/outbox
Some plugins have no views
• Search plugin only as helper
Perspectives
View combinations and positions can be stored as perspectives
Allows for customized allocations
• E.g. Working perspective, communincation perspective …
97. A P2P-Framework for Social
Networks
Outlook – Future Work
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 97
98. Current Steps in LifeSocial
Ongoing project group (16 students)
“A Peer-to-Peer Framework for Social Networks”
Goal
• Finalize p2p framework: secure, quality-controlled, …
• Add further essential functionality to framework
– Live multimedia streams (chatting, streaming)
• Add more novel applications
2014 presentation at CeBIT
Like 2009, 2010, 2012, 2013
Contributions for the community
New applications induce new research challenges
Publish p2p framework as open source
Initiate a community for further developments
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 98
99. Several Open Topics and Application Areas
E-Learning Environment
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 99
Live lectures, tests
Data repository
Realtime Communication
Voice / video
P2P Wiki
Versioning
P2P Normsetting Environment
Proposals, Votes
Decisions
General Peer-to-Peer Framework
Service and Ressource Access Networking and Storage Monitoring and Control Security and Privacy
100. Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 100
Publications
P2P Framework – LifeSocial Overview
K. Graffi, C. Groß, D. Stingl, D. Hartung, A. Kovacevic, R.
Steinmetz „LifeSocial.KOM: A Secure and P2P-based Solution
for Online Social Networks“. In: Proc. of the IEEE Consumer
Communications and Networking Conference, (IEEE
CCNC’11), Januar 2011
K. Graffi, C.Groß, P. Mukherjee, A. Kovacevic, R. Steinmetz:
„LifeSocial.KOM: A P2P-based Platform for Secure Online
Social Networks“. In: Proc. of the 10th IEEE International
Conference on Peer-to-Peer Computing, (IEEE P2P’10),
August 2010.
K. Graffi, S. Podrajanski, P. Mukherjee, A. Kovacevic, R.
Steinmetz: „A Distributed Platform for Multimedia
Communities“. In: Proc. of the IEEE International Symposium
on Multimedia (IEEE ISM ’08), December 2008.
Security
K. Graffi, P. Mukherjee, B.Menges, D. Hartung, A. Kovacevic,
R. Steinmetz: „Practical Security for P2P-based Social
Networks“. In: Proc. of the 9th IEEE International Conference
on Local Computing Networks, (IEEE LCN’09), August 2009.
Monitoring
K. Graffi, D.Stingl, J. Rueckert, A. Kovacevic, R. Steinmetz:
„Monitoring and Management of Structured P2P Systems“. In:
Proc. of the 9th IEEE International Conference on Peer-to-Peer
Computing, (IEEE P2P’09), September 2009.
K. Graffi, A. Kovacevic, S. Xiao, R. Steinmetz: „SkyEye.KOM:
An Information Management Over-Overlay for Getting the
Oracle View on Structured P2P Systems“. In: Proc. of the 14th
IEEE International Conference on Parallel and Distributed
Systems (IEEE ICPADS’08), December 2008.
K.Graffi, „Monitoring and Management of Peer-to-Peer
Systems“, Technische Universität Darmstadt, 2010.
Heterogeneity handling
K.Graffi, S. Kaune, K.Pussep, A.Kovacevic, R.Steinmetz:
“Load Balancing for Multimedia Streaming in Heterogeneous
Peer-to-Peer Systems“. In: Proc. of the 8th ACM SIGMM Int.
Workshop on Network and Operating Systems Support for
Digital Audio and Video (ACM NOSSDAV ’08), May 2008.
Related evaluation tools:
M. Feldotto, K. Graffi: “Comparative Evaluation
of Peer-to-Peer Systems using
PeerfactSim.KOM “. In Proc. of the IEEE
International Conference on High Performance
Computing and Simulation (IEEE HPCS ’13),
2013
K. Graffi: “PeerfactSim.KOM: A P2P System
Simulator – Experiences and Lessons
Learned“. In: Proc. of the IEEE International
Conference on Peer-to-Peer Computing, (IEEE
P2P’11), August 2011
Related load-balancing / heterogeneity
awareness
L. Bremer, K. Graffi: “Symbiotic Coupling of
P2P and Cloud Systems: The Wikipedia Case“.
In Proc. of the IEEE International Conference
on Communications (IEEE ICC ’13), 2013
P. Wette, K. Graffi: “Adding Capacity
Awareness and Load Balancing to
Homogeneous Distributed Hash Tables“. In
Proc. of the IEEE International Conference on
Networked Systems (IEEE NetSys ’13), 2013
K. Graffi, C. Groß, D. Stingl, H.Nguyen, A.
Kovacevic, R. Steinmetz: „Towards a P2P
Cloud: Reliable Resource Reservations in
Unreliable P2P Systems“.In: Proc. of the 16th
IEEE International Conference on Parallel and
Distributed Systems, (IEEE ICPADS’10),
December 2010
101. A Peer-to-Peer Framework for Social Networks
More information: www.p2pframework.com
Jun.-Prof. Dr.-Ing. Kalman Graffi, P2P-Framework for Social Networks, www.p2pframework.com 101