004 Datenverarbeitung; Informatik
Refine
Has Fulltext
- yes (27)
Is part of the Bibliography
- no (27) (remove)
Document Type
- Working Paper (24)
- Conference Proceeding (3)
Language
- English (27)
Keywords
- Datennetz (10)
- P4 (5)
- SDN (4)
- 5G (2)
- MP-DCCP (2)
- artificial intelligence (2)
- connected mobility applications (2)
- fog computing (2)
- multipath (2)
- multipath scheduling (2)
- network calculus (2)
- satellite communication (2)
- 5G-ATSSS (1)
- 5GC (1)
- 6G (1)
- ATSSSS (1)
- Add-on-Miss (1)
- Containerization (1)
- Dijkstra’s algorithm (1)
- FIFO caching strategies (1)
- JCAS (1)
- Kathará (1)
- LFU (1)
- LRU (1)
- MTC (1)
- Network Emulator (1)
- Network Experiments (1)
- P4-INT (1)
- Performance Enhancing Proxies (1)
- QUIC (1)
- RRM (1)
- Reproducibility (1)
- SBA (1)
- SDN/NVF (1)
- Sensing-aaS (1)
- TSN (1)
- TTL (1)
- TTL validation of data consistency (1)
- Testbed (1)
- URLLC (1)
- VNF (1)
- VPN (1)
- Visualized Kathará (1)
- autonomic orchestration (1)
- computer performance evaluation (1)
- container virtualization (1)
- data plane programming (1)
- dataplane programming (1)
- decoding error rate (1)
- delay QoS exponent (1)
- delay bound violation probability (1)
- delay constrained (1)
- disjoint multi-paths (1)
- docker (1)
- dynamic flow migration (1)
- effective Bandwidth (1)
- emulation (1)
- federated learning (1)
- games (1)
- haptic data (1)
- hardware-in-the-loop simulation (1)
- hardware-in-the-loop streaming system (1)
- hit ratio analysis and simulation (1)
- hybrid access (1)
- immersive learning technologies (1)
- interactive authoring system (1)
- least cost (1)
- locomotion (1)
- measurements (1)
- multimodal learning (1)
- multipath communication (1)
- multipath packet scheduling (1)
- natural language processing · · · (1)
- networking (1)
- non-terrestrial networks (1)
- orchestration (1)
- path computation (1)
- performance monitoring (1)
- plain orchestrating service (1)
- pos (1)
- psychomotor training (1)
- reconfiguration (1)
- scalability evaluation (1)
- semantic understanding (1)
- sensor devices (1)
- service-curve estimation (1)
- short block-length (1)
- shortest path routing (1)
- software defined network (1)
- state management (1)
- topology (1)
- transport protocols (1)
- virtual queue (1)
- virtual reality (1)
- wheel (1)
Institute
Sonstige beteiligte Institutionen
EU-Project number / Contract (GA) number
- 101069547 (1)
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á.
Tactile Internet aims at allowing perceived real-time interactions between humans and machines. This requires satisfying a stringent latency requirement of haptic data streams whose data rates vary drastically as the results of perceptual codecs. This introduces a complex problem for the underlying network infrastructure to fulfill the pre-defined level of Quality of Service (QoS). However, novel networking hardware with data plane programming capability allows processing packets differently and opens up a new opportunity. For example, a dynamic and network-aware resource management strategy can help satisfy the QoS requirements of different priority flows without wasting precious bandwidth. This paper introduces virtual queues for service differentiation between different types of traffic streams, leveraging protocol independent switch architecture (PISA). We propose coordinating the management of all the queues and dynamically adapting their sizes to minimize packet loss and delay due to network congestion and ensure QoS compliance.
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.
Future mobile communication networks, such as 5G and beyond, can benefit from Virtualized Network Functions (VNFs) when deployed on cloud infrastructures to achieve elasticity and scalability. However, new challenges arise as to managing states of Network Functions (NFs). Especially control plane VNFs, which are mainly found in cellular core networks like the 5G Core (5GC), received little attention since the shift towards virtualizing NFs. Most existing solutions for these core networks are often complex, intrusive, and are seldom compliant with the standard. With the emergence of 5G campus networks, UEs will be mainly machine-type devices. These devices communicate more deterministically, bringing new opportunities for elaborated state management. This work presents an emulation environment to perform rigorous measurements on state access patterns. The emulation comes with a fully parameterized Markov model for the UE to examine a wide variety of different devices. These measurements can then be used as a solid base for designing an efficient, simple, and standard conform state management solution that brings us further towards stateless core networks.
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 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.
Time-to-Live (TTL) caches decouple the occupancy of objects in cache through object-specific validity timers. Stateof- the art techniques provide exact methods for the calculation of object-specific hit probabilities given entire cache hierarchies with random inter-cache network delays. The system hit probability is a provider-centric metric as it relates to the origin offload, i.e., the decrease in the number of requests that are served by the content origin server. In this paper we consider a user-centric metric, i.e., the response time, which is shown to be structurally different from the system hit probability. Equipped with the state-of-theart exact modeling technique using Markov-arrival processes we derive expressions for the expected object response time and pave a way for its optimization under network delays.
In scientific research, the independent reproduction of experiments is the source of trust. Detailed documentation is required to enable experiment reproduction. Reproducibility awards were created to honor the increased documentation effort. In this work, we propose a novel approach toward reproducible research—a structured experimental workflow that allows the creation of reproducible experiments without requiring additional efforts of the researcher. Moreover, we present our own testbed and toolchain, namely, plain orchestrating service (pos), which enables the creation of such experimental workflows. The experiment is documented by our proposed, fully scripted experiment structure. In addition, pos provides scripts enabling the automation of the bundling and release of all experimental artifacts. We provide an interactive environment where pos experiments can be executed and reproduced, available at https://gallenmu.github.io/single-server-experiment.
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.
Natural walking in virtual reality games is constrained by the physical boundaries defined by the size of the player’s tracking space. Impossible spaces, a redirected walking technique, enlarge the virtual environment by creating overlapping architecture and letting multiple locations occupy the same physical space. Within certain thresholds, this is subtle to the player. In this paper, we present our approach to implement such impossible spaces and describe how we handled challenges like objects with simulated physics or precomputed global illumination.