Title :
Green Resource Allocation Algorithms for Publish/Subscribe Systems
Author :
Cheung, Alex King Yeung ; Jacobsen, Hans-Arno
Author_Institution :
Middleware Syst. Res. Group, Univ. of Toronto, Toronto, ON, Canada
Abstract :
A popular trend in large enterprises today is the adoption of green IT strategies that use resources as efficiently as possible to reduce IT operational costs. With the publish/subscribe middleware playing a vital role in seamlessly integrating applications at large enterprises including Google and Yahoo, our goal is to search for resource allocation algorithms that enable publish/subscribe systems to use system resources as efficiently as possible. To meet this goal, we develop methodologies that minimize system-wide message rates, broker load, hop count, and the number of allocated brokers, while maximizing the resource utilization of allocated brokers to achieve maximum efficiency. Our contributions consist of developing a bit vector supported resource allocation framework, designing and comparing four different classes with a total of ten variations of subscription allocation algorithms, and developing a recursive overlay construction algorithm. A compelling feature of our work is that it works under any arbitrary workload distribution and is independent of the publish/subscribe language, which makes it easily applicable to any topic and content-based publish/subscribe system. Experiments on a cluster testbed and a high performance computing platform show that our approach reduces the average broker message rate by up to 92% and the number of allocated brokers by up to 91%.
Keywords :
message passing; middleware; recursive estimation; resource allocation; Google; Yahoo; arbitrary workload distribution; bit vector; broker load minimization; content-based publish-subscribe system; green IT strategies; green resource allocation algorithms; hop count minimization; publish-subscribe middleware; recursive overlay construction algorithm; resource allocation algorithms; subscription allocation algorithms; system resources; system-wide message rates minimization; Bandwidth; Clustering algorithms; Complexity theory; Measurement; Optimization; Resource management; Subscriptions; content-based routing; green IT; load estimation; load minimization; overlay construction; publish/subscribe; publisher relocation; resource allocation; subscriber relocation;
Conference_Titel :
Distributed Computing Systems (ICDCS), 2011 31st International Conference on
Conference_Location :
Minneapolis, MN
Print_ISBN :
978-1-61284-384-1
Electronic_ISBN :
1063-6927
DOI :
10.1109/ICDCS.2011.82