Minimum maximum-degree publish-subscribe overlay network design

dc.citation.epage1343en_US
dc.citation.issueNumber5en_US
dc.citation.spage1331en_US
dc.citation.volumeNumber19en_US
dc.contributor.authorOnus, Melihen_US
dc.contributor.authorRicha, A.W.en_US
dc.coverage.spatialRio de Janeiro, Brazilen_US
dc.date.accessioned2016-02-08T12:17:49Z
dc.date.available2016-02-08T12:17:49Z
dc.date.issued2011en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 19-25 April 2009en_US
dc.descriptionConference name: INFOCOM 2009. 28th IEEE International Conference on Computer Communicationsen_US
dc.description.abstractDesigning an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. It is only natural then to formalize the following problem: Given a collection of nodes and their topic subscriptions, connect the nodes into a graph that has least possible maximum degree in such a way that for each topic t, the graph induced by the nodes interested in t is connected. We present the first polynomial-time logarithmic approximation algorithm for this problem and prove an almost tight lower bound on the approximation ratio. Our experimental results show that our algorithm drastically improves the maximum degree of publish/subscribe overlay systems. We also propose a variation of the problem by enforcing that each topic-connected overlay network be of constant diameter while keeping the average degree low. We present three heuristics for this problem that guarantee that each topic-connected overlay network will be of diameter 2 and that aim at keeping the overall average node degree low. Our experimental results validate our algorithms, showing that our algorithms are able to achieve very low diameter without increasing the average degree by much. © 2011 IEEE.en_US
dc.identifier.doi10.1109/TNET.2011.2144999en_US
dc.identifier.issn1063-6692
dc.identifier.urihttp://hdl.handle.net/11693/28338
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TNET.2011.2144999en_US
dc.source.titleIEEE/ACM Transactions on Networkingen_US
dc.subjectCommunications technologyen_US
dc.subjectApproximation ratiosen_US
dc.subjectAverage degreeen_US
dc.subjectCommunications technologyen_US
dc.subjectFollowing problemen_US
dc.subjectLogarithmic approximationen_US
dc.subjectLow diametersen_US
dc.subjectLower boundsen_US
dc.subjectMaximum degreeen_US
dc.subjectNode degreeen_US
dc.subjectOverlay systemsen_US
dc.subjectPeer-to-peer computingen_US
dc.subjectPolynomial-timeen_US
dc.subjectPublish/subscribeen_US
dc.subjectPublish/Subscribe systemen_US
dc.subjectApproximation algorithmsen_US
dc.subjectDistributed computer systemsen_US
dc.subjectOverlay networksen_US
dc.subjectPolynomial approximationen_US
dc.subjectPeer to peer networksen_US
dc.titleMinimum maximum-degree publish-subscribe overlay network designen_US
dc.typeConference Paperen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Minimum maximum-degree publish-subscribe overlay network design.pdf
Size:
978.12 KB
Format:
Adobe Portable Document Format
Description:
Full printable version