Stabilization, Safety, and Security of Distributed Systems
Springer Berlin (Verlag)
978-3-540-76626-1 (ISBN)
The Power of Cryptographic Attacks: Is Your Network Really Secure Against Side Channels Attacks and Malicious Faults?.- Role-Based Self-configuration of Sensor Networks.- Robots and Molecules.- Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency.- Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model.- Decentralized Detector Generation in Cooperative Intrusion Detection Systems.- Stabilizing Flocking Via Leader Election in Robot Networks.- Stabilization in Dynamic Systems with Varying Equilibrium.- Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems.- Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance.- On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.- Stability of the Multiple-Access Channel Under Maximum Broadcast Loads.- Stabilization of Flood Sequencing Protocols in Sensor Networks.- Stabilization of Loop-Free Redundant Routing.- Secure Failure Detection in TrustedPals.- Probabilistic Fault-Containment.- Self* Minimum Connected Covers of Query Regions in Sensor Networks.- Robust Stabilizing Leader Election.- Byzantine Self-stabilizing Pulse in a Bounded-Delay Model.- Magnifying Computing Gaps Establishing Encrypted Communication over Unidirectional Channels (Extended Abstract).- Stabilizing Trust and Reputation for Self-Stabilizing Efficient Hosts in Spite of Byzantine Guests (Extended Abstract).- r-Semi-Groups: A Generic Approach for Designing Stabilizing Silent Tasks.- Global Predicate Detection in Distributed Systems with Small Faults.- The Truth System: Can a System of Lying Processes Stabilize?.- Temporal Partition in Sensor Networks.- Secure and Self-stabilizing Clock Synchronization in SensorNetworks.- On the Probabilistic Omission Adversary.- Upper Bounds for Stabilization in Acyclic Preference-Based Systems.- A Self-stabilizing Weighted Matching Algorithm.- Self-stabilization and Virtual Node Layer Emulations.
| Erscheint lt. Verlag | 6.11.2007 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIII, 414 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 644 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Netzwerke |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Schlagworte | Adaptive Systems • algorithm • Algorithm analysis and problem complexity • algorithms • Autonomic Systems • Configuration • data and code stabilization • Fault • Fault-Tolerant Systems • Hardcover, Softcover / Informatik, EDV/Datenkommunikation, Netzwerke • HC/Informatik, EDV/Datenkommunikation, Netzwerke • network topologies • overlays • peer-to-peer networks • proactive security • programming • reliable and dependable systems • robot • Routing • safety critical systems • security • self-assembling systems • self-managed systems • Self-Stabilizing Systems • semantics of trust • trust models and specifications • wireless mesh networks |
| ISBN-10 | 3-540-76626-X / 354076626X |
| ISBN-13 | 978-3-540-76626-1 / 9783540766261 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
