Semantic wikis distributed on structured peer-to-peer , 2018
P2P Semantic wikis were initially developed as collaborative editors with two main goals in mind:... more P2P Semantic wikis were initially developed as collaborative editors with two main goals in mind: (1) ensure a massive collaborative editing in semantic wikis with low maintenance cost where thousands of users can participate in the wiki edition and (2) provide fault tolerance for semantic wikis. Their goals were attained through the adoption of an optimistic replication of their data (semantic wiki pages and annotations) on a set of interconnected semantic wiki servers. The edition of the semantic wiki pages and the execution of semantic queries are now distributed on different peers. Two Peer-to-Peer Semantic Wikis were developed, Swooki and DSMW. They are based on unstructured P2P network where each peer knows its neighbors without any knowledge about their contents. In spite of their advantages, Swooki will face scalability problem regarding the size of data that it is dealing with since it uses a total replication of the entire wiki pages and the triples store, it will be only suitable for small wikis, and DSMW semantic queries may return different and incomplete results since every peer has its own semantic wiki pages and annotations. In this paper, we propose to handle the problems of unstructured P2PSW by building Structured P2P semantic wiki (SP2PSW).The research work proposes all the possible approaches to build SP2PSW, evaluates each approach based on many standard evaluation metrics, derives the optimal one and develops the needed algorithms. At the end, a comparison with the existing unstructured P2PSW (Swooki and DSMW) shows the marked improvement of SP2PSW over Unstructured P2PSW.
Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, tr... more Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, trades prompt consistency for high availability. Although, this model has shown to be promising and greatly adopted by industry, the state of the art only assumes that replicas can crash and recover. However , a Byzantine replica (i.e., arbitrary or malicious) can hamper the eventual convergence of replicas to a global consistent state, thus compromising the entire service. Classical BFT state machine replication protocols cannot solve this problem due to the blocking nature of consensus, something that is at odds with the availability via replica divergence in the EC model. In this work in progress paper, we introduce a new secure highly available protocol for the EC model that assumes a fraction of replicas and any client can be Byzantine. To respect the essence of EC, the protocol gives priority to high availability, and thus Byzantine detection is performed off the critical path on a consistent data offset. The paper concisely explains the protocol and discusses its feasibility. We aim at presenting a more comprehensive and empirical study in the future.
Semantic wikis distributed on structured peer-to-peer , 2018
P2P Semantic wikis were initially developed as collaborative editors with two main goals in mind:... more P2P Semantic wikis were initially developed as collaborative editors with two main goals in mind: (1) ensure a massive collaborative editing in semantic wikis with low maintenance cost where thousands of users can participate in the wiki edition and (2) provide fault tolerance for semantic wikis. Their goals were attained through the adoption of an optimistic replication of their data (semantic wiki pages and annotations) on a set of interconnected semantic wiki servers. The edition of the semantic wiki pages and the execution of semantic queries are now distributed on different peers. Two Peer-to-Peer Semantic Wikis were developed, Swooki and DSMW. They are based on unstructured P2P network where each peer knows its neighbors without any knowledge about their contents. In spite of their advantages, Swooki will face scalability problem regarding the size of data that it is dealing with since it uses a total replication of the entire wiki pages and the triples store, it will be only suitable for small wikis, and DSMW semantic queries may return different and incomplete results since every peer has its own semantic wiki pages and annotations. In this paper, we propose to handle the problems of unstructured P2PSW by building Structured P2P semantic wiki (SP2PSW).The research work proposes all the possible approaches to build SP2PSW, evaluates each approach based on many standard evaluation metrics, derives the optimal one and develops the needed algorithms. At the end, a comparison with the existing unstructured P2PSW (Swooki and DSMW) shows the marked improvement of SP2PSW over Unstructured P2PSW.
Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, tr... more Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, trades prompt consistency for high availability. Although, this model has shown to be promising and greatly adopted by industry, the state of the art only assumes that replicas can crash and recover. However , a Byzantine replica (i.e., arbitrary or malicious) can hamper the eventual convergence of replicas to a global consistent state, thus compromising the entire service. Classical BFT state machine replication protocols cannot solve this problem due to the blocking nature of consensus, something that is at odds with the availability via replica divergence in the EC model. In this work in progress paper, we introduce a new secure highly available protocol for the EC model that assumes a fraction of replicas and any client can be Byzantine. To respect the essence of EC, the protocol gives priority to high availability, and thus Byzantine detection is performed off the critical path on a consistent data offset. The paper concisely explains the protocol and discusses its feasibility. We aim at presenting a more comprehensive and empirical study in the future.
Uploads
Papers by Houssam Yactine