Publisher placement algorithms in content-based publish/subscribe

Alex King Yeung Cheung, Hans Arno Jacobsen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

Many publish/subscribe systems implement a policy for clients to join to their physically closest broker to minimize transmission delays incurred on the clients' messages. However, the amount of delay reduced by this policy is only the tip of the iceberg as messages incur queuing, matching, transmission, and scheduling delays from traveling across potentially long distances in the broker network. Additionally, the clients' impact on system load is totally neglected by such a policy. This paper proposes two new algorithms that intelligently relocate publishers on the broker overlay to minimize both the overall end-to-end delivery delay and system load. Both algorithms exploit live publication distribution patterns but with different optimization metrics and computation methodologies to determine the best relocation point. Evaluations on PlanetLab and a cluster testbed show that our algorithms can reduce the average input load of the system by up to 68%, average broker message rate by up to 85%, and average delivery delay by up to 68%.

Original languageEnglish
Title of host publicationICDCS 2010 - 2010 International Conference on Distributed Computing Systems
Pages653-664
Number of pages12
DOIs
StatePublished - 2010
Externally publishedYes
Event30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010 - Genova, Italy
Duration: 21 Jun 201025 Jun 2010

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Conference

Conference30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010
Country/TerritoryItaly
CityGenova
Period21/06/1025/06/10

Fingerprint

Dive into the research topics of 'Publisher placement algorithms in content-based publish/subscribe'. Together they form a unique fingerprint.

Cite this