Advanced

SPICE: Scalable P2P implicit group messaging

Cutting, Daniel; Quigley, Aaron and Landfeldt, Björn LU (2008) In Computer Communications 31(3). p.437-451
Abstract
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
publishing date
type
Contribution to journal
publication status
published
subject
in
Computer Communications
volume
31
issue
3
pages
437 - 451
publisher
Elsevier
external identifiers
  • scopus:38549125131
ISSN
0140-3664
DOI
10.1016/j.comcom.2007.08.026
language
English
LU publication?
no
id
234ebf04-8abf-411e-ba0d-2ddc4192dcd6 (old id 3173088)
date added to LUP
2012-11-19 15:07:07
date last changed
2017-08-27 04:34:34
@article{234ebf04-8abf-411e-ba0d-2ddc4192dcd6,
  abstract     = {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.},
  author       = {Cutting, Daniel and Quigley, Aaron and Landfeldt, Björn},
  issn         = {0140-3664},
  language     = {eng},
  number       = {3},
  pages        = {437--451},
  publisher    = {Elsevier},
  series       = {Computer Communications},
  title        = {SPICE: Scalable P2P implicit group messaging},
  url          = {http://dx.doi.org/10.1016/j.comcom.2007.08.026},
  volume       = {31},
  year         = {2008},
}