Refine
Has Fulltext
- yes (87)
Is part of the Bibliography
- no (87) (remove)
Year of publication
Document Type
- Book article / Book chapter (43)
- Working Paper (26)
- Journal article (10)
- Conference Proceeding (4)
- Doctoral Thesis (3)
- Other (1)
Language
- English (87) (remove)
Keywords
- Animal Studies (22)
- Cultural Animal Studies (22)
- Cultural Studies (22)
- Ecocriticism (22)
- Environmental Humanities (22)
- Human-Animal Studies (22)
- Literary Studies (22)
- Datennetz (10)
- Kulturwissenschaften (6)
- cultural studies (6)
Institute
- Neuphilologisches Institut - Moderne Fremdsprachen (42)
- Institut für Informatik (30)
- Institut für deutsche Philologie (22)
- Institut für Anatomie und Zellbiologie (3)
- Institut für Internationales Recht, Europarecht und Europäisches Privatrecht (3)
- Institut für Altertumswissenschaften (bis Sept. 2007) (1)
- Institut für Musikforschung (1)
- Institut für Psychologie (1)
- Julius-von-Sachs-Institut für Biowissenschaften (1)
- Neuphilologisches Institut - Moderne Fremdsprachen (bis 2007) (1)
Schriftenreihe
Sonstige beteiligte Institutionen
Cooperative, connected and automated mobility (CCAM) systems depend on a reliable communication to provide their service and more crucially to ensure the safety of users. One way to ensure the reliability of a data transmission is to use multiple transmission technologies in combination with redundant flows. In this paper, we describe a system requiring multipath communication in the context of CCAM. To this end, we introduce a data plane-based scheduler that uses replication and integration modules to provide redundant and transparent multipath communication. We provide an analytical model for the full replication module of the system and give an overview of how and where the data-plane scheduler components can be realized.
Despite some critical voices, in German linguistics the concept of confix can meanwhile be considered as an established morpheme category. Schmidt (1987) introduced the term into German to describe bound morphemes that are lexical, but not inflectable. Since the 2000s, an increasing number of publications deal with the phenomenon and the term has begun to enter linguistic reference works as well. In French, the situation is completely different due to the structure of the language (poor in compounds and mostly post-determinative). Although the term and the concept have originall y been coined by the French structuralist André Martinet ([1961] \(^3\)1980 ), the denomination itself is barely present in Romance linguistics. French researchers usually take different approaches to discuss the phenomenon (e.g., neoclassical compounds, constructed lexemes). In Italian, the denominations confisso/ confissazione are first used by De Mauro (1999), who adopts both the term and concept directly from Martinet; moreover, they can be found in some contributions on word formation and lexicology (e.g., Adamo/Della Valle 2008). Nevertheless, the Italian termino-logy remains heterogeneous, with some researchers still using the terms prefissoide/suffissoide coined by Migliorini (1963). As I will show by comparing the languages in question, the terminology and the concept of confixes vary greatly between Romance and Germanic languages.
On the basis of four relevées of hedges around Straiton en Dailly in South Ayrshire, Scotland, some features of hedges are discussed. On the basis of the brambles, the vegetation of these hedges can be assigned to the Pruno-Rubion sprengelii, which comprises the bramble scrubs of circumneutral and nutrient rich soils in West Europe (Haveman et al. 2017, Haveman & de Ronde 2019). Until now, this alliance was thought to be restricted to the northwestern edge of the European continent, but based on these relevées and the known distribution area of Rubus nemoralis and Rubus polyanthemus, both characteristic for the Pruno-Rubion sprengelii, large parts of North England and Scotland have to be included in the distribution area of the alliance.
The Pruno-Rubion sprengelii is optimally developed in rather narrow structures, like hedges, which are pruned every year. Here, brambles and herbs alike can grow with and under the shrubs, facilitated by the light that reaches large parts of the ground. Where the economic base of hedges perishes, they are not longer maintained, and the shrubs can grow out to their natural proportions. This changes the amount of light reaching the surface in the inner parts of the thicket, changing the competition between the species. The brambles as well as the herbs are displaced to the outer edges of the scrub, and the vegetation "dissociates" in a high-growing scrub, a fore-mantle ("cuff") with brambles, and a fringe with perennial herbs. These elements can hardly ever be assigned to the Pruno-Rubion anymore.
The Pruno-Rubion sprengelii in optima forma is a scrub in which the three elements (shrubs, brambles, and herbs) grow closely intertwined. This is rarely found in natural landscapes, and thus the alliance is a typical element of the old farmer landscape. What is more: the typical species of the alliance, like Rubus nemoralis and R. polyanthemus, could only evolve after the landscape was opened by farmers in the last six millennia (Matzke-Hajek 1997), giving way to Rubus ulmifolius to expand its distribution area. This caused an explosion of hybrids which stabilised through apomixis into the wealth of Rubus species inhibiting the West European landscape nowadays (Sochor et al. 2015). Many of these species have their original home in a man-made landscape. Therefore, the Pruno-Rubion sprengelii can be characterised as a "farmers alliance" pur sang.
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.
In recent years, satellite communication has been expanding its field of application in the world of computer networks. This paper aims to provide an overview of how a typical scenario involving 5G Non-Terrestrial Networks (NTNs) for vehicle to everything (V2X) applications is characterized. In particular, a first implementation of a system that integrates them together will be described. Such a framework will later be used to evaluate the performance of applications such as Vehicle Monitoring (VM), Remote Driving (RD), Voice Over IP (VoIP), and others. Different configuration scenarios such as Low Earth Orbit and Geostationary Orbit will be considered.
The introduction of new types of frequency spectrum in 6G technology facilitates the convergence of conventional mobile communications and radar functions. Thus, the mobile network itself becomes a versatile sensor system. This enables mobile network operators to offer a sensing service in addition to conventional data and telephony services. The potential benefits are expected to accrue to various stakeholders, including individuals, the environment, and society in general. The paper discusses technological development, possible integration, and use cases, as well as future development areas.
This paper presents a novel concept to extend state-of-the-art buffer monitoring with additional measures to estimate service-curves. The online algorithm for service-curve estimation replaces the state-of-the-art timestamp logging, as we expect it to overcome the main disadvantages of generating a huge amount of data and using a lot of CPU resources to store the data to a file during operation. We prove the accuracy of the online-algorithm offline with timestamp data and compare the derived bounds to the measured delay and backlog. We also do a proof-of- concept of the online-algorithm, implement it in LabVIEW and compare its performance to the timestamp logging by CPU load and data-size of the log-file. However, the implementation is still work-in-progress.
This paper presents a prototypical implementation of the In-band Network Telemetry (INT) specification in P4 and demonstrates a use case, where a Tofino Switch is used to measure device and network performance in a lab setting. This work is based on research activities in the area of P4 data plane programming conducted at the network lab of HTW Berlin.
State Management at line rate is crucial for critical applications in next-generation networks. P4 is a language used in software-defined networking to program the data plane. The data plane can profit in many circumstances when it is allowed to manage its state without any detour over a controller. This work is based on a previous study by investigating the potential and performance of add-on-miss insertions of state by the data plane. The state keeping capabilities of P4 are limited regarding the amount of data and the update frequency. We follow the tentative specification of an upcoming portable-NIC-architecture and implement these changes into the software P4 target T4P4S. We show that insertions are possible with only a slight overhead compared to lookups and evaluate the influence of the rate of insertions on their latency.
Utilizing multiple access networks such as 5G, 4G, and Wi-Fi simultaneously can lead to increased robustness, resiliency, and capacity for mobile users. However, transparently implementing packet distribution over multiple paths within the core of the network faces multiple challenges including scalability to a large number of customers, low latency, and high-capacity packet processing requirements. In this paper, we offload congestion-aware multipath packet scheduling to a smartNIC. However, such hardware acceleration faces multiple challenges due to programming language and platform limitations. We implement different multipath schedulers in P4 with different complexity in order to cope with dynamically changing path capacities. Using testbed measurements, we show that our CMon scheduler, which monitors path congestion in the data plane and dynamically adjusts scheduling weights for the different paths based on path state information, can process more than 3.5 Mpps packets 25 μs latency.
Web caches often use a Time-to-live (TTL) limit to validate data consistency with web servers. We study the impact of TTL constraints on the hit ratio of basic strategies in caches of fixed size. We derive analytical results and confirm their accuracy in comparison to simulations. We propose a score-based caching method with awareness of the current TTL per data for improving the hit ratio close to the upper bound.
Cooperative, connected and automated mobility (CCAM) systems depend on a reliable communication to provide their service and more crucially to ensure the safety of users. One way to ensure the reliability of a data transmission is to use multiple transmission technologies in combination with redundant flows. In this paper, we describe a system requiring multipath communication in the context of CCAM. To this end, we introduce a data plane-based scheduler that uses replication and integration modules to provide redundant and transparent multipath communication. We provide an analytical model for the full replication module of the system and give an overview of how and where the data-plane scheduler components can be realized.
Packets sent over a network can either get lost or reach their destination. Protocols like TCP try to solve this problem by resending the lost packets. However, retransmissions consume a lot of time and are cumbersome for the transmission of critical data. Multipath solutions are quite common to address this reliability issue and are available on almost every layer of the ISO/OSI model. We propose a solution based on a P4 network to duplicate packets in order to send them to their destination via multiple routes. The last network hop ensures that only a single copy of the traffic is further forwarded to its destination by adopting a concept similar to Bloom filters. Besides, if fast delivery is requested we provide a P4 prototype, which randomly forwards the packets over different transmission paths. For reproducibility, we implement our approach in a container-based network emulation system called Kathará.