Minimum maximum degree publish-subscribe overlay network design

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 882-890

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

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

CONTROL THEORY; GRAPH THEORY; OVERLAY NETWORKS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70349705540     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5061998     Document Type: Conference Paper

References (19)

1. Oracle9i Application Developers Guide Advanced Queuing, Oracle, Redwood Shores, CA.
2. E. Anceaume, M. Gradinariu, A. K. Datta, G. Simon, and A. Virgillito, A semantic overlay for selfpeer-to-peer publish/subscribe, In ICDCS, 2006.
3. S. Baehni, P. T. Eugster, and E. Guerraoui, Data-aware multicast. In DSN, 2004.
4. st International Conference on Distributed Event-Based Systems (DEBS). ACM, 6 2007.
5. R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito, Efficient publish/subscribe through a self-organizing broker overlay and its application to SIENA, The Computer Journal, 2007.
6. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, Scalable application layer multicast, SIGCOMM Comput. Commun. Rev, 32(4):205-217, 2002.
7. S. Bhola, R. Strom, S. Bagchi, Y. Zhao, and J. Auerbach, Exactly-once delivery in a content-based publish-subscribe system. In DSN, 2002.
8. A. Carzaniga, M. J. Rutherford, and A. L. Wolf, A routing scheme for content-based networking., IEEE INFOCOM 2004, Hon Kong, China, Mar. 2004.
9. M. Castro, P. Druschel, A. M. Kermarrec, and A. Rowstron, SCRIBE: a large-scale and decentralized application-level multicast infrastructure, IEEE J. Selected Areas in Comm. (JSAC), 20(8):14891499, 2002.
10. 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, volume 3648, pages 11941204. Springer Verlag, 2005.
11. th ACM Symp. on Principles of Distributed Computing (PODC), 2007, pp. 109-118.
12. st International Conference on Distributed Event-Based Systems (DEBS). ACM, 6 2007.
13. nd edition, New York, 2000.
14. P. T. Eugster, P. A. Felber, R. Guerraoui, and A. M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, 35(2):114131, 2003.
15. R. Guerraoui, S. Handurukande, and A. M. Kermarrec, Gossip: a gossipbased structured overlay network for efficient content-based filtering, Technical Report IC/2004/95, EPFL, Lausanne, 2004.
16. nd edition, 2000.
17. R. Levis, Advanced Massaging Applications with MSMQ and MQSeries. QUE, 1999.
18. H. Liu, V. Ramasubramanian, and E. G. Sirer. Client behavior and feed characteristics of rss, a publish-subscribe system for web micronews. In Internet Measurement Conference (IMC), Berkeley, California, October 2005.
19. 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.