Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 39-40

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

^a Arizona State University   (United States)

Author keywords

Multicast; Optimization; Overlay networks; Peer to peer; Pub sub

Indexed keywords

AVERAGE DEGREE; FOLLOWING PROBLEM; MAXIMUM DEGREE; MULTICAST; MULTICAST OPTIMIZATION; PARAMETERIZED; PEER TO PEER; POLYNOMIAL-TIME; PUB/SUB; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE SYSTEM; SUBLINEAR;

MULTICASTING; OVERLAY NETWORKS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70449629574     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1584000     Document Type: Conference Paper

References (3)

1. G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg. Constructing scalable overlays for pub-sub with many topics. In PODC, pages 109-118, 2007.
2. M. Onus and A. W. Richa. Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In Technical Report, Arizona State University, Department of Computer Science and Engineering, TR-09-006, 2009.
3. M. Onus and A. W. Richa. Minimum maximum degree publish-subscribe overlay network design. In INFOCOM, 2009.