Special Interest Messaging: A Comparison of IGM Approaches

Hundreds of technical, special interest Internet weblogs are already generating thousands of niche articles worldwide, and many institutions are starting to create internal blogs for team collaboration. As this style of communication becomes more pervasive in the lives of employees and researchers, the difficulty of finding relevant information only grows with the number of authors and articles. To reduce the load, we propose using implicit group messaging (IGM) to automatically deliver relevant content to readers grouped by shared characteristics or interests. In this paper, we outline a context-aware application suited to special interest messaging and describe three alternative delivery models including our peer-to-peer (P2P) design called SPICE and a broker-based design. We investigate the advantages and disadvantages of each approach through detailed simulations driven by realistic data and actual national/global network topologies. We find that although a broker-based design is generally the most network efficient and lowest latency, a structured P2P system can offer exceptionally low and fair loading across peers and network links without relying on specialized broker nodes.

[1]  Bernardo A. Huberman,et al.  Usage patterns of collaborative tagging systems , 2006, J. Inf. Sci..

[2]  Omprakash D. Gnawali.  A Keyword-Set Search System for Peer-to-Peer Networks , 2002 .

[3]  Ali F. Farhoomand,et al.  Managerial information overload , 2002, CACM.

[4]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[5]  Spice : implicit group messaging on Ice , 2007 .

[6]  Peter Druschel,et al.  FeedTree: Sharing Web Micronews with Peer-to-Peer Event Notification , 2005, IPTPS.

[7]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[8]  Alf-Christian Ortyl Paul Achilles,et al.  The Collection of Computer Science Bibliographies , 1995 .

[9]  Teresa Chambel,et al.  Concepts and Architecture for Loosely Coupled Integration of Hyperbases , 1994 .

[10]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[11]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[12]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[13]  M. Zancanaro,et al.  Group Communication for Real-time Role Coordination and Ambient Intelligence , 2003 .

[14]  Wolfgang Nejdl,et al.  Search strategies for scientific collaboration networks , 2005, P2PIR '05.

[15]  Leandro Navarro-Moldes,et al.  P2P architecture for scientific collaboration , 2004, 13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises.

[16]  Sven Buchholz,et al.  Modeling of Context Information for Pervasive Computing Applications , 2002 .

[17]  Hector Garcia-Molina,et al.  The SIFT information dissemination system , 1999, TODS.

[18]  Robbert van Renesse,et al.  SelectCast: a scalable and self-repairing multicast overlay routing facility , 2003, SSRS '03.

[19]  David M. Nicol,et al.  Simulation of large scale networks II: development of an internet backbone topology for large-scale network simulations , 2003, WSC '03.

[20]  Claudia Linnhoff-Popien,et al.  A Context Modeling Survey , 2004 .

[21]  Charlie Lindahl,et al.  Weblogs: Simplifying Web Publishing , 2003, Computer.

[22]  Amin Vahdat,et al.  Efficient Peer-to-Peer Keyword Searching , 2003, Middleware.

[23]  Partha Dasgupta,et al.  Peer-to-peer communities: architecture, information and trust management , 2003 .

[24]  Theoni Pitoura,et al.  Replication, Load Balancing and Efficient Range Query Processing in DHTs , 2006, EDBT.

[25]  A. Quigley,et al.  The long Interesting Tail of indie TV , 2006 .

[26]  Gregory D. Abowd,et al.  A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of Context-Aware Applications , 2001, Hum. Comput. Interact..

[27]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[28]  Katherine L. Morse,et al.  Interest Management in Large-Scale Distributed Simulations , 1996 .

[29]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[30]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[31]  Steffen Staab,et al.  Bibster - A Semantics-Based Bibliographic Peer-to-Peer System , 2004, SEMWEB.

[32]  Aaron J. Quigley,et al.  Implicit Group Messaging over Peer-to-Peer Networks , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[33]  Guangwen Yang,et al.  Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning , 2004, IPTPS.

[34]  Tony Hammond,et al.  Social Bookmarking Tools (II): A Case Study - Connotea , 2005, D Lib Mag..