OPTIMAL ALLOCATION OF POOLED SERVERS FOR SITUATION AWARENESS APPLICATIONS

摘要

We defined a new reliability architecture called Dynamic Survivable Resource Pooling (DSRP) that utilizes a virtual backbone for ad hoc network as a dynamic structure for hosting a naming system. This paper formulates the network model and the problem statement for resource allocation for Situation Awareness data applications. The servers (Pool Elements or PEs) represent the data-processing units. Information source points (Pool Users or PUs) are responsible both for appropriately classifying the priority level of their data and for requesting a server pool with this information. The naming system provides the PUs with a set of PEs with a weight vector that defines a weighted round-robin scheduling among the PEs. We formulate the PE selection for Situation Awareness as an optimal matching of PU requests with PE workloads in terms of rewards and pricing through non-linear optimization.