Algorithms Based on Divide and Conquer for Topic-Based Publish/Subscribe Overlay Design

IEEE/ACM Transactions on Networking

Volumn 24, Issue 1, 2016, Pages 422-436

  Chen, Chen ^a   Jacobsen, Hans Arno ^a   Vitenberg, Roman ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF OSLO   (Norway)

Author keywords

Algorithm; overlay; publish subscribe

Indexed keywords

ALGORITHMS; COSTS;

AVERAGE NODE DEGREES; CENTRALIZED OPERATIONS; DIVIDE AND CONQUER; DIVIDE-AND-CONQUER ALGORITHM; EXPERIMENTAL EVALUATION; GLOBAL KNOWLEDGE; PUBLISH/SUBSCRIBE; TIME EFFICIENCIES;

COST BENEFIT ANALYSIS;

EID: 84913614377     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2014.2369346     Document Type: Article

References (43)

1. J. Reumann, "Pub/sub at Google," Oslo, Norway, Aug. 2009, lecture at CANOE Summer School.
2. Tibco Software, Inc., Palo Alto, CA, USA, "Tibco Rendezvous," [Online]. Available: http:\www.tibco.com
3. H. Liu, V. Ramasubramanian, and E. G. Sirer, "Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews," in Proc. IMC, 2005, p. 3.
4. G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, "Constructing scalable overlays for pub-sub with many topics," in Proc. PODC, 2007, pp. 109-118.
5. M. Onus and A. W. Richa, "Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design," in Proc. IEEE ICDCS, 2010, pp. 644-652.
6. M. A. Jaeger, H. Parzyjegla, G. Mühl, and K. Herrmann, "Self-organizing broker topologies for publish/subscribe systems," in Proc. SAC, 2007, pp. 543-550.
7. R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito, "Efficient publish/subscribe through a self-organizing broker overlay and its application to SIENA," Comput. J., vol. 50, no. 4, pp. 444-459, 2007.
8. S. Voulgaris, E. Riviére, A.-M. Kermarrec, and M. V. Steen, "Sub-2-Sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks," in Proc. IPTPS, 2006.
9. R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, and S. Tucci-Piergiovanni, "TERA: Topic-based event routing for peer-to-peer architectures," in Proc. DEBS, 2007, pp. 2-13.
10. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, "Scribe: A large-scale and decentralized application-level multicast infrastructure," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1489-1499, Oct. 2002.
11. J. A. Patel, E. Riviére, I. Gupta, and A.-M. Kermarrec, "Rappel: Exploiting interest and network locality to improve fairness in publishsubscribe systems," Comput. Netw., vol. 53, no. 13, pp. 2304-2320, 2009.
12. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the evolution of peer-to-peer systems," in Proc. PODC, 2002, pp. 233-242.
13. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in Proc. STOC, 2000, pp. 163-170.
14. "Google cluster data," [Online]. Available: http://code.google.com/p/googleclusterdata/
15. C. Chen, H.-A. Jacobsen, and R. Vitenberg, "Star merge and divideand-conquer algorithms for publish/subscribe topic-connected overlay design," Tech. Rep., 2010 [Online]. Available: http://msrg.org/papers/TRCJV-DC-2010
16. G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, "Spidercast: A scalable interest-aware overlay for topic-based pub/sub communication," in Proc. DEBS, 2007, pp. 14-25.
17. Y. Tock, N. Naaman, A. Harpaz, and G. Gershinsky, "Hierarchical clustering of message flows in a multicast data dissemination system," in Proc. IASTED PDCS, 2005, pp. 320-326.
18. C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao, "User interactions in social networks and their implications," in Proc. EuroSys, 2009, pp. 205-218.
19. H. Kwak, C. Lee, H. Park, and S. Moon, "What is Twitter, a social network or a news media?," in Proc. WWW, 2010, pp. 591-600.
20. F. Rahimian, T. Le Nguyen Huu, and S. Girdzijauskas, "Locality-awareness in a peer-to-peer publish/subscribe network," in Proc. DAIS, 2012, pp. 45-58.
21. V. Setty et al., "The hidden pub/sub of Spotify," in Proc. DEBS, 2013, pp. 231-240.
22. M. Matos, P. Felber, R. Oliveira, J. O. Pereira, and E. Riviere, "Scaling up publish/subscribe overlays using interest correlation for link sharing," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 12, pp. 2462-2471, Dec. 2013.
23. V. Setty, M. van Steen, R. Vitenberg, and S. Voulgaris, "PolderCast: Fast, robust, scalable architecture for P2P topic-based pub/sub," in Proc. Middleware, 2012, pp. 271-291.
24. D. Tam, R. Azimi, and H.-A. Jacobsen, "Building content-based publish/subscribe systems with distributed hash tables," in Proc.DBISP2P, 2003, pp. 138-152.
25. G. Li, V. Muthusamy, and H.-A. Jacobsen, "Adaptive content-based routing in general overlay topologies," in Proc. Middleware, 2008, pp. 1-21.
26. F. Araujo, L. Rodrigues, N. Carvalho, and N. Carvalho, "Scalable QoSbased event routing in publish-subscribe systems," in Proc. IEEE NCA, 2005, pp. 101-108.
27. S. Girdzijauskas, G. Chockler, Y. Vigfusson, Y. Tock, and R. Melamed, "Magnet: Practical subscription clustering for Internet-scale publish/subscribe," in Proc. DEBS, 2010, pp. 172-183.
28. E. Baehni, P. Eugster, and R. Guerraoui, "Data-aware multicast," in Proc. DSN, 2004, p. 233.
29. R. Chand and P. Felber, "Semantic peer-to-peer overlays for publish/subscribe networks," in Proc. EUROPAR, 2005, pp. 1194-1204.
30. M. Onus and A. W. Richa, "Minimum maximum degree publish-subscribe overlay network design," in Proc. IEEE INFOCOM, 2009, pp. 882-890.
31. C. Chen, R. Vitenberg, and H.-A. Jacobsen, "Scaling construction of low fan-out overlays for topic-based publish/subscribe systems," in Proc. ICDCS, 2011, pp. 225-236.
32. F. Rahimian, S. Girdzijauskas, A. H. Payberah, and S. Haridi, "Vitis: A gossip-based hybrid overlay for internet-scale publish/subscribe enabling rendezvous routing in unstructured overlay networks," in Proc. IEEE IPDPS, 2011, pp. 746-757.
33. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. SIGCOMM, 2001, pp. 161-172.
34. M. A. Tariq, B. Koldehofe, and K. Rothermel, "Efficient content-based routing with network topology inference," in Proc. DEBS, 2013, pp. 51-62.
35. M. Castro, P. Druschel, Y. C. Hu, and A. I. T. Rowstron, "Topologyaware routing in structured peer-to-peer overlay networks," in Proc. Future Directions Distrib. Comput., 2003, pp. 103-107.
36. Z. Xu, C. Tang, and Z. Zhang, "Building topology-aware overlays using global soft-state," in Proc. ICDCS, 2003, pp. 500-508.
37. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, "SkipNet: A scalable overlay network with practical locality properties," in Proc. USITS, 2003, vol. 4, p. 9.
38. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologicallyaware overlay construction and server selection," in Proc. IEEE INFOCOM, 2002, vol. 3, pp. 1190-1199.
39. A. I. T. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, routing for large-scale peer-to-peer systems," in Proc. Middleware, 2001, pp. 329-350.
40. I. Aekaterinidis and P. Triantafillou, "PastryStrings: A comprehensive content-based publish/subscribe DHT network," in Proc. ICDCS, 2006, p. 23.
41. A. Slivkins, "Towards fast decentralized construction of locality-aware overlay networks," in Proc. PODC, 2007, pp. 89-98.
42. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. SIGCOMM, 2001, pp. 149-160.
43. S. Chakravarty and A. Shekhawat, "Parallel and serial heuristics for the minimum set cover problem," J. Supercomput., vol. 5, no. 4, pp. 331-345, 1992.