Refine
Is part of the Bibliography
- no (293) (remove)
Year of publication
Document Type
- Book article / Book chapter (145)
- Journal article (81)
- Working Paper (26)
- Book (21)
- Doctoral Thesis (7)
- Conference Proceeding (5)
- Review (5)
- Habilitation (1)
- Master Thesis (1)
- Other (1)
Keywords
- Human-Animal Studies (23)
- Animal Studies (22)
- Cultural Animal Studies (22)
- Cultural Studies (22)
- Ecocriticism (22)
- Environmental Humanities (22)
- Literary Studies (22)
- Einzelhandel (17)
- Datennetz (10)
- Kulturwissenschaften (6)
Institute
- Neuphilologisches Institut - Moderne Fremdsprachen (105)
- Institut für deutsche Philologie (81)
- Institut für Informatik (30)
- Institut für Altertumswissenschaften (26)
- Institut für Geographie und Geologie (20)
- Institut für Internationales Recht, Europarecht und Europäisches Privatrecht (18)
- Institut für Anatomie und Zellbiologie (10)
- Institut für Systematische Theologie (9)
- Klinik und Poliklinik für Mund-, Kiefer- und Plastische Gesichtschirurgie (2)
- Institut für Altertumswissenschaften (bis Sept. 2007) (1)
Schriftenreihe
- Cultural Animal Studies, Band 3 (22)
- Aesthetische Eigenzeiten, 17 (1)
- Akten des ... Symposiums des Mediävistenverbandes; 13,2 (1)
- Aventiuren; 13 (1)
- Epistemata. Reihe Literaturwissenschaft ; 483 (1)
- GenderCodes - Transkriptionen zwischen Wissen und Geschlecht; 17 (1)
- Image ; 185 (1)
- Jahrbuch der Oswald-von-Wolkenstein-Gesellschaft; 17 (1)
- Kaleidogramme ; 183 (1)
- Macht und Herrschaft; 15 (1)
Sonstige beteiligte Institutionen
- VolkswagenStiftung (22)
- Cologne Game Lab (2)
- Open University of the Netherlands (2)
- Albert-Ludwigs-Universität Freiburg im Breisgau (1)
- Birmingham City University (1)
- Geographisches Institut (Humboldt Universität zu Berlin) (1)
- Geographisches Institut (Universität zu Köln) (1)
- Geographisches Institut der Universität zu Köln (1)
- Geographisches Institut, Johannes Gutenberg-Universität Mainz (1)
- Mediävistenverband (1)
No abstract available.
No abstract available.
No abstract available.
No abstract available.
No abstract available.
No abstract available.
Service orchestration requires enormous attention and is a struggle nowadays. Of course, virtualization provides a base level of abstraction for services to be deployable on a lot of infrastructures. With container virtualization, the trend to migrate applications to a micro-services level in order to be executable in Fog and Edge Computing environments increases manageability and maintenance efforts rapidly. Similarly, network virtualization adds effort to calibrate IP flows for Software-Defined Networks and eventually route it by means of Network Function Virtualization. Nevertheless, there are concepts like MAPE-K to support micro-service distribution in next-generation cloud and network environments. We want to explore, how a service distribution can be improved by adopting machine learning concepts for infrastructure or service changes. Therefore, we show how federated machine learning is integrated into a cloud-to-fog-continuum without burdening single nodes.
In network research, reproducibility of experiments is not always easy to achieve. Infrastructures are cumbersome to set up or are not available due to vendor-specific devices. Emulators try to overcome those issues to a given extent and are available in different service models. Unfortunately, the usability of emulators requires time-consuming efforts and a deep understanding of their functionality. At first, we analyze to which extent currently available open-source emulators support network configurations and how user-friendly they are. With these insights, we describe, how an ease-to-use emulator is implemented and may run as a Network Emulator as a Service (NEaaS). Therefore, virtualization plays a major role in order to deploy a NEaaS based on Kathará.
This paper discusses the problem of finding multiple shortest disjoint paths in modern communication networks, which is essential for ultra-reliable and time-sensitive applications. Dijkstra’s algorithm has been a popular solution for the shortest path problem, but repetitive use of it to find multiple paths is not scalable. The Multiple Disjoint Path Algorithm (MDPAlg), published in 2021, proposes the use of a single full graph to construct multiple disjoint paths. This paper proposes modifications to the algorithm to include a delay constraint, which is important in time-sensitive applications. Different delay constraint least-cost routing algorithms are compared in a comprehensive manner to evaluate the benefits of the adapted MDPAlg algorithm. Fault tolerance, and thereby reliability, is ensured by generating multiple link-disjoint paths from source to destination.
How to Model and Predict the Scalability of a Hardware-In-The-Loop Test Bench for Data Re-Injection?
(2023)
This paper describes a novel application of an empirical network calculus model based on measurements of a hardware-in-the-loop (HIL) test system. The aim is to predict the performance of a HIL test bench for open-loop re-injection in the context of scalability. HIL test benches are distributed computer systems including software, hardware, and networking devices. They are used to validate complex technical systems, but have not yet been system under study themselves. Our approach is to use measurements from the HIL system to create an empirical model for arrival and service curves. We predict the performance and design the previously unknown parameters of the HIL simulator with network calculus (NC), namely the buffer sizes and the minimum needed pre-buffer time for the playback buffer. We furthermore show, that it is possible to estimate the CPU load from arrival and service-curves based on the utilization theorem, and hence estimate the scalability of the HIL system in the context of the number of sensor streams.