000 05861nam a22005895i 4500
001 978-3-642-16023-3
003 DE-He213
005 20140220084548.0
007 cr nn 008mamaa
008 100919s2010 gw | s |||| 0|eng d
020 _a9783642160233
_9978-3-642-16023-3
024 7 _a10.1007/978-3-642-16023-3
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM075000
_2bisacsh
082 0 4 _a004.6
_223
100 1 _aDolev, Shlomi.
_eeditor.
245 1 0 _aStabilization, Safety, and Security of Distributed Systems
_h[electronic resource] :
_b12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings /
_cedited by Shlomi Dolev, Jorge Cobb, Michael Fischer, Moti Yung.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXVI, 614p. 150 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6366
505 0 _aInvited Talks Abstracts -- Arcane Information, Solving Relations, and Church Censorship -- Computation of Equilibria and Stable Solutions -- A Geometry of Networks -- Contributed Papers -- Systematic Correct Construction of Self-stabilizing Systems: A Case Study -- A Fault-Resistant Asynchronous Clock Function -- Self-stabilizing Leader Election in Dynamic Networks -- Loop-Free Super-Stabilizing Spanning Tree Construction -- A New Technique for Proving Self-stabilizing under the Distributed Scheduler -- A Tranformational Approach for Designing Scheduler-Oblivious Self-stabilizing Algorithms -- On Byzantine Containment Properties of the min?+?1 Protocol -- Efficient Self-stabilizing Graph Searching in Tree Networks -- Adaptive Containment of Time-Bounded Byzantine Faults -- Brief Announcement: Fast Convergence in Route-Preservation -- Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure -- On Applicability of Random Graphs for Modeling Random Key Predistribution for Wireless Sensor Networks -- “Slow Is Fast” for Wireless Sensor Networks in the Presence of Message Losses -- Modeling and Analyzing Periodic Distributed Computations -- Complexity Issues in Automated Model Revision without Explicit Legitimate State -- Algorithmic Verification of Population Protocols -- Energy Management for Time-Critical Energy Harvesting Wireless Sensor Networks -- Stably Decidable Graph Languages by Mediated Population Protocols -- Broadcasting in Sensor Networks of Unknown Topology in the Presence of Swamping -- Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage -- Brief Announcement: On the Hardness of Topology Inference -- Self-stabilizing Algorithm of Two-Hop Conflict Resolution -- Low Memory Distributed Protocols for 2-Coloring -- Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility -- Computing in Social Networks -- On Transactional Scheduling in Distributed Transactional Memory Systems -- Recursion in Distributed Computing -- On Adaptive Renaming under Eventually Limited Contention -- RobuSTM: A Robust Software Transactional Memory -- A Provably Starvation-Free Distributed Directory Protocol -- Lightweight Live Migration for High Availability Cluster Service -- Approximation of ?-Timeliness -- A Framework for Adaptive Optimization of Remote Synchronous CSCW in the Cloud Computing Era -- Chameleon-MAC: Adaptive and Self-? Algorithms for Media Access Control in Mobile Ad Hoc Networks -- A Comparative Study of Rateless Codes for P2P Persistent Storage -- Dynamically Reconfigurable Filtering Architectures -- A Quantitative Analysis of Redundancy Schemes for Peer-to-Peer Storage Systems -- A Framework for Secure and Private P2P Publish/Subscribe -- Snap-Stabilizing Linear Message Forwarding -- Vulnerability Analysis of High Dimensional Complex Systems -- Storage Capacity of Labeled Graphs -- Safe Flocking in Spite of Actuator Faults.
520 _aThis book constitutes the refereed proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2010, held in New York, USA, in September 2010. The 39 revised full papers were carefully reviewed and selected from 90 submissions. The papers address all safety and security-related aspects of self-stabilizing systems in various areas. The most topics related to self-* systems. The tracks were: self-stabilization; self-organization; ad-hoc, sensor, and dynamic networks; peer to peer; fault-tolerance and dependable systems; safety and verification; swarm, amorphous, spatial, and complex systems; security; cryptography, and discrete distributed algorithms.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aSoftware engineering.
650 0 _aData protection.
650 0 _aComputer software.
650 0 _aInformation Systems.
650 1 4 _aComputer Science.
650 2 4 _aComputer Communication Networks.
650 2 4 _aSpecial Purpose and Application-Based Systems.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aSystems and Data Security.
650 2 4 _aManagement of Computing and Information Systems.
700 1 _aCobb, Jorge.
_eeditor.
700 1 _aFischer, Michael.
_eeditor.
700 1 _aYung, Moti.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642160226
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6366
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-16023-3
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112759
_d112759