Distibuted Systems

Name: Distibuted Systems | Design and Algorithms
Brand: Wiley-ISTE
Price: 144.99 EUR
Availability: OnlineOnly

Design and Algorithms

Serge Haddad Fabrice Kordon Laurent Pautet Laure Petrucci(Herausgeber*in)

Wiley-ISTE (Verlag)

Erschienen am 9. Januar 2013

336 Seiten

E-Book

ePUB mit Adobe-DRM

Systemvoraussetzungen

978-1-118-60139-6 (ISBN)

144,99 €inkl. 7% MwSt.

Systemvoraussetzungen

für ePUB mit Adobe-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Title Page
Copyright
Foreword
Chapter 1: Introduction
First Part. Large Scale Peer-to-Peer Distributed Systems
Chapter 2: Introduction to Large-Scale Peer-to-Peer Distributed Systems
2.1. "Large-Scale" distributed systems?
2.2. Consequences of "large-scale"
2.2.1. Communication in large-scale distributed systems
2.2.2. Fault tolerance in large-scale distributed systems
2.2.3. Decision making in large scale distributed systems
2.3. Some large-scale distributed systems
2.3.1. SETI@home
2.3.2. The automated motorway
2.4. Architectures of large scale distributed systems
2.4.1. Remote procedure call
2.4.2. The client/server model
2.4.3. The master/slaves model
2.4.4. The peer-to-peer model
2.4.5. Use of these models
2.5. Objective of Part 1
2.6. Bibliography
Chapter 3: Design Principles of Large-Scale Distributed System
3.1. Introduction to peer-to-peer systems
3.2. The peer-to-peer paradigms
3.2.1. Classification of peer-to-peer systems
3.2.2. Structure of overlay networks
3.3. Services on structured overlays
3.3.1. Services
3.3.2. DHTs
3.4. Building trust in P2P systems
3.4.1. Reputation systems
3.4.2. Accountability
3.4.3. Discussion on reputation sytems and accountability
3.5. Conclusion
3.6. Bibliography
Chapter 4: Peer-to-Peer Storage
4.1. Introduction
4.2. BitTorrent
4.2.1. History
4.2.2. Terminology
4.2.3. Joining a BitTorrent network
4.2.4. Making the pieces available
4.2.5. Priority to rare pieces
4.2.6. The tit-for-tat principle
4.2.7. The optimistic unchoke principle
4.2.8. The messages of the protocol
4.2.9. Conclusion
4.3. Gnutella
4.3.1. History
4.3.2. Architecture of the Gnutella v0.4 network
4.3.3. Implementing Gnutella 0.4
4.3.4. Evolution to Gnutella protocol v0.6
4.4. Conclusion
4.5. Bibliography
Chapter 5: Large-Scale Peer-to-Peer Game Applications
5.1. Introduction
5.1.1. Limitations of the client-server paradigm
5.1.2. The decentralized model
5.2. Large-scale game applications: model and specific requirements
5.2.1. Application model
5.2.2. Main requirements for large-scale game applications
5.2.3. Influence of the avatar mobility on the playability
5.3. Overview of peer-to-peer overlays for large-scale game applications
5.3.1. Unadaptable/inflexible overlays
5.3.2. Overlays reacting to application needs
5.3.3. Anticipating avatar movement to pro-actively adapt the overlays
5.4. Overlays for FPS games
5.4.1. Malleable overlay for range queries
5.4.2. Colyseus
5.4.3. Donnybrook
5.5. Overlays for online life-simulation games
5.5.1. Solipsis overview
5.5.2. Anticipating avatar mobility to pro-actively adapt the overlay
5.6. Conclusion
5.7. Bibliography
Second Part. Distributed, Embedded and Real-Time Systems
Chapter 6: Introduction to Distributed Embedded and Real-time Systems
6.1. Distributed real-time embedded systems
6.1.1. Real-time systems
6.1.2. Embedded systems
6.1.3. Distribution in Real-Time Embedded (DRE) systems
6.2. Safety critical systems as examples of DRE systems
6.2.1. Avionics safety-critical systems
6.2.2. IMA
6.2.3. DO-178B
6.2.4. ARINC 653
6.2.5. ARINC 653 Principles
6.3. Design process of DRE systems
6.3.1. Modeling
6.3.2. Analysis
6.3.3. Implementation
6.3.4. Certification
6.4. Objectives of Part 2
6.5. Bibliography
Chapter 7: Scheduling in Distributed Real-Time Systems
7.1. Introduction
7.2. Generalities about real-time systems
7.2.1. Real-time systems
7.2.2. Synchronous or asynchronous system
7.2.2.1. Asynchronous implementation
7.2.2.2. Synchronous implementation
7.3. Temporal correctness
7.3.1. Feasibility
7.3.2. Principles of the holistic analysis
7.4. WCRT of the tasks
7.4.1. Scheduling algorithms
7.4.2. Modeling the tasks
7.4.3. WCRT for fixed priority scheduling
7.4.3.1. Critical instant
7.4.3.2. Busy period
7.4.3.3. Worst-case response time without release jitter
7.4.3.3.1. Case of constrained deadlines (Di x2264
Ti)
7.4.3.3.2. Case of arbitrary deadlines
7.4.3.4. WCRT with release jitter
7.4.3.5. Critical sections
7.4.4. WCRT analysis for deadline-driven scheduling
7.4.4.1. Busy period
7.4.4.2. WCRT
7.4.4.3. Critical sections
7.5. WCRT of the messages
7.5.1. CAN
7.5.2. Asynchronous transfer mode (ATM) network
7.5.2.1. Delay in the source node
7.5.2.2. Delay in a FIFO within priorities queue
7.5.2.3. Summing up to obtain the WCRT of a message
7.5.2.4. Conclusion and remarks
7.6. Case study
7.6.1. First pass of the holistic analysis
7.6.2. Second pass of the holistic analysis
7.7. Conclusion
7.8. Bibliography
Chapter 8: Software Engineering for Adaptative Embedded Systems
8.1. Introduction
8.2. Adaptation, an additional complexity factor
8.2.1. Adaptation, a step towards autonomy
8.2.2. Autonomy versus predictability
8.3. Theoretical aspects of adaptation management
8.3.1. Coordination of control loops
8.3.2. The safe state problem
8.3.3. Mode switch protocols
8.4. Technical solutions for the design of adaptative embedded systems
8.4.1. Infrastructure dedicated to adaptation
8.4.2. Existing technologies for the adaptation of embedded real-time embedded systems
8.4.3. How to choose of the appropriate technology
8.5. An example of adaptative system from the robotic domain
8.5.1. The pilot system
8.5.2. Avoid mode inconsistencies
8.6. Applying MDE techniques to the design of the robotic use-case
8.6.1. Functional breakdown
8.6.2. Real-time systems specificities
8.6.3. Pseudo-dynamic reconfiguration
8.7. Exploitation of the models
8.7.1. Code generation: the pseudo-dynamic execution step
8.7.2. The choice of the mode switch policy
8.7.3. Illustration of properties of the mode switch protocols
8.8. Conclusion
8.9. Bibliography
Chapter 9: The Design of Aerospace Systems
9.1. Introduction
9.1.1. About space systems complexity
9.1.2. Aim of this chapter
9.2. Flight software typical architecture
9.2.1. OBSW applications
9.2.2. Applications support environment
9.2.3. Execution patterns of space software
9.3. Traditional development methods and their limits
9.3.1. Traditional specification methods
9.3.2. Need for an engineering process
9.4. Modeling a software system using TASTE: philosophy
9.5. Common solutions
9.6. What TASTE specifically proposes
9.7. Modeling process and tools
9.7.1. Interface capture
9.7.2. Deployment and hardware configuration
9.7.3. Behavior modeling
9.7.4. Vertical transformation
9.7.5. Concurrency view editor
9.7.5.1. Other schedulability analysis: MAST
9.7.6. Automatic code generation
9.8. Technology
9.9. Model transformations
9.9.1. Model to model
9.9.2. Model to code
9.9.3. Automated GUIs and regression checking using Python scripts
9.9.4. Generation of interface control documents (ICDs)
9.9.5. ASN1SCC and ACN (ASN.1 Encoding Control Notation)
9.9.6. Support for hardware development
9.10. The TASTE run-time
9.10.1. The Ocarina code generator
9.10.2. The PolyORB-HI middleware and the operating system
9.11. Illustrating our process by designing heterogeneous systems
9.11.1. Case study overview
9.11.2. Data view
9.11.3. Interface view
9.11.4. Generating code skeletons and write application code
9.11.5. Deployment view
9.11.6. Concurrency view and schedulability analysis
9.11.7. Memory overhead metrics
9.12. First user feedback and TASTE future
9.12.1. The future of TASTE
9.13. Conclusion
9.14. Bibliography
Third Part. Security in Distributed Systems
Chapter 10: Introduction to Security Issues in Distributed Systems
10.1. Problem
10.1.1. Safety
10.1.2. Security
10.2. Secure data exchange
10.3. Security in specific distributed systems
10.4. Outline of Part III
10.5. Bibliography
Chapter 11: Practical Security in Distributed Systems
11.1. Introduction
11.1.1. Grid typology
11.1.2. General introduction to security
11.1.3. Case studies
11.1.3.1. OASIS
11.1.3.2. Globus 4
11.1.3.3. ALADDIN-G5K
11.1.3.4. BOINC
11.2. Confidentiality
11.2.1. Data confidentiality
11.2.2. Code confidentiality
11.2.3. Other aspects of confidentiality
11.3. Authentication
11.3.1. Overview of classical authentication schemes
11.3.2. Authentication in the main operating systems
11.3.3. Authentication in volunteer grids
11.3.4. Authentication in clusters
11.3.5. Authentication in computational grids
11.4. Availability and fault tolerance
11.4.1. Monitoring
11.4.2. Failure detection
11.4.3. Fault tolerance in distributed systems
11.4.4. Rollback recovery
11.4.5. Application-driven fault tolerance
11.4.6. Case study
11.5. Ensuring resource security
11.5.1. System enforcing
11.5.2. Trusted computing
11.5.3. TPM (Trusted Platform Modules): Hardware for Trusted Computing
11.6. Result checking in distributed computations
11.6.1. Overview
11.6.2. Result-checking by post-condition
11.6.3. Result-checking by duplication
11.7. Conclusion
11.8. Bibliography
Chapter 12: Enforcing Security with Cryptography
12.1. Introduction
12.2. Cryptography: from a general perspective
12.2.1. Cryptosystems
12.2.2. Two dissimilar worlds
12.2.3. Functionalities provided by cryptographic devices
12.2.4. Cryptanalysis: the dark side of cryptology?
12.2.5. General requirements to avoid vulnerabilities
12.3. Symmetric encryption schemes
12.3.1. The secret key
12.3.2. Iterated structures and block ciphers
12.3.3. Some famous algorithms: a short story of the evolution of mathematical techniques
12.4. Prime numbers and public key cryptography
12.4.1. Introduction
12.4.2. The RSA
12.4.3. Primality and pseudo-primality
12.4.4. Pseudo-primality test
12.4.5. Guaranteed primality tests
12.5. Conclusion
12.6. Bibliography
List of Authors
Index

Systemvoraussetzungen

Als PDF speichern Als Link merken