Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010, Proceedings / / edited by Shlomi Dolev, Jorge Cobb, Michael Fischer, Moti Yung |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XVI, 614 p. 150 illus.) |
Disciplina | 004.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Data protection
Computer networks User interfaces (Computer systems) Human-computer interaction Computers, Special purpose Computer science Algorithms Data and Information Security Computer Communication Networks User Interfaces and Human Computer Interaction Special Purpose and Application-Based Systems Theory of Computation |
ISBN |
1-280-38939-7
9786613567314 3-642-16023-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited 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. |
Record Nr. | UNISA-996466256703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Stabilization, safety, and security of distributed systems : 12th International Symposium, SSS 2010, New York, N.Y., USA, September 20-22, 2010 : proceedings / / Shlomi Dolev, Jorge Cobb, Michael Fischer (eds.) |
Edizione | [1st ed.] |
Pubbl/distr/stampa | New York, : Springer, 2010 |
Descrizione fisica | 1 online resource (XVI, 614 p. 150 illus.) |
Disciplina | 004.6 |
Altri autori (Persone) |
DolevShlomi
CobbJorge FischerMichael |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Soggetto topico |
Self-stabilization (Computer science)
Distributed operating systems (Computers) - Security measures |
ISBN |
1-280-38939-7
9786613567314 3-642-16023-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited 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. |
Record Nr. | UNINA-9910484184803321 |
New York, : Springer, 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|