Minimum maximum-degree publish-subscribe overlay network design

IEEE/ACM Transactions on Networking

Volumn 19, Issue 5, 2011, Pages 1331-1343

  Onus, Melih ^a   Richa, Andréa W ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Communications technology; peer to peer computing

Indexed keywords

APPROXIMATION RATIOS; AVERAGE DEGREE; COMMUNICATIONS TECHNOLOGY; FOLLOWING PROBLEM; LOGARITHMIC APPROXIMATION; LOW DIAMETERS; LOWER BOUNDS; MAXIMUM DEGREE; NODE DEGREE; OVERLAY SYSTEMS; PEER-TO-PEER COMPUTING; POLYNOMIAL-TIME; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE SYSTEM;

APPROXIMATION ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; OVERLAY NETWORKS; POLYNOMIAL APPROXIMATION;

PEER TO PEER NETWORKS;

EID: 80054115540     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2144999     Document Type: Conference Paper

References (31)

1. Oraclei Application Developers Guide Advanced Queuing. Redwood Shores, CA: , Oracle.
2. M. Altherr,M. Erzberger, and S. Maffeis, "iBusa software bus middleware for the Java platform," in Proc. Int. Workshop Rel. Middleware Syst., 1999, pp. 43-53.
3. E. Anceaume, M. Gradinariu, A. K. Datta, G. Simon, and A. Virgillito, "A semantic overlay for self-peer-to-peer publish/subscribe," in Proc. 26th IEEE ICDCS, 2006, p. 26.
4. S. Baehni, P. T. Eugster, and E. Guerraoui, "Data-aware multicast," in Proc. DSN, 2004, pp. 233-242.
5. R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, and S. T. Piergiovanni, "TERA: Topic-based event routing for peer-to-peer architectures," in Proc. 1st ACM DEBS, 2007, pp. 2-13. (Pubitemid 47281501)
6. 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. (Pubitemid 47082663)
7. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, "Scalable application layer multicast," SIGCOMM Comput. Commun. Rev., vol. 32, no. 4, pp. 205-217, 2002. (Pubitemid 43843785)
8. S. Bhola, R. Strom, S. Bagchi, Y. Zhao, and J. Auerbach, "Exactly-once delivery in a content-based publish-subscribe system," in Proc. DSN, 2002, pp. 7-16.
9. A. Carzaniga, M. J. Rutherford, and A. L. Wolf, "A routing scheme for content-based networking," in Proc. 23rd Annu. IEEE INFOCOM, Hong Kong, Mar. 2004, vol. 2, pp. 918-928.
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. (Pubitemid 35220895)
11. R. Chand and P. Felber, "Semantic peer-to-peer overlays for publish/subscribe networks," in Euro-Par 2005 Parallel Processing, Lecture Notes in Computer Science. New York: Springer-Verlag, 2005, vol. 3648, pp. 1194-1204. (Pubitemid 41490923)
12. G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, "Constructing scalable overlays for pub-sub with many topics," in Proc. 26th ACM PODC, 2007, pp. 109-118. (Pubitemid 350229307)
13. G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, "SpiderCast: A scalable interest-aware overlay for topic-based pub/sub communication," in Proc. 1st ACM DEBS, 2007, pp. 14-25. (Pubitemid 47281502)
14. R. Diestel, Graph Theory, 2nd ed. New York: Springer-Verlag, 2000.
15. P. T. Eugster, P. A. Felber, R. Guerraoui, and A. M. Kermarrec, "The many faces of publish/subscribe," Comput. Surveys, vol. 35, no. 2, pp. 114-131, 2003.
16. R. Guerraoui, S. Handurukande, and A. M. Kermarrec, "Gossip: A gossip-based structured overlay network for efficient content-based filtering," EPFL, Lausanne, Tech. Rep. IC/2004/95, 2004.
17. B. Korte and J. Vygen, Combinatorial Optimization Theory and Algorithms, 2nd ed. New York: Springer-Verlag, 2000.
18. R. Levis, Advanced Massaging Applications With MSMQ and MQSeries. Indianapolis, IN: QUE, 1999.
19. 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, Berkeley, CA, 2005, pp. 29-34.
20. M. Onus and A. W. Richa, "Minimum maximum degree publish-subscribe overlay network design," in Proc. 28th Annu. IEEE INFOCOM, Rio de Janeiro, Brazil, 2009, pp. 882-890.
21. M. Onus and A. W. Richa, "Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design," in Proc. 21st ACMSPAA, Calgary, AB, Canada, 2009, pp. 39-40.
22. M. Onus and A. W. Richa, "Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design," in Proc. 30th IEEE ICDCS, Genoa, Italy, 2010, pp. 644-652.
23. V. Ramasubramanian, R. Peterson, and E. G. Sirer, "Corona: A high performance publish-subscribe system for the World Wide Web," in Proc. 3rd NDSI, 2006, pp. 15-28.
24. R. Raz and M. Safra, "A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP," in Proc. 29th Annu. ACM STOC, 1997, pp. 475-484.
25. D. Sandler, A. Mislove, A. Post, and P. Druschel, "FeedTree: Sharing Web micronews with peer-to-peer event notification," in Proc. IPTPS, 2005, pp. 141-151.
26. D. Skeen, "Vitrias publish-subscribe architecture: Publish-subscribe overview," Sunnyvale, CA, 1998 [Online]. Available: http://www.vitria.com
27. D. Tam, R. Azimi, and H.-A. Jacobsen, "Building content-based publish/subscribe systems with distributed hash tables," in Proc. 1st IDBISP2P, Berlin, Germany, 2003, pp. 138-152.
28. "Everything you need to know about middleware: Mission-critical interprocess communication," Talarian Corporation, Los Altos, CA, White paper, 1999 [Online]. Available: http://www.talarian.com/
29. "TIB/Rendezvous," Tibco, Palo Alto, CA, White paper, 1999.
30. Y. Tock, N. Naaman, A. Harpaz, and G. Gershindky, "Hierarchical clustering of message flows in a multicast data dissemination system," in Proc. 17th IASTED Int. Conf. Parallel Distrib. Comput. Syst., 2005, pp. 320-327.
31. 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 Proc. IPTPS, 2006, pp. 123-128.