004 Datenverarbeitung; Informatik
Refine
Has Fulltext
- yes (38)
Year of publication
- 2022 (38) (remove)
Document Type
- Journal article (21)
- Working Paper (16)
- Doctoral Thesis (1)
Language
- English (38) (remove)
Keywords
- Datennetz (14)
- virtual reality (4)
- IoT (2)
- P4 (2)
- SDN (2)
- 5G-ATSSS (1)
- 5GC (1)
- ACKR4 (1)
- AI (1)
- AKT (1)
- AVA (1)
- Autorotation (1)
- Balloon (1)
- CD95 (1)
- CLIP (1)
- COVID-19 (1)
- CubeSat (1)
- DNA storage (1)
- FLIMbee (1)
- HGPS (1)
- IGFBP2 (1)
- Image Aesthetic Assessment (1)
- Implementierung <Informatik> (1)
- InteractionSuitcase (1)
- Internet of Things (1)
- Leistungsbewertung (1)
- Lightning (1)
- LoRa (1)
- LoRaWAN (1)
- LoRaWan (1)
- MP-DCCP (1)
- MTC (1)
- Mars (1)
- Network Experiments (1)
- Performance Enhancing Proxies (1)
- QUIC (1)
- RNA sequencing (1)
- RRM (1)
- Reproducibility (1)
- SARS-CoV-2 (1)
- SBA (1)
- SDN/NVF (1)
- SMLM (1)
- Simulation (1)
- TSN (1)
- TTL (1)
- Testbed (1)
- URLLC (1)
- VNF (1)
- VPN (1)
- Venus (1)
- WNT (1)
- XR (1)
- YouTube (1)
- Zeitdiskretes System (1)
- adaptation (1)
- adult learning (1)
- aerospace (1)
- aging (1)
- annotation (1)
- ant-colony optimization (1)
- automation (1)
- autonomic orchestration (1)
- autorotation (1)
- behavior perception (1)
- bioinformatics (1)
- caspase-3 (1)
- certifying algorithm (1)
- chain cover (1)
- channel management (1)
- cisplatin (1)
- coherence (1)
- collision (1)
- comparative sequence analysis (1)
- compressed sensing (1)
- congruence (1)
- container virtualization (1)
- convex bipartite graph (1)
- cultural and media studies (1)
- culturally aware (1)
- dSTORM (1)
- data plane programming (1)
- dataplane programming (1)
- decoding error rate (1)
- deep learning (1)
- delay QoS exponent (1)
- delay bound violation probability (1)
- descent (1)
- design (1)
- discrete-time analysis (1)
- docker (1)
- dynamic flow migration (1)
- dynamic programming (1)
- education (1)
- effective Bandwidth (1)
- emotions (1)
- encryption (1)
- endoscopy (1)
- evolution (1)
- experience (1)
- extended reality (XR) (1)
- fog computing (1)
- food quality (1)
- fruit temperature (1)
- gamification (1)
- gastroenterology (1)
- genetic algorithm (1)
- graph algorithm (1)
- haptic data (1)
- hepatotoxicity (1)
- hybrid access (1)
- illusion of self-motion (1)
- immersion (1)
- implicit association test (1)
- induced matching (1)
- information systems and information technology (1)
- intelligent virtual agents (1)
- intermediate host (1)
- internet traffic (1)
- landing (1)
- language-image pre-training (1)
- latency (1)
- light-gated proteins (1)
- logistics (1)
- lymphotoxicity (1)
- machine learning (1)
- measurements (1)
- mixed-cultural (1)
- mobile networks (1)
- mobile streaming (1)
- multipath (1)
- multipath communication (1)
- mutation (1)
- nanocellulose (1)
- network softwarization (1)
- networking (1)
- non-native accent (1)
- object detection (1)
- omics (1)
- origin (1)
- oxidative stress (1)
- pangolin (1)
- passage of time (1)
- path computation (1)
- performance evaluation (1)
- plain orchestrating service (1)
- plausibility (1)
- point cloud (1)
- pos (1)
- precision horticulture (1)
- prediction (1)
- presence (1)
- progeria (1)
- prompt engineering (1)
- protein chip (1)
- public speaking (1)
- real-world application (1)
- recombination (1)
- reconfiguration (1)
- rich vehicle routing problem (1)
- rotorcraft (1)
- satellite communication (1)
- scheduling (1)
- science, technology and society (1)
- secure group communication (1)
- short block-length (1)
- simulation (1)
- single-electron transistors (1)
- social VR (1)
- social robot (1)
- social robotics (1)
- socially interactive agents (1)
- software defined network (1)
- stereotypes (1)
- sun exposure (1)
- sunburn (1)
- technology-supported learning (1)
- text supervision (1)
- theory (1)
- therapeutic application (1)
- thermal point cloud (1)
- topology (1)
- transmission (1)
- transport protocols (1)
- vection (1)
- virtual agent (1)
- virtual environments (1)
- virtual queue (1)
- virtual stimuli (1)
- virtual tunnel (1)
- wheel (1)
Institute
This document presents a networking latency measurement setup that focuses on affordability and universal applicability, and can provide sub-microsecond accuracy. It explains the prerequisites, hardware choices, and considerations to respect during measurement. In addition, it discusses the necessity for exhaustive latency measurements when dealing with high availability and low latency requirements. Preliminary results show that the accuracy is within ±0.02 μs when used with the Intel I350-T2 network adapter.
In time-sensitive networks (TSN) based on 802.1Qbv, i.e., the time-aware Shaper (TAS) protocol, precise transmission schedules and, paths are used to ensure end-to-end deterministic communication. Such resource reservations for data flows are usually established at the startup time of an application and remain untouched until the flow ends. There is no way to migrate existing flows easily to alternative paths without inducing additional delay or wasting resources. Therefore, some of the new flows cannot be embedded due to capacity limitations on certain links which leads to sub-optimal flow assignment. As future networks will need to support a large number of lowlatency flows, accommodating new flows at runtime and adapting existing flows accordingly becomes a challenging problem. In this extended abstract we summarize a previously published paper of us [1]. We combine software-defined networking (SDN), which provides better control of network flows, with TSN to be able to seamlessly migrate time-sensitive flows. For that, we formulate an optimization problem and propose different dynamic path configuration strategies under deterministic communication requirements. Our simulation results indicate that regularly reconfiguring the flow assignments can improve the latency of time-sensitive flows and can increase the number of flows embedded in the network around 4% in worst-case scenarios while still satisfying individual flow deadlines.
This paper gives an overview of our recent activities in the field of satellite communication networks, including an introduction to geostationary satellite systems and Low Earth Orbit megaconstellations. To mitigate the high latencies of geostationary satellite networks, TCP-splitting Performance Enhancing Proxies are deployed. However, these cannot be applied in the case of encrypted transport headers as it is the case for VPNs or QUIC. We summarize performance evaluation results from multiple measurement campaigns. In a recently concluded project, multipath communication was used to combine the advantages of very heterogeneous communication paths: low data rate, low latency (e.g., DSL light) and high data rate, high latency (e.g., geostationary satellite).
Today’s advanced Internet-of-Things applications raise technical challenges on cloud, edge, and fog computing. The design of an efficient, virtualized, context-aware, self-configuring orchestration system of a fog computing system constitutes a major development effort within this very innovative area of research. In this paper we describe the architecture and relevant implementation aspects of a cloudless resource monitoring system interworking with an SDN/NFV infrastructure. It realizes the basic monitoring component of the fundamental MAPE-K principles employed in autonomic computing. Here we present the hierarchical layering and functionality within the underlying fog nodes to generate a working prototype of an intelligent, self-managed orchestrator for advanced IoT applications and services. The latter system has the capability to monitor automatically various performance aspects of the resource allocation among multiple hosts of a fog computing system interconnected by SDN.
The increased occurrence of Software-Defined-Networking (SDN) not only improves the dynamics and maintenance of network architectures, but also opens up new use cases and application possibilities. Based on these observations, we propose a new network topology consisting of a star and a ring topology. This hybrid topology will be called wheel topology in this paper. We have considered the static characteristics of the wheel topology and compare them with known other topologies.
In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already an NP-complete problem, the application of these algorithms in practice often fails to take into account the constraints and restrictions that apply in real-world applications, the so called rich VRP (rVRP) and are limited to single aspects. In this work, we incorporate the main relevant real-world constraints and requirements. We propose a two-stage strategy and a Timeline algorithm for time windows and pause times, and apply a Genetic Algorithm (GA) and Ant Colony Optimization (ACO) individually to the problem to find optimal solutions. Our evaluation of eight different problem instances against four state-of-the-art algorithms shows that our approach handles all given constraints in a reasonable time.
A bipartite graph G=(U,V,E) is convex if the vertices in V can be linearly ordered such that for each vertex u∈U, the neighbors of u are consecutive in the ordering of V. An induced matching H of G is a matching for which no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and m weighted edges, an induced matching of maximum total weight can be computed in O(n+m) time. An unweighted convex bipartite graph has a representation of size O(n) that records for each vertex u∈U the first and last neighbor in the ordering of V. Given such a compact representation, we compute an induced matching of maximum cardinality in O(n) time. In convex bipartite graphs, maximum-cardinality induced matchings are dual to minimum chain covers. A chain cover is a covering of the edge set by chain subgraphs, that is, subgraphs that do not contain induced matchings of more than one edge. Given a compact representation, we compute a representation of a minimum chain cover in O(n) time. If no compact representation is given, the cover can be computed in O(n+m) time. All of our algorithms achieve optimal linear running time for the respective problem and model, and they improve and generalize the previous results in several ways: The best algorithms for the unweighted problem versions had a running time of O(n\(^{2}\)) (Brandstädt et al. in Theor. Comput. Sci. 381(1–3):260–265, 2007. https://doi.org/10.1016/j.tcs.2007.04.006). The weighted case has not been considered before.
In this doctoral thesis we cover the performance evaluation of next generation data plane architectures, comprised of complex software as well as programmable hardware components that allow fine granular configuration. In the scope of the thesis we propose mechanisms to monitor the performance of singular components and model key performance indicators of software based packet processing solutions. We present novel approaches towards network abstraction that allow the integration of heterogeneous data plane technologies into a singular network while maintaining total transparency between control and data plane. Finally, we investigate a full, complex system consisting of multiple software-based solutions and perform a detailed performance analysis. We employ simulative approaches to investigate overload control mechanisms that allow efficient operation under adversary conditions. The contributions of this work build the foundation for future research in the areas of network softwarization and network function virtualization.