InforLorV4, PascalFrancis, Corpus, bibRecord, 000207

Building a collaborative peer-to-peer wiki system on a structured overlay

Identifieur interne : 000207 ( PascalFrancis/Corpus ); précédent : 000206; suivant : 000208

Building a collaborative peer-to-peer wiki system on a structured overlay

Auteurs : Gérald Oster ; Rubén Mondejar ; Pascal Molli ; Sergiu Dumitriu

Source :

Computer networks : (1999) [ 1389-1286 ] ; 2010.

RBID : Pascal:10-0394735

Descripteurs français

Pascal (Inist)
- Poste à poste, Information numérique, Fourniture information, Capacité stockage, Disponibilité, Evaluation performance, Extensibilité, Théorie quasi statique, Hachage, Transformation Hartley discrète, Réplication, Interface utilisateur, Implémentation, Intergiciel, Interception, Partage des ressources, Réseau ordinateur, Dialogue homme machine.

English descriptors

KwdEn :
- Availability, Computer network, Digital information, Discrete Hartley transforms, Hashing, Implementation, Information delivery, Interception, Man machine dialogue, Middleware, Peer to peer, Performance evaluation, Quasi static theory, Replication, Resource sharing, Scalability, Storage capacity, User interface.

Abstract

The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. While many simple solutions for scalable distribution of quasi-static content exist, there are still no approaches that can ensure both scalability and consistency for the case of highly dynamic content, such as the data managed inside wikis. We propose a peer-to-peer solution for distributing and managing dynamic content, that combines two widely studied technologies: Distributed Hash Tables (DHT) and optimistic replication. In our "universal wiki" engine architecture (UniWiki), on top of a reliable, inexpensive and consistent DHT-based storage, any number of front-ends can be added, ensuring both read and write scalability, as well as suitability for large-scale scenarios. The implementation is based on Damon, a distributed AOP middleware, thus separating distribution, replication, and consistency responsibilities, and also making our system transparently usable by third party wiki engines. Finally, UniWiki has been proved viable and fairly efficient in large-scale scenarios.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 1389-1286`
A03		`1`		`@0 Comput. netw. : (1999)`
A05				`@2 54`
A06				`@2 12`
A08	`01`	`1`	`ENG`	`@1 Building a collaborative peer-to-peer wiki system on a structured overlay`
A09	`01`	`1`	`ENG`	`@1 P2P Technologies for Emerging Wide-Area Collaborative Services and Applications`
A11	`01`	`1`		`@1 OSTER (Gérald)`
A11	`02`	`1`		`@1 MONDEJAR (Rubén)`
A11	`03`	`1`		`@1 MOLLI (Pascal)`
A11	`04`	`1`		`@1 DUMITRIU (Sergiu)`
A12	`01`	`1`		`@1 GARCIA-LOPEZ (Pedro) @9 ed.`
A12	`02`	`1`		`@1 SANCHEZ-ARTIGAS (Marc) @9 ed.`
A12	`03`	`1`		`@1 SOBOLEWSKI (Michael) @9 ed.`
A14	`01`			`@1 Score Team, Université de Lorraine, Université Henri Poincaré, INRIA @2 LORIA @3 FRA @Z 1 aut. @Z 3 aut.`
A14	`02`			`@1 Department of Computer Science and Mathematics, Universitat Rovira i Virgili @3 ESP @Z 2 aut.`
A14	`03`			`@1 XWiki SAS & Score Team, Université de Lorraine, Université Henri Poincaré, INRIA @2 LORIA @3 FRA @Z 4 aut.`
A15	`01`			`@1 Department of Computer Engineering and Maths, Universitat Rovira i Virgili, Av. Països Catalans 26 @2 43007 Tarragona @3 ESP @Z 1 aut. @Z 3 aut.`
A15	`02`			`@1 Department of Computer Science, Texas Tech University, Boston and 8th St. @2 Lubbock, TX 79409-3104 @3 USA @Z 2 aut.`
A20				`@1 1939-1952`
A21				`@1 2010`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17220 @5 354000191810730020`
A44				`@0 0000 @1 © 2010 INIST-CNRS. All rights reserved.`
A45				`@0 44 ref.`
A47	`01`	`1`		`@0 10-0394735`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Computer networks : (1999)`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. While many simple solutions for scalable distribution of quasi-static content exist, there are still no approaches that can ensure both scalability and consistency for the case of highly dynamic content, such as the data managed inside wikis. We propose a peer-to-peer solution for distributing and managing dynamic content, that combines two widely studied technologies: Distributed Hash Tables (DHT) and optimistic replication. In our "universal wiki" engine architecture (UniWiki), on top of a reliable, inexpensive and consistent DHT-based storage, any number of front-ends can be added, ensuring both read and write scalability, as well as suitability for large-scale scenarios. The implementation is based on Damon, a distributed AOP middleware, thus separating distribution, replication, and consistency responsibilities, and also making our system transparently usable by third party wiki engines. Finally, UniWiki has been proved viable and fairly efficient in large-scale scenarios.
C02	`01`	`X`		`@0 001D04B03F`
C02	`02`	`X`		`@0 001D04B02G`
C02	`03`	`X`		`@0 001D04B03B`
C03	`01`	`X`	`FRE`	`@0 Poste à poste @5 01`
C03	`01`	`X`	`ENG`	`@0 Peer to peer @5 01`
C03	`01`	`X`	`SPA`	`@0 Par a par @5 01`
C03	`02`	`X`	`FRE`	`@0 Information numérique @5 02`
C03	`02`	`X`	`ENG`	`@0 Digital information @5 02`
C03	`02`	`X`	`SPA`	`@0 Información numérica @5 02`
C03	`03`	`X`	`FRE`	`@0 Fourniture information @5 03`
C03	`03`	`X`	`ENG`	`@0 Information delivery @5 03`
C03	`03`	`X`	`SPA`	`@0 Entrega informacíon @5 03`
C03	`04`	`X`	`FRE`	`@0 Capacité stockage @5 04`
C03	`04`	`X`	`ENG`	`@0 Storage capacity @5 04`
C03	`04`	`X`	`SPA`	`@0 Capacidad almacenaje @5 04`
C03	`05`	`X`	`FRE`	`@0 Disponibilité @5 05`
C03	`05`	`X`	`ENG`	`@0 Availability @5 05`
C03	`05`	`X`	`SPA`	`@0 Disponibilidad @5 05`
C03	`06`	`X`	`FRE`	`@0 Evaluation performance @5 06`
C03	`06`	`X`	`ENG`	`@0 Performance evaluation @5 06`
C03	`06`	`X`	`SPA`	`@0 Evaluación prestación @5 06`
C03	`07`	`X`	`FRE`	`@0 Extensibilité @5 07`
C03	`07`	`X`	`ENG`	`@0 Scalability @5 07`
C03	`07`	`X`	`SPA`	`@0 Estensibilidad @5 07`
C03	`08`	`X`	`FRE`	`@0 Théorie quasi statique @5 08`
C03	`08`	`X`	`ENG`	`@0 Quasi static theory @5 08`
C03	`08`	`X`	`SPA`	`@0 Teoría cuasiestática @5 08`
C03	`09`	`X`	`FRE`	`@0 Hachage @5 09`
C03	`09`	`X`	`ENG`	`@0 Hashing @5 09`
C03	`09`	`X`	`SPA`	`@0 Hashing @5 09`
C03	`10`	`3`	`FRE`	`@0 Transformation Hartley discrète @5 10`
C03	`10`	`3`	`ENG`	`@0 Discrete Hartley transforms @5 10`
C03	`11`	`X`	`FRE`	`@0 Réplication @5 11`
C03	`11`	`X`	`ENG`	`@0 Replication @5 11`
C03	`11`	`X`	`SPA`	`@0 Replicación @5 11`
C03	`12`	`X`	`FRE`	`@0 Interface utilisateur @5 12`
C03	`12`	`X`	`ENG`	`@0 User interface @5 12`
C03	`12`	`X`	`SPA`	`@0 Interfase usuario @5 12`
C03	`13`	`X`	`FRE`	`@0 Implémentation @5 13`
C03	`13`	`X`	`ENG`	`@0 Implementation @5 13`
C03	`13`	`X`	`SPA`	`@0 Implementación @5 13`
C03	`14`	`X`	`FRE`	`@0 Intergiciel @5 14`
C03	`14`	`X`	`ENG`	`@0 Middleware @5 14`
C03	`14`	`X`	`SPA`	`@0 Logicial personalizado @5 14`
C03	`15`	`X`	`FRE`	`@0 Interception @5 15`
C03	`15`	`X`	`ENG`	`@0 Interception @5 15`
C03	`15`	`X`	`SPA`	`@0 Intercepción @5 15`
C03	`16`	`X`	`FRE`	`@0 Partage des ressources @5 46`
C03	`16`	`X`	`ENG`	`@0 Resource sharing @5 46`
C03	`16`	`X`	`SPA`	`@0 Partición recursos @5 46`
C03	`17`	`X`	`FRE`	`@0 Réseau ordinateur @5 47`
C03	`17`	`X`	`ENG`	`@0 Computer network @5 47`
C03	`17`	`X`	`SPA`	`@0 Red informática @5 47`
C03	`18`	`X`	`FRE`	`@0 Dialogue homme machine @5 48`
C03	`18`	`X`	`ENG`	`@0 Man machine dialogue @5 48`
C03	`18`	`X`	`SPA`	`@0 Diálogo hombre máquina @5 48`
N21				`@1 256`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 10-0394735 INIST
ET :	Building a collaborative peer-to-peer wiki system on a structured overlay
AU :	OSTER (Gérald); MONDEJAR (Rubén); MOLLI (Pascal); DUMITRIU (Sergiu); GARCIA-LOPEZ (Pedro); SANCHEZ-ARTIGAS (Marc); SOBOLEWSKI (Michael)
AF :	Score Team, Université de Lorraine, Université Henri Poincaré, INRIA/LORIA/France (1 aut., 3 aut.); Department of Computer Science and Mathematics, Universitat Rovira i Virgili/Espagne (2 aut.); XWiki SAS & Score Team, Université de Lorraine, Université Henri Poincaré, INRIA/LORIA/France (4 aut.); Department of Computer Engineering and Maths, Universitat Rovira i Virgili, Av. Països Catalans 26/43007 Tarragona/Espagne (1 aut., 3 aut.); Department of Computer Science, Texas Tech University, Boston and 8th St./Lubbock, TX 79409-3104/Etats-Unis (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Computer networks : (1999); ISSN 1389-1286; Royaume-Uni; Da. 2010; Vol. 54; No. 12; Pp. 1939-1952; Bibl. 44 ref.
LA :	Anglais
EA :	The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. While many simple solutions for scalable distribution of quasi-static content exist, there are still no approaches that can ensure both scalability and consistency for the case of highly dynamic content, such as the data managed inside wikis. We propose a peer-to-peer solution for distributing and managing dynamic content, that combines two widely studied technologies: Distributed Hash Tables (DHT) and optimistic replication. In our "universal wiki" engine architecture (UniWiki), on top of a reliable, inexpensive and consistent DHT-based storage, any number of front-ends can be added, ensuring both read and write scalability, as well as suitability for large-scale scenarios. The implementation is based on Damon, a distributed AOP middleware, thus separating distribution, replication, and consistency responsibilities, and also making our system transparently usable by third party wiki engines. Finally, UniWiki has been proved viable and fairly efficient in large-scale scenarios.
CC :	001D04B03F; 001D04B02G; 001D04B03B
FD :	Poste à poste; Information numérique; Fourniture information; Capacité stockage; Disponibilité; Evaluation performance; Extensibilité; Théorie quasi statique; Hachage; Transformation Hartley discrète; Réplication; Interface utilisateur; Implémentation; Intergiciel; Interception; Partage des ressources; Réseau ordinateur; Dialogue homme machine
ED :	Peer to peer; Digital information; Information delivery; Storage capacity; Availability; Performance evaluation; Scalability; Quasi static theory; Hashing; Discrete Hartley transforms; Replication; User interface; Implementation; Middleware; Interception; Resource sharing; Computer network; Man machine dialogue
SD :	Par a par; Información numérica; Entrega informacíon; Capacidad almacenaje; Disponibilidad; Evaluación prestación; Estensibilidad; Teoría cuasiestática; Hashing; Replicación; Interfase usuario; Implementación; Logicial personalizado; Intercepción; Partición recursos; Red informática; Diálogo hombre máquina
LO :	INIST-17220.354000191810730020
ID :	10-0394735

Links to Exploration step

Pascal:10-0394735

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Building a collaborative peer-to-peer wiki system on a structured overlay</title>
<author><name sortKey="Oster, Gerald" sort="Oster, Gerald" uniqKey="Oster G" first="Gérald" last="Oster">Gérald Oster</name>
<affiliation><inist:fA14 i1="01"><s1>Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mondejar, Ruben" sort="Mondejar, Ruben" uniqKey="Mondejar R" first="Rubén" last="Mondejar">Rubén Mondejar</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science and Mathematics, Universitat Rovira i Virgili</s1>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Molli, Pascal" sort="Molli, Pascal" uniqKey="Molli P" first="Pascal" last="Molli">Pascal Molli</name>
<affiliation><inist:fA14 i1="01"><s1>Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Dumitriu, Sergiu" sort="Dumitriu, Sergiu" uniqKey="Dumitriu S" first="Sergiu" last="Dumitriu">Sergiu Dumitriu</name>
<affiliation><inist:fA14 i1="03"><s1>XWiki SAS & Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">10-0394735</idno>
<date when="2010">2010</date>
<idno type="stanalyst">PASCAL 10-0394735 INIST</idno>
<idno type="RBID">Pascal:10-0394735</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000207</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Building a collaborative peer-to-peer wiki system on a structured overlay</title>
<author><name sortKey="Oster, Gerald" sort="Oster, Gerald" uniqKey="Oster G" first="Gérald" last="Oster">Gérald Oster</name>
<affiliation><inist:fA14 i1="01"><s1>Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mondejar, Ruben" sort="Mondejar, Ruben" uniqKey="Mondejar R" first="Rubén" last="Mondejar">Rubén Mondejar</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science and Mathematics, Universitat Rovira i Virgili</s1>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Molli, Pascal" sort="Molli, Pascal" uniqKey="Molli P" first="Pascal" last="Molli">Pascal Molli</name>
<affiliation><inist:fA14 i1="01"><s1>Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Dumitriu, Sergiu" sort="Dumitriu, Sergiu" uniqKey="Dumitriu S" first="Sergiu" last="Dumitriu">Sergiu Dumitriu</name>
<affiliation><inist:fA14 i1="03"><s1>XWiki SAS & Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computer networks : (1999)</title>
<title level="j" type="abbreviated">Comput. netw. : (1999)</title>
<idno type="ISSN">1389-1286</idno>
<imprint><date when="2010">2010</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computer networks : (1999)</title>
<title level="j" type="abbreviated">Comput. netw. : (1999)</title>
<idno type="ISSN">1389-1286</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Availability</term>
<term>Computer network</term>
<term>Digital information</term>
<term>Discrete Hartley transforms</term>
<term>Hashing</term>
<term>Implementation</term>
<term>Information delivery</term>
<term>Interception</term>
<term>Man machine dialogue</term>
<term>Middleware</term>
<term>Peer to peer</term>
<term>Performance evaluation</term>
<term>Quasi static theory</term>
<term>Replication</term>
<term>Resource sharing</term>
<term>Scalability</term>
<term>Storage capacity</term>
<term>User interface</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Poste à poste</term>
<term>Information numérique</term>
<term>Fourniture information</term>
<term>Capacité stockage</term>
<term>Disponibilité</term>
<term>Evaluation performance</term>
<term>Extensibilité</term>
<term>Théorie quasi statique</term>
<term>Hachage</term>
<term>Transformation Hartley discrète</term>
<term>Réplication</term>
<term>Interface utilisateur</term>
<term>Implémentation</term>
<term>Intergiciel</term>
<term>Interception</term>
<term>Partage des ressources</term>
<term>Réseau ordinateur</term>
<term>Dialogue homme machine</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. While many simple solutions for scalable distribution of quasi-static content exist, there are still no approaches that can ensure both scalability and consistency for the case of highly dynamic content, such as the data managed inside wikis. We propose a peer-to-peer solution for distributing and managing dynamic content, that combines two widely studied technologies: Distributed Hash Tables (DHT) and optimistic replication. In our "universal wiki" engine architecture (UniWiki), on top of a reliable, inexpensive and consistent DHT-based storage, any number of front-ends can be added, ensuring both read and write scalability, as well as suitability for large-scale scenarios. The implementation is based on Damon, a distributed AOP middleware, thus separating distribution, replication, and consistency responsibilities, and also making our system transparently usable by third party wiki engines. Finally, UniWiki has been proved viable and fairly efficient in large-scale scenarios.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1389-1286</s0>
</fA01>
<fA03 i2="1"><s0>Comput. netw. : (1999)</s0>
</fA03>
<fA05><s2>54</s2>
</fA05>
<fA06><s2>12</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Building a collaborative peer-to-peer wiki system on a structured overlay</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>P2P Technologies for Emerging Wide-Area Collaborative Services and Applications</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>OSTER (Gérald)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MONDEJAR (Rubén)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>MOLLI (Pascal)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>DUMITRIU (Sergiu)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>GARCIA-LOPEZ (Pedro)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>SANCHEZ-ARTIGAS (Marc)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>SOBOLEWSKI (Michael)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Computer Science and Mathematics, Universitat Rovira i Virgili</s1>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>XWiki SAS & Score Team, Université de Lorraine, Université Henri Poincaré, INRIA</s1>
<s2>LORIA</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Department of Computer Engineering and Maths, Universitat Rovira i Virgili, Av. Països Catalans 26</s1>
<s2>43007 Tarragona</s2>
<s3>ESP</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Department of Computer Science, Texas Tech University, Boston and 8th St.</s1>
<s2>Lubbock, TX 79409-3104</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>1939-1952</s1>
</fA20>
<fA21><s1>2010</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17220</s2>
<s5>354000191810730020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2010 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>44 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>10-0394735</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Computer networks : (1999)</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. While many simple solutions for scalable distribution of quasi-static content exist, there are still no approaches that can ensure both scalability and consistency for the case of highly dynamic content, such as the data managed inside wikis. We propose a peer-to-peer solution for distributing and managing dynamic content, that combines two widely studied technologies: Distributed Hash Tables (DHT) and optimistic replication. In our "universal wiki" engine architecture (UniWiki), on top of a reliable, inexpensive and consistent DHT-based storage, any number of front-ends can be added, ensuring both read and write scalability, as well as suitability for large-scale scenarios. The implementation is based on Damon, a distributed AOP middleware, thus separating distribution, replication, and consistency responsibilities, and also making our system transparently usable by third party wiki engines. Finally, UniWiki has been proved viable and fairly efficient in large-scale scenarios.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04B03F</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D04B02G</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D04B03B</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Poste à poste</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Peer to peer</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Par a par</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Information numérique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Digital information</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Información numérica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Fourniture information</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Information delivery</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Entrega informacíon</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Capacité stockage</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Storage capacity</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Capacidad almacenaje</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Disponibilité</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Availability</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Disponibilidad</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Evaluation performance</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Performance evaluation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Evaluación prestación</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Extensibilité</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Scalability</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Estensibilidad</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Théorie quasi statique</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Quasi static theory</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Teoría cuasiestática</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Hachage</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Hashing</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Hashing</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="3" l="FRE"><s0>Transformation Hartley discrète</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="3" l="ENG"><s0>Discrete Hartley transforms</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Réplication</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Replication</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Replicación</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Interface utilisateur</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>User interface</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Interfase usuario</s0>
<s5>12</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Implémentation</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Implementation</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Implementación</s0>
<s5>13</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Intergiciel</s0>
<s5>14</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Middleware</s0>
<s5>14</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Logicial personalizado</s0>
<s5>14</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>Interception</s0>
<s5>15</s5>
</fC03>
<fC03 i1="15" i2="X" l="ENG"><s0>Interception</s0>
<s5>15</s5>
</fC03>
<fC03 i1="15" i2="X" l="SPA"><s0>Intercepción</s0>
<s5>15</s5>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Partage des ressources</s0>
<s5>46</s5>
</fC03>
<fC03 i1="16" i2="X" l="ENG"><s0>Resource sharing</s0>
<s5>46</s5>
</fC03>
<fC03 i1="16" i2="X" l="SPA"><s0>Partición recursos</s0>
<s5>46</s5>
</fC03>
<fC03 i1="17" i2="X" l="FRE"><s0>Réseau ordinateur</s0>
<s5>47</s5>
</fC03>
<fC03 i1="17" i2="X" l="ENG"><s0>Computer network</s0>
<s5>47</s5>
</fC03>
<fC03 i1="17" i2="X" l="SPA"><s0>Red informática</s0>
<s5>47</s5>
</fC03>
<fC03 i1="18" i2="X" l="FRE"><s0>Dialogue homme machine</s0>
<s5>48</s5>
</fC03>
<fC03 i1="18" i2="X" l="ENG"><s0>Man machine dialogue</s0>
<s5>48</s5>
</fC03>
<fC03 i1="18" i2="X" l="SPA"><s0>Diálogo hombre máquina</s0>
<s5>48</s5>
</fC03>
<fN21><s1>256</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 10-0394735 INIST</NO>
<ET>Building a collaborative peer-to-peer wiki system on a structured overlay</ET>
<AU>OSTER (Gérald); MONDEJAR (Rubén); MOLLI (Pascal); DUMITRIU (Sergiu); GARCIA-LOPEZ (Pedro); SANCHEZ-ARTIGAS (Marc); SOBOLEWSKI (Michael)</AU>
<AF>Score Team, Université de Lorraine, Université Henri Poincaré, INRIA/LORIA/France (1 aut., 3 aut.); Department of Computer Science and Mathematics, Universitat Rovira i Virgili/Espagne (2 aut.); XWiki SAS & Score Team, Université de Lorraine, Université Henri Poincaré, INRIA/LORIA/France (4 aut.); Department of Computer Engineering and Maths, Universitat Rovira i Virgili, Av. Països Catalans 26/43007 Tarragona/Espagne (1 aut., 3 aut.); Department of Computer Science, Texas Tech University, Boston and 8th St./Lubbock, TX 79409-3104/Etats-Unis (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Computer networks : (1999); ISSN 1389-1286; Royaume-Uni; Da. 2010; Vol. 54; No. 12; Pp. 1939-1952; Bibl. 44 ref.</SO>
<LA>Anglais</LA>
<EA>The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. While many simple solutions for scalable distribution of quasi-static content exist, there are still no approaches that can ensure both scalability and consistency for the case of highly dynamic content, such as the data managed inside wikis. We propose a peer-to-peer solution for distributing and managing dynamic content, that combines two widely studied technologies: Distributed Hash Tables (DHT) and optimistic replication. In our "universal wiki" engine architecture (UniWiki), on top of a reliable, inexpensive and consistent DHT-based storage, any number of front-ends can be added, ensuring both read and write scalability, as well as suitability for large-scale scenarios. The implementation is based on Damon, a distributed AOP middleware, thus separating distribution, replication, and consistency responsibilities, and also making our system transparently usable by third party wiki engines. Finally, UniWiki has been proved viable and fairly efficient in large-scale scenarios.</EA>
<CC>001D04B03F; 001D04B02G; 001D04B03B</CC>
<FD>Poste à poste; Information numérique; Fourniture information; Capacité stockage; Disponibilité; Evaluation performance; Extensibilité; Théorie quasi statique; Hachage; Transformation Hartley discrète; Réplication; Interface utilisateur; Implémentation; Intergiciel; Interception; Partage des ressources; Réseau ordinateur; Dialogue homme machine</FD>
<ED>Peer to peer; Digital information; Information delivery; Storage capacity; Availability; Performance evaluation; Scalability; Quasi static theory; Hashing; Discrete Hartley transforms; Replication; User interface; Implementation; Middleware; Interception; Resource sharing; Computer network; Man machine dialogue</ED>
<SD>Par a par; Información numérica; Entrega informacíon; Capacidad almacenaje; Disponibilidad; Evaluación prestación; Estensibilidad; Teoría cuasiestática; Hashing; Replicación; Interfase usuario; Implementación; Logicial personalizado; Intercepción; Partición recursos; Red informática; Diálogo hombre máquina</SD>
<LO>INIST-17220.354000191810730020</LO>
<ID>10-0394735</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000207 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000207 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:10-0394735
   |texte=   Building a collaborative peer-to-peer wiki system on a structured overlay
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Building a collaborative peer-to-peer wiki system on a structured overlay

Building a collaborative peer-to-peer wiki system on a structured overlay

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri