Graph Coloring using Peer-to-Peer Networks

Iftene Adrian; Croitoru Cornelius

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

1123

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 (4184)

Analiză combinatorică. Teoria grafurilor (115)

Cibernetică matematică (94)

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

Descarcă PDF

Rezumat

The popularity of distributed ﬁle 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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Iftene, A.</creatorName>
<affiliation>Universitatea "Alexandru Ioan Cuza", Iaşi, România</affiliation>
</creator>
<creator>
<creatorName>Croitoru, C.</creatorName>
<affiliation>Universitatea "Alexandru Ioan Cuza", Iaşi, România</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Graph Coloring using Peer-to-Peer Networks

</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2006</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier>
<subjects>
<subject>CAN</subject>
<subject>graph coloring</subject>
<subject>peer-to-peer network</subject>
<subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004:[519.17+519.72]</subject>
</subjects>
<dates>
<date dateType='Issued'>2006-01-05</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>The popularity of distributed ﬁle 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.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>