ACM Home Page
Please provide us with feedback. Feedback
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
Full text PdfPdf (393 KB)
Source ACM International Conference Proceeding Series; Vol. 233 archive
Proceedings of the 2007 inaugural international conference on Distributed event-based systems table of contents
Toronto, Ontario, Canada
SESSION: Peer-to-peer and mobility table of contents
Pages: 14 - 25  
Year of Publication: 2007
ISBN:978-1-59593-665-3
Authors
Gregory Chockler  IBM Haifa Research Laboratory
Roie Melamed  IBM Haifa Research Laboratory
Yoav Tock  IBM Haifa Research Laboratory
Roman Vitenberg  University of Oslo, Norway
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGMOD: ACM Special Interest Group on Management of Data
: IEEE
ACM: Association for Computing Machinery
: USENIX
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 79,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1266894.1266899
What is a DOI?

ABSTRACT

We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. SpiderCast is designed to effectively tread the balance between average overlay degree and communication cost of event dissemination. It employs a novel coverage-optimizing heuristic in which the nodes utilize partial subscription views (provided by a decentralized membership service) to reduce the average node degree while guaranteeing (with high probability) that the events posted on each topic can be routed solely through the nodes interested in this topic (in other words, the overlay is topic-connected). SpiderCast is unique in maintaining an overlay topology that scales well with the average number of topics a node is subscribed to, assuming the subscriptions are correlated insofar as found in most typical workloads. Furthermore, the degree grows logarithmically in the total number of topics, and slowly decreases as the number of nodes increases.

We show experimentally that, for many practical work-loads, the SpiderCast overlays are both topic-connected and have a low per-topic diameter while requiring each node to maintain a low average number of connections. These properties are satisfied even in very large settings involving up to 10,000 nodes, 1,000 topics, and 70 subscriptions per-node, and under high churn rates. In addition, our results demonstrate that, in a large setting, the average node degree in SpiderCast is at least 45% smaller than in other overlays typically used to support decentralized pub/sub communication (such as e.g., similarity-based, rings-based, and random overlays).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
 
5
 
6
7
 
8
M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE J. Sel. Areas in Comm., 20(8):1489--1499, 2002.
 
9
R. Chand and P. Felber. Semantic peer-to-peer overlays for publish/subscribe networks. In Euro-Par 2005 Parallel Processing, LNCS, volume 3648, pages 1194--1204. Springer Verlag, 2005.
10
11
 
12
R. Guerraoui, S. Handurukande, and A.-M. Kermarrec. Gosskip: a gossip-based structured overlay network for efficient content-based filtering. Technical Report IC/2004/95, EPFL, Lausanne, 2004.
 
13
14
 
15
 
16
 
17
 
18
D. Sandler, A. Mislove, A. Post, and P. Druschel. Feedtree: Sharing web micronews with peer-to-peer event notification. In IPTPS, 2005.
 
19
20
 
21
Y. Tock, N. Naaman, A. Harpaz, and G. Gershinsky. Hierarchical clustering of message flows in a multicast data dissemination system. In 17th IASTED Int'l Conf. Parallel and Distributed Computing and Systems, 2005.
 
22
S. Voulgaris, E. Riviere, A.-M. Kermarrec, and M. van Steen. Sub-2-sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In IPTPS, 2006.
 
23
N. Wormald. Models of random regular graphs. Surveys in Combinatorics, 276:239--298, 1999.


Collaborative Colleagues:
Gregory Chockler: colleagues
Roie Melamed: colleagues
Yoav Tock: colleagues
Roman Vitenberg: colleagues