Graph Coloring using Peer-to-Peer Networks
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
1079 4
Ultima descărcare din IBN:
2022-11-10 23:56
Căutarea după subiecte
similare conform CZU
004:[519.17+519.72] (1)
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4103)
Analiză combinatorică. Teoria grafurilor (114)
Cibernetică matematică (93)
SM ISO690:2012
IFTENE, Adrian, CROITORU, Cornelius. Graph Coloring using Peer-to-Peer Networks . In: Computer Science Journal of Moldova, 2006, nr. 3(42), pp. 366-380. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 3(42) / 2006 / ISSN 1561-4042 /ISSNe 2587-4330

Graph Coloring using Peer-to-Peer Networks
CZU: 004:[519.17+519.72]

Pag. 366-380

Iftene Adrian, Croitoru Cornelius
 
Alexandru Ioan Cuza University of Iaşi
 
Disponibil în IBN: 4 decembrie 2013


Rezumat

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.

Cuvinte-cheie
CAN, graph coloring, peer-to-peer network