ACM Computing Surveys (CSUR)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Communications of the ACM
An end-user perspective on file-sharing systems
Communications of the ACM
Exactly-once Delivery in a Content-based Publish-Subscribe System
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
On the bursty evolution of blogspace
WWW '03 Proceedings of the 12th international conference on World Wide Web
A scalable content-addressable network
A scalable content-addressable network
Weblogs: Simplifying Web Publishing
Computer
Peer-to-peer communities: architecture, information and trust management
Peer-to-peer communities: architecture, information and trust management
Blogging as social activity, or, would you let 900 million people read your diary?
CSCW '04 Proceedings of the 2004 ACM conference on Computer supported cooperative work
SelectCast: a scalable and self-repairing multicast overlay routing facility
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
Information diffusion through blogspace
ACM SIGKDD Explorations Newsletter
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Mirinae: A peer-to-peer overlay network for large-scale content-based publish/subscribe systems
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
Keyword Search in DHT-Based Peer-to-Peer Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Implicit Group Messaging over Peer-to-Peer Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
Implicit group messaging (IGM) is a decoupled messaging paradigm for connecting content publishers and consumers over the Internet. Unlike traditional multicast or publish/subscribe messaging, IGM delivers content to ''implicit groups'' of consumers with characteristics specified by the publisher at the time of publication. IGM systems must support thousands of users and an infinite number of implicit groups formed on demand as messages are published. These groups may be messaged repeatedly or once only, with group sizes scaling from no members to the entire network. Load distribution is a key problem of such systems. This paper broadens our earlier work [D. Cutting, B. Landfeldt, A. Quigley, Implicit group messaging over peer-to-peer networks, in: A. Montresor, A. Wierzbicki, N. Shahmehri (Eds.), Sixth IEEE International Conference on Peer-to-Peer Computing (P2P2006), IEEE Computer Society, Cambridge, United Kingdom, September 2006, pp. 125-132.] in three ways: we provide a formal specification of implicit groups and implicit group messaging; we introduce a comprehensive framework for analysing the efficiency and fairness of generic IGM implementations; and our distributed structured peer-to-peer IGM model, Spice, is augmented with adaptive load distribution techniques. Through detailed simulation and analysis using Zipfian data sources we demonstrate these techniques are capable of very fairly distributing incoming and outgoing loads over peers irrespective of the scale of implicit groups or frequency of messages.