Welcome on the homepage of the chair "Internet Technologies and Systems" of Prof. Dr. Christoph Meinel and his team. We like to inform you about our teaching and ongoing research activities in security, knowledge engineering, innovation and design thinking research.
The chair of Prof. Dr. Christoph Meinel offers courses in the following disciplines: Internet and Web Technologies, (Discrete) Mathematics and Logic, IT Security and Internet Security, Complexity Theory and Information Security as well as Design Thinking.
In Security and Trust Engineering our research and development work is mainly focused on: Network & Internet Security, Cloud and SOA-Security (SOA - Service Oriented Architectures) and Security Awareness.
The research of the team of Prof. Dr. Christoph Meinel in the field of knowledge management and engineering focus on the challenging question, how to manage the mass of digital data, so-called "big data", from Internet and other sources in order to generate new knowledge.
Complete List of Conference Papers of the chair of Prof. Dr. Christoph Meinel
Here you can find all our peer-reviewed conference papers:
Fault-Tolerant Distributed Continuous Double Auctioning on Computationally Constrained Microgrids
In this article we show that a mutual exclusion protocol supporting continuous double auctioning for power trading on computationally constrained microgrid can be fault tolerant. Fault tolerance allows the CDA algorithm to operate reliably and contributes to overall grid stability and robustness. Contrary to fault tolerance approaches proposed in the literature which bypass faulty nodes through a network reconfiguration process, our approach masks crash failures of cluster head nodes through redundancy. Masking failure of the main node ensures the dependent cluster nodes hosting trading agents are not isolated from auctioning. A rendundant component acts as a backup which takes over if the primary components fails, allowing for some fault tolerance and a graceful degradation of the network. Our proposed fault-tolerant CDA algorithm has a complexity of O(N) time and a check-pointing message complexity of O(W). N is the number of messages exchanged per critical section. W is the number of check-pointing messages.