SETI@home: an experiment in public-resource computing
Communications of the ACM
Towards Trust-Aware Resource Management in Grid Computing Systems
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Scientific Cloud Computing: Early Definition and Experience
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
Membership-concealing overlay networks
Proceedings of the 16th ACM conference on Computer and communications security
Social Cloud: Cloud Computing in Social Networks
CLOUD '10 Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing
Privacy-preserving P2P data sharing with OneSwarm
Proceedings of the ACM SIGCOMM 2010 conference
MOON: MapReduce On Opportunistic eNvironments
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Nebulas: using distributed voluntary resources to build clouds
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Early experience with the distributed nebula cloud
Proceedings of the fourth international workshop on Data-intensive distributed computing
Exploring MapReduce efficiency with highly-distributed data
Proceedings of the second international workshop on MapReduce and its applications
Collaborative eResearch in a Social Cloud
ESCIENCE '11 Proceedings of the 2011 IEEE Seventh International Conference on eScience
A Social Cloud for Public eResearch
ESCIENCE '11 Proceedings of the 2011 IEEE Seventh International Conference on eScience
WebCloud: Recruiting Social Network Users to Assist in Content Distribution
NCA '12 Proceedings of the 2012 IEEE 11th International Symposium on Network Computing and Applications
On the mixing time of directed social graphs and security implications
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications
Proceedings of the 29th Annual Computer Security Applications Conference
| Hi-index | 0.00 |
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.