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
05 Jul 2010
TL;DR: This paper outlines the vision of, and experiences with, creating a Social Storage Cloud, looking specifically at possible market mechanisms that could be used to create a dynamic Cloud infrastructure in a Social network environment.
Abstract: With the increasingly ubiquitous nature of Social networks and Cloud computing, users are starting to explore new ways to interact with, and exploit these developing paradigms. Social networks are used to reflect real world relationships that allow users to share information and form connections between one another, essentially creating dynamic Virtual Organizations. We propose leveraging the pre-established trust formed through friend relationships within a Social network to form a dynamic“Social Cloud”, enabling friends to share resources within the context of a Social network. We believe that combining trust relationships with suitable incentive mechanisms (through financial payments or bartering) could provide much more sustainable resource sharing mechanisms. This paper outlines our vision of, and experiences with, creating a Social Storage Cloud, looking specifically at possible market mechanisms that could be used to create a dynamic Cloud infrastructure in a Social network environment.
213 citations
[...]
01 Jan 2001
TL;DR: Bayanihan as discussed by the authors is a web-based volunteer computing system that enables users to volunteer their computers by simply visiting a web page, which makes it possible to set up parallel computing networks in a matter of minutes compared to the hours, days, or weeks required by traditional NOW and metacomputing systems.
Abstract: This thesis presents the idea of volunteer computing , which allows high-performance parallel computing networks to be formed easily, quickly, and inexpensively by enabling ordinary Internet users to share their computers' idle processing power without needing expert help. In recent years, projects such as [email protected] have demonstrated the great potential power of volunteer computing. In this thesis, we identify volunteer, computing's further potentials, and show how these can be achieved.
We present the Bayanihan system for web-based volunteer computing. Using Java applets, Bayanihan enables users to volunteer their computers by simply visiting a web page. This makes it possible to set up parallel computing networks in a matter of minutes compared to the hours, days, or weeks required by traditional NOW and metacomputing systems. At the same time, Bayanihan provides a flexible object-oriented software framework that makes it easy for programmers to write various applications, and for researchers to address issues such as adaptive parallelism, fault-tolerance, and scalability.
Using Bayanihan, we develop a general-purpose runtime system and APIs, and show how volunteer computing's usefulness extends beyond solving esoteric mathematical problems to other, more practical, master-worker applications such as image rendering, distributed web-crawling, genetic algorithms, parametric analysis, and Monte Carlo simulations. By presenting a new API using the bulk synchronous parallel (BSP) model, we further show that contrary to popular belief and practice, volunteer computing need not be limited to master-worker applications, but can be used for coarse-grain message-passing programs as well.
Finally, we address the new problem of maintaining reliability in the presence of malicious volunteers. We present and analyze traditional techniques such as voting, and new ones such as spot-checking, encrypted computation, and periodic obfuscation. Then, we show, how these can be integrated in a new idea called credibility-based fault-tolerance, which uses probability estimates to limit and direct the use of redundancy. We validate this new idea with parallel Monte Carlo simulations, and show how it can achieve error rates several orders-of-magnitude smaller than traditional voting for the same slowdown. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
144 citations
01 Apr 2008
TL;DR: Today, it is common for users to own more than tens of gigabytes of digital pictures, videos, experimental traces, etc, and it is desirable to also seek off-site redundancies so that important data can survive threats such as natural disasters and operator mistakes.
Abstract: Today, it is common for users to own more than tens of gigabytes of digital pictures, videos, experimental traces, etc. Although many users already back up such data on a cheap second disk, it is desirable to also seek off-site redundancies so that important data can survive threats such as natural disasters and operator mistakes. Commercial online backup service is expensive [1, 11]. An alternative solution is to use a peer-to-peer storage system. However, existing cooperative backup systems are plagued by two long-standing problems [3, 4, 9, 19, 27]: enforcing minimal availability from participating nodes, and ensuring that nodes storing others' backup data will not deny restore service in times of need.
107 citations
"Externalities and stability in soci..." refers background in this paper
...FirendStore[9] , AmazingStore [10], Cassandra [11], Samasara [12]....
[...]
10 Oct 2011
TL;DR: It is shown that the problem of obtaining maximal availability while minimizing redundancy is NP-complete; in addition, an exploratory study on data placement strategies is performed, and their performance in terms of redundancy needed and availability obtained.
Abstract: Friend-to-friend networks, i.e. peer-to-peer networks where data are exchanged and stored solely through nodes owned by trusted users, can guarantee dependability, privacy and uncensorability by exploiting social trust. However, the limitation of storing data only on friends can come to the detriment of data availability: if no friends are online, then data stored in the system will not be accessible. In this work, we explore the tradeoffs between redundancy (i.e., how many copies of data are stored on friends), data placement (the choice of which friend nodes to store data on) and data availability (the probability of finding data online). We show that the problem of obtaining maximal availability while minimizing redundancy is NP-complete; in addition, we perform an exploratory study on data placement strategies, and we investigate their performance in terms of redundancy needed and availability obtained. By performing a trace-based evaluation, we show that nodes with as few as 10 friends can already obtain good availability levels.
56 citations
"Externalities and stability in soci..." refers background in this paper
...In [13], authors consider trustful P2P storage framework....
[...]
Proceedings Article•
27 Apr 2010TL;DR: In this article, the authors propose AmazingStore, a low-cost cloud storage system that provides high data availability while protecting against correlated failures, by augmenting centralized clouds with an efficient client-side storage system.
Abstract: "Cloud-based" Internet services rely on the availability and reliability of managed data centers. Recent events indicate that data centers tend to create centralized points of failure, and providing resilience to large-scale faults remains a significant challenge for both providers and users of cloud infrastructures. Running data centers also incurs high hard-ware and network costs, particularly for storage-intensive applications such as data synchronization and backup. In this paper, we show how to improve data availability while reducing costs in storage clouds, by augmenting centralized clouds with an efficient client-side storage system. We introduce AmazingStore, a low-cost cloud storage system that provides high data availability while protecting against correlated failures. We describe our initial experiences with an already deployed prototype and outline opportunities in this modified cloud model.
44 citations