Pub Date : 2010-12-01DOI: 10.4108/ICST.COLLABORATECOM.2010.34
Jianxia Chen, Lakshmish Ramaswamy, D. Lowenthal, S. Kalyanaraman
The publish-subscribe (pub-sub) paradigm is maturing and integrating into community-oriented collaborative applications. Because of this, pub-sub systems are faced with an event stream that may potentially contain large numbers of redundant and partial messages. Most pub-sub systems view partial and redundant messages as unique, which wastes resources not only at routers, but also at possibly resource constrained subscribers. In this paper, we present Caeva, a customizable and adaptive event aggregation framework. The design of Caeva exhibits three novel features. First, the tasks of merging messages and eliminating redundancies are shared among multiple, physically distributed brokers called aggregators. Second, we design a decentralized aggregator placement scheme that continuously adapts to decrease messaging overheads in the face of changing event publishing patterns. Third, we allow subscribers to choose a notification schedule that meets their specific needs. Results of extensive experiments show that Caeva is quite effective in providing flexibility and efficiency.
{"title":"CAEVA: A customizable and adaptive event aggregation framework for collaborative broker overlays","authors":"Jianxia Chen, Lakshmish Ramaswamy, D. Lowenthal, S. Kalyanaraman","doi":"10.4108/ICST.COLLABORATECOM.2010.34","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.34","url":null,"abstract":"The publish-subscribe (pub-sub) paradigm is maturing and integrating into community-oriented collaborative applications. Because of this, pub-sub systems are faced with an event stream that may potentially contain large numbers of redundant and partial messages. Most pub-sub systems view partial and redundant messages as unique, which wastes resources not only at routers, but also at possibly resource constrained subscribers. In this paper, we present Caeva, a customizable and adaptive event aggregation framework. The design of Caeva exhibits three novel features. First, the tasks of merging messages and eliminating redundancies are shared among multiple, physically distributed brokers called aggregators. Second, we design a decentralized aggregator placement scheme that continuously adapts to decrease messaging overheads in the face of changing event publishing patterns. Third, we allow subscribers to choose a notification schedule that meets their specific needs. Results of extensive experiments show that Caeva is quite effective in providing flexibility and efficiency.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133521995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-01DOI: 10.4108/ICST.COLLABORATECOM.2010.14
Qinyuan Feng, Ling Liu, Y. Sun, Ting Yu, Yafei Dai
This paper presents MAPS — a personalized Multi-Attribute Probabilistic Selection framework — to estimate the probability of an item being a user's best choice and rank the items accordingly. The MAPS framework makes three original contributions in this paper. First, we capture the inter-attribute tradeoff by a visual angle model which maps multi-attribute items into points (stars) in a multidimensional space (sky). Second, we model the inter-item competition using the dominating areas of the stars. Third, we capture the user's personal preferences by a density function learned from his/her history. The MAPS framework carefully combines all three factors to estimate the probability of an item being a user's best choice, and produces a personalized ranking accordingly. We evaluate the accuracy of MAPS through extensive simulations. The results show that MAPS significantly outperforms existing multi-attribute ranking algorithms.
{"title":"Enhancing personalized ranking quality through multidimensional modeling of inter-item competition","authors":"Qinyuan Feng, Ling Liu, Y. Sun, Ting Yu, Yafei Dai","doi":"10.4108/ICST.COLLABORATECOM.2010.14","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.14","url":null,"abstract":"This paper presents MAPS — a personalized Multi-Attribute Probabilistic Selection framework — to estimate the probability of an item being a user's best choice and rank the items accordingly. The MAPS framework makes three original contributions in this paper. First, we capture the inter-attribute tradeoff by a visual angle model which maps multi-attribute items into points (stars) in a multidimensional space (sky). Second, we model the inter-item competition using the dominating areas of the stars. Third, we capture the user's personal preferences by a density function learned from his/her history. The MAPS framework carefully combines all three factors to estimate the probability of an item being a user's best choice, and produces a personalized ranking accordingly. We evaluate the accuracy of MAPS through extensive simulations. The results show that MAPS significantly outperforms existing multi-attribute ranking algorithms.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128052329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-01DOI: 10.4108/ICST.COLLABORATECOM.2010.52
Yan Zhu, Zexing Hu, Huaixi Wang, Hongxin Hu, Gail-Joon Ahn
With the wide use of online social networks (OSNs), the problem of data privacy has attracted much attention. Several approaches have been proposed to address this issue. One of privacy management approaches for OSN leverages a key management technique to enable a user to simply post encrypted contents so that only users who can satisfy the associate security policy can derive the key to access the data. However, the key management policies of existing schemes may grant access to unaurhorized users and cannot efficiently determine authorized users. In this paper, we propose a collaborative framework which enforces access control for OSN through an innovative key management focused on communities. This framework introduces a community key management based on a new group-oriented convergence cryptosystem, as well as provides an efficient privacy preservation needed in a private OSN. To prove the feasibility of our approach, we also discuss a proof-of-concept implementation of our framework. Experimental results show that our construction can achieve the identified design goals for OSNs with the acceptable performance.
{"title":"A collaborative framework for privacy protection in online social networks","authors":"Yan Zhu, Zexing Hu, Huaixi Wang, Hongxin Hu, Gail-Joon Ahn","doi":"10.4108/ICST.COLLABORATECOM.2010.52","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.52","url":null,"abstract":"With the wide use of online social networks (OSNs), the problem of data privacy has attracted much attention. Several approaches have been proposed to address this issue. One of privacy management approaches for OSN leverages a key management technique to enable a user to simply post encrypted contents so that only users who can satisfy the associate security policy can derive the key to access the data. However, the key management policies of existing schemes may grant access to unaurhorized users and cannot efficiently determine authorized users. In this paper, we propose a collaborative framework which enforces access control for OSN through an innovative key management focused on communities. This framework introduces a community key management based on a new group-oriented convergence cryptosystem, as well as provides an efficient privacy preservation needed in a private OSN. To prove the feasibility of our approach, we also discuss a proof-of-concept implementation of our framework. Experimental results show that our construction can achieve the identified design goals for OSNs with the acceptable performance.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"374 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122348853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-01DOI: 10.4108/ICST.TRUSTCOL.2010.1
Ruoyu Wu, Gail-Joon Ahn, Hongxin Hu, M. Singhal
Cloud computing is an emerging computing paradigm where computing resources are provided as services over Internet while residing in a large data center. Even though it enables us to dynamically provide servers with the ability to address a wide range of needs, this paradigm brings forth many new challenges for the data security and access control as users outsource their sensitive data to clouds, which are beyond the same trusted domain as data owners. A fundamental problem is the existence of insecure information flows due to the fact that a service provider can access multiple virtual machines in clouds. Sensitive information may be leaked to unauthorized customers and such critical information flows could raise conflict-of-interest issues in cloud computing. In this paper, we propose an approach to enforce the information flow policies at Infrastructure-as-a-Service (IaaS) layer in a cloud computing environment. Especially, we adopt Chinese Wall policies to address the problems of insecure information flow. We implement a proof-of-concept prototype system based on Eucalyptus open source packages to show the feasibility of our approach. This system facilitates the cloud management modules to resolve the conflict-of-interest issues for service providers in clouds.
{"title":"Information flow control in cloud computing","authors":"Ruoyu Wu, Gail-Joon Ahn, Hongxin Hu, M. Singhal","doi":"10.4108/ICST.TRUSTCOL.2010.1","DOIUrl":"https://doi.org/10.4108/ICST.TRUSTCOL.2010.1","url":null,"abstract":"Cloud computing is an emerging computing paradigm where computing resources are provided as services over Internet while residing in a large data center. Even though it enables us to dynamically provide servers with the ability to address a wide range of needs, this paradigm brings forth many new challenges for the data security and access control as users outsource their sensitive data to clouds, which are beyond the same trusted domain as data owners. A fundamental problem is the existence of insecure information flows due to the fact that a service provider can access multiple virtual machines in clouds. Sensitive information may be leaked to unauthorized customers and such critical information flows could raise conflict-of-interest issues in cloud computing. In this paper, we propose an approach to enforce the information flow policies at Infrastructure-as-a-Service (IaaS) layer in a cloud computing environment. Especially, we adopt Chinese Wall policies to address the problems of insecure information flow. We implement a proof-of-concept prototype system based on Eucalyptus open source packages to show the feasibility of our approach. This system facilitates the cloud management modules to resolve the conflict-of-interest issues for service providers in clouds.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"4 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126529290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.9
H. Ramampiaro, D. Cruzes, R. Conradi, Manoel G. Mendonça
The number of scientific publications is constantly increasing, and the results published on Empirical Software Engineering are growing even faster. Some software engineering publishers have began to collaborate with research groups to make available repositories of software engineering empirical data. However, these initiatives are limited due to issues related to the available search tools. As a result, many researchers in the area have adopted a semi-automated approach for performing searches for systematic reviews as a mean to extract empirical evidence from published material. This makes this activity labor intensive and error prone. In this paper, we argue that the use of techniques from information retrieval, as well as text mining, can support systematic reviews and improve the creation of repositories of SE empirical evidence.
{"title":"Supporting evidence-based Software Engineering with collaborative information retrieval","authors":"H. Ramampiaro, D. Cruzes, R. Conradi, Manoel G. Mendonça","doi":"10.4108/ICST.COLLABORATECOM.2010.9","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.9","url":null,"abstract":"The number of scientific publications is constantly increasing, and the results published on Empirical Software Engineering are growing even faster. Some software engineering publishers have began to collaborate with research groups to make available repositories of software engineering empirical data. However, these initiatives are limited due to issues related to the available search tools. As a result, many researchers in the area have adopted a semi-automated approach for performing searches for systematic reviews as a mean to extract empirical evidence from published material. This makes this activity labor intensive and error prone. In this paper, we argue that the use of techniques from information retrieval, as well as text mining, can support systematic reviews and improve the creation of repositories of SE empirical evidence.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125943026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.45
Yao Zhao, Xin Wang, Jin Zhao, A. Lim
The objective of many applications with the surveillance missions in wireless sensor networks is to provide long-term monitoring of the specific environments, such as disaster-hit regions. These applications usually perform continuous monitoring without any maintenance, even if some sensor nodes fail. A significant challenge when designing the data collection approaches for such systems is that the conventional communication protocols for wireless sensor networks would present low efficiency, since the network topology changes rapidly due to the node failure. Thus the sensor nodes in such systems should use an automatic transmission approach to disseminate their sensed data to the sink in a distributed manner. In this paper, we propose a novel Coding-based Probabilistic Routing (CPR) to address this specific problem of data collection for distributed surveillance sensor networks in disaster-hit regions. CPR dynamically adapts to node failure to collect the maximum data in any given time and chooses an optimal probabilistic routing to decrease the transmission consumption. The extensive simulation results are presented to show that CPR outperforms other strategies.
{"title":"Data collection for distributed surveillance sensor networks in disaster-hit regions","authors":"Yao Zhao, Xin Wang, Jin Zhao, A. Lim","doi":"10.4108/ICST.COLLABORATECOM.2010.45","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.45","url":null,"abstract":"The objective of many applications with the surveillance missions in wireless sensor networks is to provide long-term monitoring of the specific environments, such as disaster-hit regions. These applications usually perform continuous monitoring without any maintenance, even if some sensor nodes fail. A significant challenge when designing the data collection approaches for such systems is that the conventional communication protocols for wireless sensor networks would present low efficiency, since the network topology changes rapidly due to the node failure. Thus the sensor nodes in such systems should use an automatic transmission approach to disseminate their sensed data to the sink in a distributed manner. In this paper, we propose a novel Coding-based Probabilistic Routing (CPR) to address this specific problem of data collection for distributed surveillance sensor networks in disaster-hit regions. CPR dynamically adapts to node failure to collect the maximum data in any given time and chooses an optimal probabilistic routing to decrease the transmission consumption. The extensive simulation results are presented to show that CPR outperforms other strategies.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115033516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.50
Yasushi Shinjo, D. Kamikawa, Akira Sato
This paper describes how users can collaborate through sharing personal protected Web resources. Personal protected Web resources are Web pages and services that are typically password-protected. One example is a personal page on an auction site. This paper introduces capability-based access control to the World Wide Web without modifying existing servers and clients. Access rights for personal protected Web resources are represented as capabilities for the Web resources. When users collaborate, capability-based access control on the Web has two advantages over conventional access-control-list based access control. First, a user can easily pass his/her own capabilities to access Web resources to other users along with delegating tasks. For example, a parent can ask a child to bid on a PC on behalf of the parent by passing the capability to access the parent's auction page but not giving the child the password. Second, restricted capabilities are useful in passing access rights. For example, before a parent passes the capability to bid on a PC to a child, the parent can create a restricted capability that allows biding up to $100 on a PC from the original unlimited capability. The proposed method has been implemented as Web applications called CapaEdit and CapaGate in Java by using the Google Web Toolkit. Using CapaEdit, a user can interactively create a capability to access his/her personal protected Web resources with access control to hyperlinks and form parameters. The receiver of the capability can access the Web resources through CapaGate, which enforces the restrictions. Experimental results show that these Web applications perform well enough for interactive use.
{"title":"Collaboration by passing access rights for personal protected Web resources","authors":"Yasushi Shinjo, D. Kamikawa, Akira Sato","doi":"10.4108/ICST.COLLABORATECOM.2010.50","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.50","url":null,"abstract":"This paper describes how users can collaborate through sharing personal protected Web resources. Personal protected Web resources are Web pages and services that are typically password-protected. One example is a personal page on an auction site. This paper introduces capability-based access control to the World Wide Web without modifying existing servers and clients. Access rights for personal protected Web resources are represented as capabilities for the Web resources. When users collaborate, capability-based access control on the Web has two advantages over conventional access-control-list based access control. First, a user can easily pass his/her own capabilities to access Web resources to other users along with delegating tasks. For example, a parent can ask a child to bid on a PC on behalf of the parent by passing the capability to access the parent's auction page but not giving the child the password. Second, restricted capabilities are useful in passing access rights. For example, before a parent passes the capability to bid on a PC to a child, the parent can create a restricted capability that allows biding up to $100 on a PC from the original unlimited capability. The proposed method has been implemented as Web applications called CapaEdit and CapaGate in Java by using the Google Web Toolkit. Using CapaEdit, a user can interactively create a capability to access his/her personal protected Web resources with access control to hyperlinks and form parameters. The receiver of the capability can access the Web resources through CapaGate, which enforces the restrictions. Experimental results show that these Web applications perform well enough for interactive use.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.18
S. Braghin, E. Ferrari, Alberto Trombetta
Protection of On-line Social Networks (OSNs) resources has become a primary need since today OSNs are the hugest repository of personal information on the Web. This has resulted in the definition of some access control models tailored to the protection of OSN resources. One of the key parameter on which access control decisions in OSNs should be based is represented by the trust between OSN users. A well-known approach for the management of trust relationships is represented by trust negotiations. In this paper, we show how access control and trust negotiation can be combined in a framework for the protection of OSN resources. Moreover, we show how the outcome of a trust negotiation can be exploited to dynamically adjust the trust level between OSN users.
{"title":"Combining access control and trust negotiations in an On-line Social Network","authors":"S. Braghin, E. Ferrari, Alberto Trombetta","doi":"10.4108/ICST.COLLABORATECOM.2010.18","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.18","url":null,"abstract":"Protection of On-line Social Networks (OSNs) resources has become a primary need since today OSNs are the hugest repository of personal information on the Web. This has resulted in the definition of some access control models tailored to the protection of OSN resources. One of the key parameter on which access control decisions in OSNs should be based is represented by the trust between OSN users. A well-known approach for the management of trust relationships is represented by trust negotiations. In this paper, we show how access control and trust negotiation can be combined in a framework for the protection of OSN resources. Moreover, we show how the outcome of a trust negotiation can be exploited to dynamically adjust the trust level between OSN users.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130173956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.32
Anwitaman Datta
In this (invited) paper, we present a work in progress social library and reference management system called SoJa (Social Jabref), which is realized on top of a decentralized (peer-to-peer) social information system. The contribution of the work is multi-fold. It provides a platform to collaborate and socialize to carry out a specific task (managing and sharing bibliographic meta-information). From systems design perspective, it is an effort to realize social software on a peer-to-peer infrastructure, as well as make such a peer-to-peer system robust and reliable by leveraging on the social network. Particularly, we discuss how (we think) social networks can be leveraged to build reliable indexing, routing and storage services. We elaborate on the SocialCircle DHT which exclusively uses social links, and hence is expected to be naturally robust against various kinds of attacks. We also discuss several open challenges currently under investigation, which need to be addressed to build mature systems that can be deployed at large-scale. Furthermore, while not the principal focus of this specific work, the experiences in realizing SoJa are also directly relevant to the recent spate of work on realizing decentralized online social networks (DOSNs).
{"title":"SoJa: Collaborative reference management using a decentralized social information system","authors":"Anwitaman Datta","doi":"10.4108/ICST.COLLABORATECOM.2010.32","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.32","url":null,"abstract":"In this (invited) paper, we present a work in progress social library and reference management system called SoJa (Social Jabref), which is realized on top of a decentralized (peer-to-peer) social information system. The contribution of the work is multi-fold. It provides a platform to collaborate and socialize to carry out a specific task (managing and sharing bibliographic meta-information). From systems design perspective, it is an effort to realize social software on a peer-to-peer infrastructure, as well as make such a peer-to-peer system robust and reliable by leveraging on the social network. Particularly, we discuss how (we think) social networks can be leveraged to build reliable indexing, routing and storage services. We elaborate on the SocialCircle DHT which exclusively uses social links, and hence is expected to be naturally robust against various kinds of attacks. We also discuss several open challenges currently under investigation, which need to be addressed to build mature systems that can be deployed at large-scale. Furthermore, while not the principal focus of this specific work, the experiences in realizing SoJa are also directly relevant to the recent spate of work on realizing decentralized online social networks (DOSNs).","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132192857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.43
D. Wolinsky, Kyungyong Lee, P. Boykin, R. Figueiredo
Decentralized and P2P (peer-to-peer) VPNs (virtual private networks) have recently become quite popular for connecting users in small to medium collaborative environments, such as academia, businesses, and homes. In the realm of VPNs, there exist centralized, decentralized, and P2P solutions. Centralized systems require a single entity to provide and manage VPN server(s); decentralized approaches allow more than one entity to share the management responsibility for the VPN infrastructure, while existing P2P approaches rely on a centralized infrastructure but allow users to bypass it to form direct low-latency, high-throughput links between peers. In this paper, we describe a novel VPN architecture that can claim to be both decentralized and P2P, using methods that lower the entry barrier for VPN deployment compared to other VPN approaches. Our solution extends existing work on IP-over-P2P (IPOP) overlay networks to address challenges of configuration, management, bootstrapping, and security. We present the first implementation and analysis of a P2P system secured by DTLS (datagram transport layer security) along with decentralized techniques for revoking user access.
{"title":"On the design of autonomic, decentralized VPNs","authors":"D. Wolinsky, Kyungyong Lee, P. Boykin, R. Figueiredo","doi":"10.4108/ICST.COLLABORATECOM.2010.43","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.43","url":null,"abstract":"Decentralized and P2P (peer-to-peer) VPNs (virtual private networks) have recently become quite popular for connecting users in small to medium collaborative environments, such as academia, businesses, and homes. In the realm of VPNs, there exist centralized, decentralized, and P2P solutions. Centralized systems require a single entity to provide and manage VPN server(s); decentralized approaches allow more than one entity to share the management responsibility for the VPN infrastructure, while existing P2P approaches rely on a centralized infrastructure but allow users to bypass it to form direct low-latency, high-throughput links between peers. In this paper, we describe a novel VPN architecture that can claim to be both decentralized and P2P, using methods that lower the entry barrier for VPN deployment compared to other VPN approaches. Our solution extends existing work on IP-over-P2P (IPOP) overlay networks to address challenges of configuration, management, bootstrapping, and security. We present the first implementation and analysis of a P2P system secured by DTLS (datagram transport layer security) along with decentralized techniques for revoking user access.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128835595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：