Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Graph Coloring using Peer-to-Peer Networks
Authors: Adrian Iftene, Cornelius Croitoru
Keywords: CAN, graph coloring, peer-to-peer network.
– 0.17 Mb
Keywords: CAN, graph coloring, peer-to-peer network.
Abstract
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availability, scalability and performance. In this paper, we propose a framework for analyzing peer-to-peer content distributed technologies and their applications in the cooperative solving of combinatorial optimization problems. Our approach, which follows the Content Addressable Network model, is scalable, fault-tolerant and self-organizing; we improved also load distribution at the insertion and deletion of nodes. We use this network for the classical "graph coloring" problem, in order to reduce the computational time for its cooperative solving.Adrian Iftene, Cornelius Croitoru
"Al. I. Cuza" University, Faculty of Computer Science,
General Berthelot, 16, 700483, Iasi
Chisinau, MD2028, Moldova.
E-mail :
"Al. I. Cuza" University, Faculty of Computer Science,
General Berthelot, 16, 700483, Iasi
Chisinau, MD2028, Moldova.
E-mail :
Fulltext
– 0.17 Mb
Contents
- Generating Languages by P Systems with Minimal Symport/Antiport
- Applying Evolution Strategies for Chest Radiographs Segmentation
- Nash equilibria set computing in finite extended games
- Graph Coloring using Peer-to-Peer Networks
- The graphic representations for the one-dimensional solutions of problem from elastic mechanic deformations of two-component mixture
- An Approach to Shorten Digital Signature Length
- Cryptoschemes Based on New Signature Formation Mechanism
