Options
Rivière, Etienne
Nom
Rivière, Etienne
Affiliation principale
Fonction
Ancien.ne collaborateur.trice
Identifiants
Résultat de la recherche
Voici les éléments 1 - 10 sur 17
- PublicationRestriction temporaireSAFETHINGS: Data Security by Design in the IoT(2017)
; ; ; Voulgaris, Spyros - PublicationMétadonnées seulementEvaluating the Cost and Robustness of Self-organizing Distributed Hash Tables(: Springer, 2016-6-5)
; ; ; Self-organizing construction principles are a natural fit for large-scale distributed system in unpredictable deployment environments. These principles allow a system to systematically converge to a global state by means of simple, uncoordinated actions by individual peers. Indexing services based on the distributed hash table (DHT) abstraction have been established as a solid foundation for large-scale distributed applications. For most DHTs, the creation and maintenance of the overlay structure relies on the exploration and update of an already stabilized structure. We evaluate in this paper the practical interest of self-organizing principles, and in particular gossip-based overlay construction protocols, to bootstrap and maintain various DHT implementations. Based on the seminal work on T-Chord, a self-organizing version of Chord using the T-Man overlay construction service, we contribute three additional self-organizing DHTs: T-Pastry, T-Kademlia and T-Kelips. We conduct an experimental evaluation of the cost and performance of each of these designs using a prototype implementation. Our conclusion is that, while providing equivalent performance in a stabilized system, self-organizing DHTs are able to sustain and recover from higher level of churn than their explicitly-created counterparts, and should therefore be considered as a method of choice for deploying robust indexing layers in adverse environments. - PublicationRestriction temporaireGlobalFS: A Strongly Consistent Multi-site File System(2016)
; ; ; - PublicationRestriction temporaireUniCrawl: A Practical Geographically Distributed Web Crawler(2015)
; ; ; - PublicationRestriction temporaireTOPiCo: detecting most frequent items from multiple high-rate event streams(2015)
; ; ; ; - PublicationMétadonnées seulementLayStream: composing standard gossip protocols for live video streaming(: IEEE, 2014-9-8)
; ; ; Oliveira, RuiGossip-based live streaming is a popular topic, as attested by the vast literature on the subject. Despite the particular merits of each proposal, all need to implement and deal with common challenges such as membership management, topology construction and video packets dissemination. Well-principled gossip-based protocols have been proposed in the literature for each of these aspects. Our goal is to assess the feasibility of building a live streaming system, LAYSTREAM, as a composition of these existing protocols, to deploy the resulting system on real testbeds, and report on lessons learned in the process. Unlike previous evaluations conducted by simulations and considering each protocol independently, we use real deployments. We evaluate protocols both independently and as a layered composition, and unearth specific problems and challenges associated with deployment and composition. We discuss and present solutions for these, such as a novel topology construction mechanism able to cope with the specificities of a large-scale and delay-sensitive environment, but also with requirements from the upper layer. Our implementation and data are openly available to support experimental reproducibility. - PublicationAccès libreAutonomous Multi-Dimensional Slicing for Large-Scale Distributed SystemsSlicing is a distributed systems primitive that allows to autonomously partition a large set of nodes based on node-local attributes. Slicing is decisive for automatically provisioning system resources for different services, based on their requirements or importance. One of the main limitations of existing slicing protocols is that only single dimension attributes are considered for partitioning. In practical settings, it is often necessary to consider best compromises for an ensemble of metrics. In this paper we propose an extension of the slicing primitive that allows multi-attribute distributed systems slicing.Our protocol employs a gossip-based approach that does not require centralized knowledge and allows self-organization. It leverages the notion of domination between nodes, forming a partial order between multi-dimensional points, in a similar way to SkyLine queries for databases. We evaluate and demonstrate the interest of our approach using large-scale simulations.
- PublicationRestriction temporaireLAYSTREAM: Composing standard gossip protocols for live video streaming(2014)
; ; ; Oliveira, Rui - PublicationRestriction temporaireOn the Support of Versioning in Distributed Key-Value Stores(2014)
; ; ; ; ; - PublicationRestriction temporaireLightweight, efficient, robust epidemic dissemination(2013)
; ;