By Topic

Operator placement with QoS constraints for distributed stream processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yuanqiang Huang ; Beijing Key Lab. of Comput. Network, Beihang Univ., Beijing, China ; Zhongzhi Luan ; Rong He ; Depei Qian

Distributed stream processing relies on in-network operator placement to achieve an optimal resource allocation which can use the pool of machines and network resource efficiently. Due to the QoS (Quality of Service) constraints imposed by the application, operator placement is usually treated as an optimization problem with constraints. Trying to get a global optimization is challenging since it's a NP-hard problem. In this paper, we formalize the operator placement problem with network usage as the optimization objective and use two resource allocation related QoS metrics: throughput and end-to-end delay. We propose a concept of Optimization Power to describe the host's capacity to reach a global optimal solution as soon as possible. We also propose a corresponding Optimization Power-based heuristic algorithm for operator placement. Experiment results show that our approach can achieve a better performance in terms of reducing network usage and end-top-end delay, improving success ratio, and decreasing resource discovery frequency, compared to some other placement algorithms.

Published in:

Network and Service Management (CNSM), 2011 7th International Conference on

Date of Conference:

24-28 Oct. 2011