Greedy is Good: On Service Tree Placement for In-Network Stream Processing

This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, where a user task is composed of a set of data processing modules (called services) with dependencies. Communications in sensor networks consume significant energy and introduce uncertainty in data fidelity due to high bit te. These constraints are abstracted as costs on the communication graph. The goal is to place the services within the sensor network so that the communication cost in performing the task is minimized. In addition, since the lifetime of a node, the quality of network links, and the composition of the service graph may change over time, the quality of the placement must be maintained in the face of these dynamics. In this paper, we take a fresh look at what is generally considered a simple but poor performance approach for service placement, namely the greedy algorithm. We prove that a modi�...

• Type: Conference
• Year: 2006
• Where: ICDCS
• Authors: Zoë Abrams, Jie Liu
• Keywords: Distributed And Parallel Computing, Greedy Algorithm, ICDCS 2006, Sensor Network, Service Graph