This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)
Implicit Group Messaging over Peer-to-Peer Networks
Cambridge, United Kingdom
September 06-June 08
ISBN: 0-7695-2679-9
ASCII Text
x 
 
Daniel Cutting, Bjorn Landfeldt, Aaron Quigley, "Implicit Group Messaging over Peer-to-Peer Networks," Peer-to-Peer Computing, IEEE International Conference on, pp. 125-132, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/P2P.2006.20,
author = {Daniel Cutting and Bjorn Landfeldt and Aaron Quigley},
title = {Implicit Group Messaging over Peer-to-Peer Networks},
journal ={Peer-to-Peer Computing, IEEE International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2679-9},
pages = {125-132},
doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2006.20},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Peer-to-Peer Computing, IEEE International Conference on
TI - Implicit Group Messaging over Peer-to-Peer Networks
SN - 0-7695-2679-9
SP125
EP132
A1 - Daniel Cutting,
A1 - Bjorn Landfeldt,
A1 - Aaron Quigley,
PY - 2006
KW - null
VL - 0
JA - Peer-to-Peer Computing, IEEE International Conference on
ER -
 
Daniel Cutting, University of Sydney, Australia
Bjorn Landfeldt, University of Sydney, Australia
Aaron Quigley, University College Dublin, Ireland
We propose a decoupled distribution paradigm for connecting large numbers of content publishers and consumers called Implicit Group Messaging (IGM). Unlike traditional multicast or publish/subscribe messaging, IGM delivers content to "implicit groups" of consumers matching combinations of attributes specified by the publisher at the time of publication. The contributions of this paper include a characterisation of IGM encompassing the types of groups that must be supported, and an innovative distributed P2P implementation that we compare via simulation to a functionally equivalent client/server approach. Our results show the P2P model to efficiently support a range of implicit groups with acceptable delivery times and vastly less maximum peer and link stress than a client/server approach.
Citation:
Daniel Cutting, Bjorn Landfeldt, Aaron Quigley, "Implicit Group Messaging over Peer-to-Peer Networks," p2p, pp.125-132, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.