|Bibliography||Carabelli, Ben W.; Benzing, Andreas; Seyboth, Georg; Blind, Rainer; Bürger, Mathias; Dürr, Frank; Koldehofe, Boris; Rothermel, Kurt; Allgöwer, Frank: Exact Convex Formulations of Network-Oriented Optimal Operator Placement. |
In: Proceedings of the 51st IEEE Conference on Decision and Control (CDC2012).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
pp. 3777-3782, english.
IEEE, December 2012.
Article in Proceedings (Conference Paper).
|CR-Schema||G.1.6 (Numerical Analysis Optimization)|
|Keywords||Optimization; Computer networks; Sensor networks|
Data processing tasks are increasingly spread across the internet to account for the spatially distributed nature of many data sources. In order to use network resources efficiently, subtasks need to be distributed in the network so data can be filtered close to the data sources. Previous approaches to this operator placement problem relied on various heuristics to constrain the complexity of the problem. In this paper, we propose two generic integer constrained problem formulations: a topology aware version which provides a placement including the specific network links as well as an end-to-end delay aware version which relies on the routing capabilities of the network. A linear programming relaxation for both versions is provided which allows exact and efficient solution using common solvers.
|Full text and|
|PDF (341599 Bytes)|
The original publication is available at IEEE Xplore
|Copyright||© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
|Department(s)||University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems|
|Entry date||July 18, 2012|