The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Preference Clustering Protocol for Large-Scale Multicast Applications
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Channelization Problem in Large Scale Data Dissemination
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
On Small World Graphs in Non-uniformly Distributed Key Spaces
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Applicability of group communication for increased scalability in MMOGs
NetGames '06 Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Live Distributed Objects: Enabling the Active Web
IEEE Internet Computing
Hyperspaces for object clustering and approximate matching in peer-to-peer overlays
HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
Feedback effects between similarity and social influence in online communities
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Watching television over an IP network
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Modeling channel popularity dynamics in a large IPTV system
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Dr. multicast: Rx for data center communication scalability
Proceedings of the 5th European conference on Computer systems
Wooki: a P2P wiki-based collaborative writing tool
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Oscar: small-world overlay for realistic key distributions
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Towards robust and scalable peer-to-peer social networks
Proceedings of the Fifth Workshop on Social Network Systems
Distributed spectral cluster management: a method for building dynamic publish/subscribe systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Locality-Awareness in a peer-to-peer publish/subscribe network
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
A generalized algorithm for publish/subscribe overlay design and its fast implementation
DISC'12 Proceedings of the 26th international conference on Distributed Computing
PolderCast: fast, robust, and scalable architecture for P2P topic-based pub/sub
Proceedings of the 13th International Middleware Conference
DYNATOPS: a dynamic topic-based publish/subscribe architecture
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay networks. The key pre-requisite for supporting these types of applications on top of the overlays is efficient distribution of messages to multiple subscribers dispersed across numerous multicast groups. In this paper, we introduce Magnet: a peer-to-peer publish/subscribe system which achieves efficient message distribution by dynamically organizing peers with similar subscriptions into dissemination structures which preserve locality in the subscription space. Magnet is able to significantly reduce the message propagation costs by taking advantage of subscription correlations present in many large-scale group-based applications. We evaluate Magnet by comparing its performance against a strawman pub/sub system which does not cluster similar subscriptions by simulation. We find that Magnet outperforms the strawman by a substantial margin on clustered subscription workloads produced using both generative models and real application traces.