Measurement, Modeling, and Evaluation of Computing Systems and Dependability and Fault Tolerance

Name: Measurement, Modeling, and Evaluation of Computing Systems and Dependability and Fault Tolerance | 16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012, Proceedings

Jens B. Schmitt(Herausgeber*in)

Springer (Verlag)

Erschienen am 8. März 2012

XIII, 331 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-28540-0 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title Page
Preface
Organization
Table of Contents
Full Papers
Availability in Large Networks: Global Characteristics from Local Unreliability Properties
Introduction
Availability Modeling
Finite Networks
Infinite Networks: Mean Field Description for Neighborhood Dependent Breakdown and Repair Rates
Infinite Networks: Fixed Point Analysis
Infinite Networks: Stationary States for Mean Field Models
Infinite Networks: Stochastic Orderings
Stochastic Order for Balanced Breakdown and Repair Rates
Stochastic Order for Unbalanced Breakdown and Repair Rates
Comparison of Global Availability and Bounds
Discussion
Acknowledgement.
References
Stochastic Analysis of a Finite Source Retrial Queue with Spares and Orbit Search
Introduction
Model Description
The Busy Period
Waiting Time
Numerical Examples
Conclusions
References
Bounds for Two-Terminal Network Reliability with Dependent Basic Events
Introduction
Preliminaries
Formal Description
Basics of the Independent GD Algorithm
The Dependent GD with Reductions
The Algorithm
A Case Study
A Recursive Example
Conclusion
References
Software Reliability Testing Covering Subsystem Interactions
Introduction
Reliability Assessment by Statistical Sampling Theory
Measures of Interaction Coverage
Potential Bias of Operationally Representative Samples
Shortcoming of Reliability Testing
Application Example
Evaluation
Multi-criteria Test Case Optimization
Objective 1: Operational Representativeness of Test Cases
Objective 2: Test Case Independence
Objective 3: Interaction Coverage
Combination of Objectives 1, 2 and 3
Example
Conclusion
References
Failure-Dependent Timing Analysis -A New Methodology for Probabilistic Worst-Case Execution Time Analysis
Introduction
Related Work
Failure-Dependent Timing Analysis
Example System
Analysis
FDTA Tool Chain
Architecture
Analysis Example
Conclusion and Future Work
References
A Calculus for SLA Delay Properties
Introduction
Related Work
Outline
(min,+) Calculus
Arrival and Service Curves
Delay Curves
SLA Calculus System Model
Requests to Systems
SLA Delay Properties
Service Provider
Service Provider Structure
Combination of SLA Delay Properties
Lower Service Curves for Delay Properties
Conclusions and Future Work
References
Verifying Worst Case Delays in Controller Area Network
Introduction
Related Work
A Brief Description of CAN
Timed Automata and Verification
CAN Arbitration Model
Qualitative Properties
Time Constants
Verification of Worst Case Delays
Results
Discussion
Conclusion
References
Lifetime Improvement by Battery Scheduling
Introduction
Related Work
Kinetic Battery Model
Introduction
Maximum Possible Lifetime Gain
Battery Scheduling Results
Simulation Set-Up
Round Robin Frequency Dependence
Random Times
Random Currents
Full Random Load
Conclusions
References
Weighted Probabilistic Equivalence Preserves ?-Regular Properties
Introduction
Discrete-Time Markov Chains
Weighted Probabilistic Equivalence
Preservation of -Regular Properties
Deterministic Rabin Automata
Synchronous Parallel Composition for DTMCs
Conclusions
References
Appendix
Probabilistic CSP: Preserving the Laws via Restricted Schedulers
Introduction
Model and Probabilistic Ready-Trace Preorder
gray 0color push gray 0color popThe Language of Probabilistic CSP
Generalization of the Model and Normal Forms
Axiomatic Characterization of RT
Related Work and Conclusion
References
Heuristics for Probabilistic Timed Automata with Abstraction Refinement
Introduction
Preliminaries
Abstraction and Refinement
Abstraction Based on Stochastic Games
Predicate Abstraction
Backward Refinement
Case Studies and Heuristics
Speeding Up Strategy Synthesis
Self-loops and Execution Invariants
Comparison with Other Approaches
Conclusion and Further Work
References
Simulative and Analytical Evaluation for ASD-Based Embedded Software
Introduction
The ASD Architecture
Simulation
Numerical Analysis
Single ASD Block Analysis
Measures of Interest for Single Blocks
Analysis of Multiple Blocks
Validation
Test Case 1: Two Blocks
Test Case 2: Interfering Tasks
Test Case 3: Complex Structure
Conclusions
References
Reducing Channel Zapping Delayin WiMAX-Based IPTV Systems
Introduction
Background
WiMAX Multicast Broadcast Service (MBS)
Channel Switching Delay in IPTV Systems
Workload Generation and Prediction-Based Prejoin Method
Modeling the Behavior of a Single IPTV User, during an ON Session
Our Proposed Prediction-Based Prejoin Method
Performance Evaluation
Conclusion
References
Performance Evaluation of 10GE NICs with SR-IOV Support: I/O Virtualization and Network Stack Optimization s
Introduction
Background
I/O Virtualization
Optimizations
Prior Work
Experimental Setup
Tools
Data Analysis
Performance Evaluation
End-to-End Traffic Delay
Forwarding Throughput
Throughput vs. Packet Size
VM Performance Isolation
TCP-Segmentation-Offload and Generic-Segmentation-Offload
Large-Receive-Offload and Generalized-Receive-Offload
Conclusion
References
Business Driven BCM SLA Translation for Service Oriented Systems
Introduction
Use Case
Business Impact
Business Level to Business Level Translation
Merging Impact Tables
Defining the Maximum Tolerable Outage Times
SLA Translation
SLA Offers
SLA Validation
SLA Classification
Related Work
Conclusion and Future Work
References
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Introduction
Related Work
Description and Integration of Knowledge in a Design Space Exploration
Basic Concepts
Modeling Knowledge
Using Knowledge during the DSE Process
Acquiring Knowledge through Data Mining Techniques
Evaluation
Automatically Developing Rules
Accelerated General DSE of GAP's Hardware Parameters
Specializing the GAP for Application Domains
Summary, Conclusion and Outlook
References
Tool Papers
IBPM: An Open-Source-Based Frameworkfor InifiniB and Performance Monitoring
Introduction
Rate Measurement in IB Networks
Features
Architecture and Implementation
Conclusion
References
A Workbench for Internet Traffic Analysis
Introduction
Atheris
Multi-threaded Packet Analysis
Conclusion
References
A Modelling and Analysis Environment for $ LARES$
Introduction
The LARES Modelling Language
Tooling and Transformations
Implementation Details
Conclusion
References
Simulation and Statistical Model Checking for Modestly Nondeterministic Models
Introduction
Language Enhancements
Towards Statistical Model Checking
Conclusion
References
UniLoG: A Unified Load Generation Tool
Motivation
Load Specification Method
Overview of the UniLoG Architecture
QoS Measurements for RTSP Streaming under Load
References
Selected Workshop Papers
Non Preemptive Static Priority with Network Calculus: Enhancement
Introduction
State of the Art
Network Calculus
Mathematical background: (min,+) dioid
Network calculus: reality modelling.
Network calculus: contract modelling.
Related Works
Our Contribution
Scheduling Modelling
Mutual exclusion.
Non-preemptive strict priority.
Formal properties related to scheduling.
Contributions
Proof
Some more definitions.
The proof itself.
Generalisation to Any Number of Flows
Application
Conclusions
References
A Demand-Response Calculus with Perfect Batteries
Introduction
Problem Definition
Feasible Schedules
Battery Size with Service Curve Constraints
Numerical Evaluations
Voltalis-Like Service Curve
Akamai Arrival Curve
Battery Sizing
Conclusion
References
Technical Lemmas
Maximal Solution
Minimal Solution
A Formal Definition and a New Security Mechanism of Physical Unclonable Functions
Introduction
Aims and Outline of This Work
Previous Work on the Definition of a PUF
A Model of the PUF Concept
Formal Definition of ``PUF''
Security of a PUF
Relation of PUFs to Closely Related Concepts
PUFs and Conventional Unclonable Functions (``CUFs'') Are Qualitatively Different
PUFs and Physically Obfuscated Keys Are Independent Concepts
Random Number Generators
Controlled PUFs: A PUF with Additional Tamper Resistance
``Strong PUFs'': Not the Only Path to Strength
Security Evaluation of PUFs
Analysis of PUF Security Mechanisms
``Minimum Readout Time'' PUFs
``Erasure Upon Readout'' PUFs - Quantum PUFs
Discussion
References
Modeling and Analysis of a P2P-VoD System Based on Stochastic Network Calculus
Introduction
System Model
The PPLive P2P-VoD System Architecture
Building Blocks of the System
Problem Statement and Formulation
Stochastic P2P Network Calculus
A View from the Sending Peer
A View from the Receiving Peer
Video Playback Delay
An Optimization Problem
Case Study
Setup and Delay Analysis
Demand curve.
Supply curve.
Buffering curve.
Delay analysis.
Sub-piece Transmission Schedule
Discussion
Related Works
Conclusion
References
Using NFC Phones for Proving Credentials
Introduction
Contribution
Outline
Background
Technology
E-Banking
Cryptographic Concepts
Model
Participants
Security Requirements
Tap2 Technology
Applications
A Use Case: Mobile Banking
Other Applications
Threat Analysis
Conclusions and Future Work
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken