3 pages, presented at the 1st International Workshop for Languages for Distributed Algorithms (LADA-2012), Philadelphia, USA, 23-24 January 2012, co-located with POPL 2012: 39th ACM SIGPLAN-SIGACT Symp. on Principles of Programming LanguagesThe growing limitations of traditional social networks have prompted work on novel and fully decentralised alternatives to implement on-line social applications. To realise these decentralised social networks, gossip protocols appear as a natural solution, as they intrinsically tend to be highly resilient, efficient, and scalable. Existing gossip-based social networks have however so far been limited to simple use-cases, that typically take a uniform view of users, peers, and the data they hold. To progr...
International audience1 Decentralized social networks have attracted the attention of a large number...
Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that...
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness ma...
3 pages, presented at the 1st International Workshop for Languages for Distributed Algorithms (LADA-...
The past decade has witnessed a dramatic shift in the way the Web is used. The internet has entered ...
International audienceAlthough the principles of gossip protocols are relatively easy to grasp, thei...
The 1st Workshop on Social Networks and Distributed Systems (SNDS 2010)International audienceSocial ...
International audienceWhile social networks provide news from old buddies, ...
Social networking Web sites, which allow users to create identities and link them to friends who hav...
The so-called Web 2.0 revolution has fundamentally changed the way people interact with the Internet...
Most proposed gossip-based systems use an ad-hoc design. We observe a low degree of reutilization am...
Centralized online Social networks such as Facebook are highly popular [1]. Despite their success, a...
Centralized online Social networks such as Facebook are highly popular [1]. Despite their success, ...
A large number of gossip protocols have been developed in the last few years to address a wide range...
International audiencehe pervasiveness of the Internet has lead research and applications to focus m...
International audience1 Decentralized social networks have attracted the attention of a large number...
Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that...
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness ma...
3 pages, presented at the 1st International Workshop for Languages for Distributed Algorithms (LADA-...
The past decade has witnessed a dramatic shift in the way the Web is used. The internet has entered ...
International audienceAlthough the principles of gossip protocols are relatively easy to grasp, thei...
The 1st Workshop on Social Networks and Distributed Systems (SNDS 2010)International audienceSocial ...
International audienceWhile social networks provide news from old buddies, ...
Social networking Web sites, which allow users to create identities and link them to friends who hav...
The so-called Web 2.0 revolution has fundamentally changed the way people interact with the Internet...
Most proposed gossip-based systems use an ad-hoc design. We observe a low degree of reutilization am...
Centralized online Social networks such as Facebook are highly popular [1]. Despite their success, a...
Centralized online Social networks such as Facebook are highly popular [1]. Despite their success, ...
A large number of gossip protocols have been developed in the last few years to address a wide range...
International audiencehe pervasiveness of the Internet has lead research and applications to focus m...
International audience1 Decentralized social networks have attracted the attention of a large number...
Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that...
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness ma...