Externalities and stability in social cloud
01 Nov 2014-pp 1-6
TL;DR: A pairwise resource (or pairwise service) sharing social network model is presented to explore the interdependence between social structure and resource (service) availability for an individual user or player and investigates effects of social structure on individual resource availability.
Abstract: Social Clouds have been gaining importance because of their potential for efficient and stable resource sharing without any (monetary) cost implications . There is a need, however, to look at how a social structure or relationship evolves to build a Social Cloud (by identifying factors that affect the social structure) and how social structure impacts individual resource sharing behavior. This paper presents a pairwise resource (or pairwise service) sharing social network model to explore the interdependence between social structure and resource (service) availability for an individual user or player. The paper also investigates effects of social structure on individual resource availability. Further, the paper analyzes positive and negative externalities, and aims to characterize stable social clouds.
Citations
More filters
TL;DR: In this article, the impact of link formation between a pair of agents on the resource availability of other agents in a social cloud network, a special case of end-to-end networks, is investigated.
Abstract: This paper investigates the impact of link formation between a pair of agents on the resource availability of other agents (that is, externalities) in a social cloud network, a special case of endo...
4 citations
Posted Content•
TL;DR: In this article, the authors investigated the impact of link formation between a pair of agents on the resource availability of other agents (that is, externalities) in a social cloud network, a special case of endogenous sharing economy networks.
Abstract: This paper investigates the impact of link formation between a pair of agents on the resource availability of other agents (that is, externalities) in a social cloud network, a special case of endogenous sharing economy networks. Specifically, we study how the closeness between agents and the network size affect externalities.
We conjecture, and experimentally support, that for an agent to experience positive externalities, an increase in its closeness is necessary. The condition is not sufficient though. We, then, show that for populated ring networks, one or more agents experience positive externalities due to an increase in the closeness of agents. Further, the initial distance between agents forming a link has a direct bearing on the number of beneficiaries, and the number of beneficiaries is always less than that of non-beneficiaries.
2 citations
Posted Content•
25 Nov 2018
TL;DR: It is shown that network density is inversely proportional to positive externalities, and further, it plays a crucial role in determining the kind of externalities.
Abstract: This paper investigates the impact of link formation between a pair of agents on resource availability of other agents in a social cloud network, which is a special case of socially-based resource sharing systems. Specifically, we study the correlation between externalities, network size, and network density.
We first conjecture and experimentally support that if an agent experiences positive externalities, then its closeness (harmonic centrality measure) should increase. Next, we show the following for ring networks: in less populated networks no agent experiences positive externalities; in more populated networks a set of agents experience positive externalities, and larger the distance between agents forming a link, more the number of beneficiaries; and the number of beneficiaries is always less than the number of non-beneficiaries. Finally, we show that network density is inversely proportional to positive externalities, and further, it plays a crucial role in determining the kind of externalities.
1 citations
TL;DR: In this paper , the authors considered the social cloud as an endogenous resource-sharing network, where agents are involved in closeness-based conditional resource sharing and studied the impact of agents' decisions of link addition and deletion on their own local and global resource availability as well as on others' global resources availability.
Abstract: Social cloud has emerged as a case of sharing economy, where socially connected agents share their computing resources within the community. This paper considers the social cloud as an endogenous resource-sharing network, where agents are involved in closeness-based conditional resource sharing. This study focuses on (1) the impact of agents' decisions of link addition and deletion on their own local and global resource availability as well as on others' global resource availability (as spillover effects), (2) the role of agents' closeness in determining spillover effects, (3) agents' link addition behavior, and (4) stability and efficiency of the social cloud. The findings include the following: (i) Agents' decision of link addition (deletion) increases (decreases) their local resource availability. However, these observations do not hold in the case of global resource availability. (ii) In a connected network, agents experience either a positive or a negative spillover effect and there is no case with no spillover effects. Agents observe no spillover effects if and only if the network is disconnected with three or more components. Furthermore, an agent experiences negative spillover if there is no change in its closeness. Although an increase in the closeness of agents is necessary to experience positive spillover effects, the condition is not sufficient. (iii) We study the relation between agents' distance from each other, and their local as well as global resource availabilities. We prove that the local resource availability of an agent from another agent increases with decrease in the distance between them and that maximum local resource availability is obtained from the agent with the least closeness. Using these results, we discuss which agent to add a link to, so as to maximize the local resource availability. We discuss why such results are difficult to establish for global resource availability. However, in a two-diameter network, we show that for an agent, link formation always increases the global resource availability. (iv) We also study resource-sharing network formation and its efficiency in a strategic setting. We prove the existence of a pairwise stable network. Furthermore, we provide a set of conditions for a few prominent network structures (star, complete, wheel, and bipartite networks) to be pairwise stable. We show that the “connected in pairs, otherwise disconnected” network is better than a connected network, in terms of social welfare.
Posted Content•
TL;DR: In this article, the authors investigate the impact of link addition and deletion on local and global resource availability, and analyze spillover effects in terms of the impact between a pair of agents on others' utility.
Abstract: This paper focuses on social cloud formation, where agents are involved in a closeness-based conditional resource sharing and build their resource sharing network themselves The objectives of this paper are: (1) to investigate the impact of agents' decisions of link addition and deletion on their local and global resource availability, (2) to analyze spillover effects in terms of the impact of link addition between a pair of agents on others' utility, (3) to study the role of agents' closeness in determining what type of spillover effects these agents experience in the network, and (4) to model the choices of agents that suggest with whom they want to add links in the social cloud The findings include the following Firstly, agents' decision of link addition (deletion) increases (decreases) their local resource availability However, these observations do not hold in the case of global resource availability Secondly, in a connected network, agents experience either positive or negative spillover effect and there is no case with no spillover effects Agents observe no spillover effects if and only if the network is disconnected and consists of more than two components (sub-networks) Furthermore, if there is no change in the closeness of an agent (not involved in link addition) due to a newly added link, then the agent experiences negative spillover effect Although an increase in the closeness of agents is necessary in order to experience positive spillover effects, the condition is not sufficient By focusing on parameters such as closeness and shortest distances, we provide conditions under which agents choose to add links so as to maximise their resource availability
References
More filters
08 May 2013
TL;DR: It is concluded that whereas graphs known in the literature for high trust properties do not serve distributed trusted computing algorithms, such as Sybil defenses-for their weak algorithmic properties, such graphs are good candidates for the SocialCloud paradigm for their self-load-balancing features.
Abstract: We investigate a new computing paradigm, called SocialCloud, in which computing nodes are governed by social ties driven from a bootstrapping trust-possessing social graph. We investigate how this paradigm differs from existing computing paradigms, such as grid computing and the conventional cloud computing paradigms. We show that incentives to adopt this paradigm are intuitive and natural, and security and trust guarantees provided by it are solid. We propose metrics for measuring the utility and advantage of this computing paradigm, and using real-world social graphs and structures of social traces; we investigate the potential of this paradigm for ordinary users. We study several design options and trade-offs, such as scheduling algorithms, centralization, and straggler handling, and show how they affect the utility of the paradigm. Interestingly, we conclude that whereas graphs known in the literature for high trust properties do not serve distributed trusted computing algorithms, such as Sybil defenses---for their weak algorithmic properties, such graphs are good candidates for our paradigm for their self-load-balancing features.
28 citations
01 Nov 2012
TL;DR: A Cloud Resource Bartering model (CRB-model) for sharing user's computational resources through a social network to create a social cloud (SC) so that users can share their part of the cloud with their social community.
Abstract: Cloud computing is a model for enabling convenient, ubiquitous and on-demand network access to a shared pool of configurable computing resources (e.g. storage, applications, and networks) that can be provisioned with minimal management effort. Despite all these benefits, the sharing of resources with other users is a challenge, cloud providers do not commonly facilitate users in sharing their dedicated resources with others. In developing countries it is often too expensive for people to acquire a virtual machine of their own. Users may therefore wish to manage costs and increase computational resource usage by sharing their instances with others. Sadly it is not easy to do this at present. Social networks provide a structure that allows users to interact and share resources (e.g. pictures and videos) on the basis of a trustworthy relationship (e.g. Friendship). This paper highlights a Cloud Resource Bartering model (CRB-model) for sharing user's computational resources through a social network. In our approach we have linked a social network with the computational cloud to create a social cloud (SC) so that users can share their part of the cloud with their social community. A prototype system has been deployed on a social network by using the bartering resource trading mechanism. It is anticipated that this may help users to share their dedicated resources without the need for money changing hands and different communities.
17 citations
17 Dec 2009
TL;DR: The security challenges posed by SocialClouds are discussed, the security architecture is presented, and two CryptoOverlay primitives, called assembly signature and identification schemes, are proposed.
Abstract: Cloud computing is an emerging paradigm of computing. In the past, two types of cloud computing systems have been discussed, PublicClouds (i.e., vendors making revenue by offering cloud computing services to the public) and PrivateClouds (i.e., enterprises' datacenters serving their own needs but not to the public). In this paper, we envision a third type of cloud computing systems, called SocialClouds. In a SocialCloud, the computing platforms (including hardware, software, and applications) are induced by trust-based social relationships (e.g., the platforms are contributed by a large population of people who are nodes/vertices in a trust- or friendship-based, possibly implicit, social network). We discuss the security challenges posed by SocialClouds, and present a security architecture. We further elaborate on the access control component of the security architecture, and advocate an instantiation through a cryptographic architecture we call CryptoOverlay. To illustrate the utility of this concept, we also propose two CryptoOverlay primitives, called assembly signature and identification schemes.
16 citations