國立虎尾科技大學 |

Stabilization, Safety, and Security of Distributed Systems = 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Stabilization, Safety, and Security of Distributed Systems/ edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi.
Reminder of title:	21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings /
other author:	Ghaffari, Mohsen.
Description:	XXIII, 384 p. 304 illus., 54 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer communication systems. -
Online resource:	https://doi.org/10.1007/978-3-030-34992-9
ISBN:	9783030349929

Stabilization, Safety, and Security of Distributed Systems = 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings /
Stabilization, Safety, and Security of Distributed Systems21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings /[electronic resource] :edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi. - 1st ed. 2019. - XXIII, 384 p. 304 illus., 54 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11914. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783030349929

Standard No.: 10.1007/978-3-030-34992-9doiSubjects--Topical Terms:

1115394
Computer communication systems.

LC Class. No.: TK5105.5-5105.9

Dewey Class. No.: 004.6

Stabilization, Safety, and Security of Distributed Systems = 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings /
LDR:04291nam a22004095i 4500 001 1010207
003 DE-He213
005 20200629175436.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030349929 $9 978-3-030-34992-9
024 7 $a 10.1007/978-3-030-34992-9 $2 doi
035 $a 978-3-030-34992-9
050 4 $a TK5105.5-5105.9
072 7 $a UKN $2 bicssc
072 7 $a COM075000 $2 bisacsh
072 7 $a UKN $2 thema
082 0 4 $a 004.6 $2 23
245 1 0 $a Stabilization, Safety, and Security of Distributed Systems $h [electronic resource] : $b 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings / $c edited by Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXIII, 384 p. 304 illus., 54 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11914
505 0 $a 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.
520 $a 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.
650 0 $a Computer communication systems. $3 1115394
650 0 $a Architecture, Computer. $3 1255731
650 0 $a Special purpose computers. $3 1204562
650 0 $2 lc $a Operating systems (Computers). $3 868175
650 0 $a Application software. $3 528147
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Computer System Implementation. $3 669803
650 2 4 $a Special Purpose and Application-Based Systems. $3 669833
650 2 4 $a Operating Systems. $3 669804
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Mathematics of Computing. $3 669457
700 1 $a Ghaffari, Mohsen. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304254
700 1 $a Nesterenko, Mikhail. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304255
700 1 $a Tixeuil, Sébastien. $e editor. $1 https://orcid.org/0000-0002-0948-7172 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304256
700 1 $a Tucci, Sara. $e editor. $1 https://orcid.org/0000-0001-9738-9021 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304257
700 1 $a Yamauchi, Yukiko. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1304258
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030349912
776 0 8 $i Printed edition: $z 9783030349936
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-34992-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)