Stabilization, Safety, and Security of Distributed Systems
Home > Computing and Information Technology > Computer hardware > Network hardware > Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings

Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the refereed proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009, held in Lyon, France, in November 2009. The 49 revised full papers and 14 brief announcements presented together with three invited talks were carefully reviewed and selected from 126 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 special topics were alternative systems and models, autonomic computational science, cloud computing, embedded systems, fault-tolerance in distributed systems / dependability, formal methods in distributed systems, grid computing, mobility and dynamic networks, multicore computing, peer-to-peer systems, self-organizing systems, sensor networks, stabilization, and system safety and security.

Table of Contents:
Invited Talks.- Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE.- Local Algorithms: Self-stabilization on Speed.- As Good as It Gets: Competitive Fault Tolerance in Network Structures.- Regular Papers.- Multicore Constraint-Based Automated Stabilization.- A Theory of Network Tracing.- Developing Autonomic and Secure Virtual Organisations with Chemical Programming.- Making Population Protocols Self-stabilizing.- Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios.- Consensus When All Processes May Be Byzantine for Some Time.- A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees.- Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is the End of the Road?.- Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks.- FoG: Fighting the Achilles’ Heel of Gossip Protocols with Fountain Codes.- How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?.- Fault-Containment in Weakly-Stabilizing Systems.- Stability of Distributed Algorithms in the Face of Incessant Faults.- Dependability Engineering of Silent Self-stabilizing Systems.- Robustness and Dependability of Self-Organizing Systems - A Safety Engineering Perspective.- Efficient Robust Storage Using Secret Tokens.- An Optimal Self-stabilizing Firing Squad.- Anonymous Transactions in Computer Networks.- Nash Equilibria in Stabilizing Systems.- ACCADA: A Framework for Continuous Context-Aware Deployment and Adaptation.- A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks.- Separation of Circulating Tokens.- Visiting Gafni’s Reduction Land: From the BG Simulation to the Extended BG Simulation.- Randomized Gathering of Mobile Robots withLocal-Multiplicity Detection.- Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat.- CFlood: A Constrained Flooding Protocol for Real-time Data Delivery in Wireless Sensor Networks.- Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links.- Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler.- Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision.- Finding Good Partners in Availability-Aware P2P Networks.- Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables.- Distributed Power Control with Multiple Agents in a Distributed Base Station Scheme Using Macrodiversity.- Redundancy Maintenance and Garbage Collection Strategies in Peer-to-Peer Storage Systems.- Model Checking Coalition Nash Equilibria in MAD Distributed Systems.- OpenMP Support for NBTI-Induced Aging Tolerance in MPSoCs.- A Self-stabilizing Algorithm for Graph Searching in Trees.- A Metastability-Free Multi-synchronous Communication Scheme for SoCs.- From Local Impact Functions to Global Adaptation of Service Compositions.- A Wireless Security Framework without Shared Secrets.- Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.- Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning.- Network-Friendly Gossiping.- Black Hole Search with Tokens in Interconnected Networks.- Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model.- Speculation for Parallelizing Runtime Checks.- Optimistic Fair Exchange Using Trusted Devices.- Application Data Consistency Checking for Anomaly Based Intrusion Detection.- Self Adaptive High Interaction Honeypots Driven by Game Theory.- Cooperative Autonomic Management in Dynamic Distributed Systems.- Brief Announcements.- Brief Announcement: Consistent Fixed Points and Negative Gain.- Brief Announcement: Induced Churn to Face Adversarial Behavior in Peer-to-Peer Systems.- Safer Than Safe: On the Initial State of Self-stabilizing Systems.- Brief Announcement: Unique Permutation Hashing.- Randomization Adaptive Self-stabilization.- Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.- Brief Announcement: An OS Architecture for Device Self-protection.- Brief Announcement: Towards Secure Cloud Computing.- Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.- Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks.- Relocation Analysis of Stabilizing MAC.- Brief Announcement: A Simple and Quiescent Omega Algorithm in the Crash-Recovery Model.- Brief Announcement: How to Overcome the Limits of Bounds.- Brief Announcement: The Design and Evaluation of a Distributed Reliable File System.


Best Sellers


Product Details
  • ISBN-13: 9783642051173
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 801
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3642051170
  • Publisher Date: 26 Oct 2009
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!