Stabilization, Safety, and Security of Distributed Systems
Springer Berlin (Verlag)
978-3-642-33535-8 (ISBN)
Communication-Efficient Self-stabilization in Wireless Networks.- Self-stabilizing Local k-Placement of Replicas with Minimal Variance.- Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles.- Brief Announcement: Self-stabilizing Synchronization of Arbitrary Digraphs in Presence of Faults.- Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network.- On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings.- Optimal Grid Exploration by Asynchronous Oblivious Robots.- Terminating Population Protocols via Some Minimal Global Knowledge Assumptions.- Brief Announcement: The Degrading Effect of Forgetting on a Synchronizer.- Brief Announcement: Mobile Agent Rendezvous on Edge Evolving Rings.- High-Level Executable Specifications of Distributed Algorithms .- Formal Verification of Security Preservation for Migrating Virtual Machines in the Cloud .- Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback .- Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks (Extended Abstract) .- Self-stabilizing Distributed Data Fusion .- From Self- to Self-stabilizing with Service Guarantee 1-hopWeight-Based Clustering .- Brief Announcement: Verification of Stabilizing Programs with SMT Solvers .- Brief Announcement: MP-State: State-Aware Software Model Checking of Message-Passing Systems.- Oblivious Assignment with m Slots.- BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters.- DQMP: A Decentralized Protocol to Enforce Global Quotas in Cloud Environments.- Brief Announcement: KARYON: Towards Safety Kernels for Cooperative Vehicular Systems.- Brief Announcement: Arbitrators in the Security Infrastructure.- Optimization in a Self-stabilizing Service Discovery Framework for Large Scale Systems.- Scalable Byzantine Agreement with a Random Beacon.- On FindingBetter Friends in Social Networks.- Brief Announcement: Detecting Users' Connectivity on Online Social Networks.- Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols.- All-to-All Gradecast Using Coding with Byzantine Failures.- Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents.- A Theory of Fault Recovery for Component-Based Models.
| Erscheint lt. Verlag | 22.8.2012 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIX, 330 p. 70 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 551 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Informatik ► Netzwerke ► Sicherheit / Firewall | |
| Mathematik / Informatik ► Informatik ► Software Entwicklung | |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | Algorithm analysis and problem complexity • Dependable Systems • Dynamic Networks • Model Checking • self-managing systems • Vehicular networking • Verteilte Systeme |
| ISBN-10 | 3-642-33535-7 / 3642335357 |
| ISBN-13 | 978-3-642-33535-8 / 9783642335358 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
