Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kristof Jannes

dblp:238/1765 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
0000-0002-2814-0350ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
byzantine fault tolerance
0.712023
BeauForT: Robust Byzantine Fault Tolerance for Client-Centric Mobile Web Applications · IEEE Trans. Parallel Distributed Syst. 2023
Distributed systems › replication › replicated data types
conflict-free replicated data types
0.512021
OWebSync: Seamless Synchronization of Distributed Web Clients · IEEE Trans. Parallel Distributed Syst. 2021
Distributed systems
data synchronization
0.512021
OWebSync: Seamless Synchronization of Distributed Web Clients · IEEE Trans. Parallel Distributed Syst. 2021

Methods — techniques the papers use, named apart from their topics

state-based synchronization · 0.7optimistic gossip protocol · 0.7virtual merkle-tree levels · 0.5state-based CRDT · 0.5merkle tree · 0.5
YearPublicationVenuePosition
2023 BeauForT: Robust Byzantine Fault Tolerance for Client-Centric Mobile Web Applications
abstract
In recent years, part of the web is shifting to a client-centric, decentralized model where web clients become the leading execution environment for application logic and data storage. However, current solutions to build decentralized web applications with multiple distrusting parties often involve a decentralized backend of servers running a BFT protocol between them. Existing consensus protocols using either all-to-all communication, or leader-based gossip suffer from performance degradation in unstable network conditions. In this paper, we present BeauForT, a purely browser-based platform for decentralized BFT consensus in client-centric, community-driven applications. We propose a novel, optimistic, leaderless, gossip-based consensus protocol, tolerating Byzantine replicas, combined with a robust and efficient state-based synchronization protocol. This protocol makes BeauForT well suited for the decentralized client-centric web and its dynamic nature with many network disruptions or node failures.
Kristof Jannes, Emad Heydari Beni, Bert Lagaisse, Wouter Joosen
IEEE Trans. Parallel Distributed Syst.1
2021 ThunQ: A Distributed and Deep Authorization Middleware for Early and Lazy Policy Enforcement in Microservice Applications
Martijn Sauwens, Emad Heydari Beni, Kristof Jannes, Bert Lagaisse, Wouter Joosen
ICSOC3
2021 OWebSync: Seamless Synchronization of Distributed Web Clients
abstract
Many enterprise software services are adopting a fully web-based architecture for both internal line-of-business applications and for online customer-facing applications. Although wireless connections are becoming more ubiquitous and faster, mobile employees and customers are often offline due to expected or unexpected network disruptions. Nevertheless, continuous operation of the software is expected. This article presents OWebSync: a web-based middleware for data synchronization in interactive groupware with fast resynchronization of offline clients and continuous, interactive synchronization of online clients. To automatically resolve conflicts, OWebSync implements a fine-grained data synchronization model and leverages state-based Conflict-free Replicated Data Types. This middleware uses Merkle-trees embedded in the tree-structured data and virtual Merkle-tree levels to achieve the required interactive performance. Our comparative evaluation with available operation-based and delta-state-based middleware solutions shows that OWebSync is especially better in operating in and recovering from offline settings and network disruptions. In addition, OWebSync scales more efficiently over time, as it does not store version vectors or other meta-data for all past clients.
Kristof Jannes, Bert Lagaisse, Wouter Joosen
IEEE Trans. Parallel Distributed Syst.1