| TÃtulo : |
21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Ghaffari, Mohsen, ; Nesterenko, Mikhail, ; Tixeuil, Sebastien, ; Tucci, Sara, ; Yamauchi, Yukiko, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2019 |
| Número de páginas: |
XXIII, 384 p. 304 ilustraciones, 54 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-34992-9 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Idioma : |
Inglés (eng) |
| Palabras clave: |
Red de computadoras Sistemas informáticos Computadoras Propósitos especiales Sistemas operativos (computadoras) Software de la aplicacion Informática Redes de comunicación informática Implementación de sistema informático Sistemas de propósito especial y basados ​​en aplicaciones Sistemas operativos Aplicaciones informáticas y de sistemas de información Matemáticas de la Computación |
| Clasificación: |
004.6 Ciencia de los computadores (Interfaces y comunicaciones) |
| Resumen: |
Este libro constituye las actas arbitradas del 21.º Simposio Internacional sobre Estabilización, Seguridad y Protección de Sistemas Distribuidos, SSS 2019, celebrado en Pisa, Italia, en octubre de 2019. Los 21 artÃculos completos presentados fueron cuidadosamente revisados ​​y seleccionados entre 45 presentaciones. Los artÃculos abordan el diseño y desarrollo de sistemas distribuidos con enfoque en sistemas que sean capaces de brindar garantÃas sobre su estructura, desempeño y/o seguridad frente a un entorno operativo adverso. |
| Nota de contenido: |
Invited Paper: On the Characterization of Blockchain Consensus under Incentives -- Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots -- Stationary and Deterministic Leader Election in Self-Organizing Particle Systems -- Robust Privacy-Preserving Gossip Averaging -- Synchronous t-Resilient Consensus in Arbitrary Graphs -- Tasks in Modular Proofs of Concurrent Algorithms -- On Gathering of Semi-Synchronous Robots in Graphs -- Brief Announcement: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree Construction -- Brief Announcement: Distributed Computing in the Asynchronous LOCAL model -- An Environment for Specifying and Model Checking Mobile Ring Robot Algorithms -- Brief Announcement: Self-Stabilizing LCM Schedulers for Autonomous Mobile Robots using Neighborhood Mutual Remainder -- Reducing the Number of Messages in Self-stabilizing Protocols -- A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory -- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view -- iperfTZ: Understanding Network Bottlenecks for TrustZone-based Trusted Applications -- Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity -- Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems -- Improved-Zigzag: An improved local-information based self-optimizing routing algorithm in virtual grid networks -- Fault Tolerant Network Constructors -- Ring Exploration of Myopic Luminous Robots with Visibility More than One -- Brief Announcement: Self-Stabilizing Construction of a Minimal Weakly nmathcal{ST}-Reachable Directed Acyclic Graph -- Adaptive Versioning in Transactional Memories -- Brief Announcement: Blockguard: Adaptive Blockchain Security -- Brief Announcement: Fully Anonymous Shared Memory Algorithms -- A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus -- Logarithmic Expected-Time Leader Election in Population Protocol Model -- A Self-stabilizing 1-maximal Independent Set Algorithm -- Black hole search despite Byzantine agents -- Self-Adjusting Linear Networks. |
| Tipo de medio : |
Computadora |
| Summary : |
This book constitutes the refereed proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019, held in Pisa, Italy, in October 2019. The 21 full papers presented were carefully reviewed and selected from 45 submissions. The papers deal with the design and development of distributed systems with a focus on systems that are able to provide guarantees on their structure, performance, and/or security in the face of an adverse operational environment. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings [documento electrónico] / Ghaffari, Mohsen, ; Nesterenko, Mikhail, ; Tixeuil, Sebastien, ; Tucci, Sara, ; Yamauchi, Yukiko, . - 1 ed. . - [s.l.] : Springer, 2019 . - XXIII, 384 p. 304 ilustraciones, 54 ilustraciones en color. ISBN : 978-3-030-34992-9 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés ( eng)
| Palabras clave: |
Red de computadoras Sistemas informáticos Computadoras Propósitos especiales Sistemas operativos (computadoras) Software de la aplicacion Informática Redes de comunicación informática Implementación de sistema informático Sistemas de propósito especial y basados ​​en aplicaciones Sistemas operativos Aplicaciones informáticas y de sistemas de información Matemáticas de la Computación |
| Clasificación: |
004.6 Ciencia de los computadores (Interfaces y comunicaciones) |
| Resumen: |
Este libro constituye las actas arbitradas del 21.º Simposio Internacional sobre Estabilización, Seguridad y Protección de Sistemas Distribuidos, SSS 2019, celebrado en Pisa, Italia, en octubre de 2019. Los 21 artÃculos completos presentados fueron cuidadosamente revisados ​​y seleccionados entre 45 presentaciones. Los artÃculos abordan el diseño y desarrollo de sistemas distribuidos con enfoque en sistemas que sean capaces de brindar garantÃas sobre su estructura, desempeño y/o seguridad frente a un entorno operativo adverso. |
| Nota de contenido: |
Invited Paper: On the Characterization of Blockchain Consensus under Incentives -- Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots -- Stationary and Deterministic Leader Election in Self-Organizing Particle Systems -- Robust Privacy-Preserving Gossip Averaging -- Synchronous t-Resilient Consensus in Arbitrary Graphs -- Tasks in Modular Proofs of Concurrent Algorithms -- On Gathering of Semi-Synchronous Robots in Graphs -- Brief Announcement: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree Construction -- Brief Announcement: Distributed Computing in the Asynchronous LOCAL model -- An Environment for Specifying and Model Checking Mobile Ring Robot Algorithms -- Brief Announcement: Self-Stabilizing LCM Schedulers for Autonomous Mobile Robots using Neighborhood Mutual Remainder -- Reducing the Number of Messages in Self-stabilizing Protocols -- A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory -- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view -- iperfTZ: Understanding Network Bottlenecks for TrustZone-based Trusted Applications -- Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity -- Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems -- Improved-Zigzag: An improved local-information based self-optimizing routing algorithm in virtual grid networks -- Fault Tolerant Network Constructors -- Ring Exploration of Myopic Luminous Robots with Visibility More than One -- Brief Announcement: Self-Stabilizing Construction of a Minimal Weakly nmathcal{ST}-Reachable Directed Acyclic Graph -- Adaptive Versioning in Transactional Memories -- Brief Announcement: Blockguard: Adaptive Blockchain Security -- Brief Announcement: Fully Anonymous Shared Memory Algorithms -- A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus -- Logarithmic Expected-Time Leader Election in Population Protocol Model -- A Self-stabilizing 1-maximal Independent Set Algorithm -- Black hole search despite Byzantine agents -- Self-Adjusting Linear Networks. |
| Tipo de medio : |
Computadora |
| Summary : |
This book constitutes the refereed proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019, held in Pisa, Italy, in October 2019. The 21 full papers presented were carefully reviewed and selected from 45 submissions. The papers deal with the design and development of distributed systems with a focus on systems that are able to provide guarantees on their structure, performance, and/or security in the face of an adverse operational environment. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
|  |
Crear una solicitud de compra Refinar búsqueda21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings / Ghaffari, Mohsen ; Nesterenko, Mikhail ; Tixeuil, Sebastien ; Tucci, Sara ; Yamauchi, Yukiko
