We propose a strategic negotiation model that takes into account the passage of time during the negotiation process itself in order to solve the problem of data allocation in environments with self-motivated servers which have no common interest and no central controller. The model considers situations characterized by complete, as well as incomplete,… (More)
We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered… (More)
Bibliography 185 Knowledge Discovery and Data Mining. Models with general state hierarchy.
(NASA 1997). It is a distributed system which sup-We propose a strategic negotiation model that takes ports archival data and distribution of data at multiple and independent data centers (called DAACs). The into account the passage of time during the negotiation process itself in order to solve the problem of data current policy for data allocation in NASA… (More)