Resource Allocation Strategies for In-Network Stream Processing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Resource Allocation Strategies for In-Network Stream Processing


In this paper we consider the operator mapping problem for in-network stream processing applications. In-network stream processing consists in applying a tree of operators in steady-state to multiple data objects that are continually updated at various locations on a network. Examples of in-network stream processing include the processing of data in a sensor network, or of continuous queries on distributed relational databases. We study the operator mapping problem in a ``constructive'' scenario, i.e., a scenario in which one builds a platform dedicated to the application buy purchasing processing servers with various costs and capabilities. The objective is to minimize the cost of the platform while ensuring that the application achieves a minimum steady-state throughput. The first contribution of this paper is the formalization of a set of relevant operator-placement problems as linear programs, and a proof that even simple versions of the problem are NP-complete. Our second contribution is the design of several polynomial time heuristics, which are evaluated via extensive simulations and compared to theoretical bounds for optimal solutions.
Fichier principal
Vignette du fichier
RR-6578.pdf (473.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00294972 , version 1 (10-07-2008)


  • HAL Id : inria-00294972 , version 1
  • ARXIV : 0807.1720


Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo, Yves Robert. Resource Allocation Strategies for In-Network Stream Processing. [Research Report] RR-6578, INRIA. 2008. ⟨inria-00294972⟩
157 View
79 Download



Gmail Facebook Twitter LinkedIn More