Probabilistic models for access strategies to dynamic information elements

In various network services (e.g., routing and instances of context-sensitive networking) remote access to dynamically changing information elements is a required functionality. During the project different strategies for such access have been investigated. A number of probabilistic models have been developed for which a number of performance metrics can be obtained, with special focus on the mismatch probability. In particular matrix-geometric methods to obtain formulae for the mismatch probability that avoid numerical integration. The methods are now being applied to various use-cases in context-sensitive networking, dynamic name services, replication strategies and fault detection.