Distributed databases were developed in order to respond to the needs of distributed computing. Unlike traditional database systems, distributed database systems are a set of nodes that are connected with each other by network and each of nodes has its own database, but they are available by other systems. Thus, each node can have access to all data on entire network. The main objective of allocated algorithms is to attribute fragments to various nodes in order to reduce the shipping cost. Thus, firstly fragments of nodes must be accessible by all nodes in each period, secondly, the transmission cost of fragments to nodes must be reduced and thirdly, the cost of updating all components of nodes must be optimized, that results in increased reliability and availability of network. In this study, more efficient hybrid algorithm can be produced combining genetic algorithms and previous algorithms.
In this paper, we deal with a coordination game in a network where a player can choose both an action of the game and partners for playing the game. In particular, a player interacts with players connecting through a path consisting of multiple links as well as with players directly connecting by a single link. We represent decay or friction of payoffs with distance as communication costs, and examine the effect of the communication cost on behavior of players in the game and network formation. We investigate properties of equilibrium networks by classifying the link cost and the communication cost, and show diversity of the equilibrium networks.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.