Refine
Has Fulltext
- yes (25)
Is part of the Bibliography
- no (25) (remove)
Year of publication
- 2023 (25) (remove)
Document Type
- Working Paper (14)
- Book article / Book chapter (10)
- Journal article (1)
Language
- English (25) (remove)
Keywords
- Kulturwissenschaften (6)
- cultural studies (6)
- India (5)
- Indien (5)
- P4 (3)
- 5G (2)
- Hall, Stuart (2)
- SDN (2)
- Williams, Raymond (2)
- connected mobility applications (2)
- multipath scheduling (2)
- network calculus (2)
- 6G (1)
- ATSSSS (1)
- Add-on-Miss (1)
- Alltagskultur (1)
- Bildung (1)
- Brombeere (1)
- Containerization (1)
- Digitalisierung (1)
- Dijkstra’s algorithm (1)
- FIFO caching strategies (1)
- Feminismus (1)
- Film (1)
- Geschlecht (1)
- Gewalt / Frau (1)
- Gilroy, Paul: The Black Atlantic (1)
- Globalisierung (1)
- JCAS (1)
- Jameson, Frederic (1)
- Japan (1)
- Kaste (1)
- Kathará (1)
- LFU (1)
- LRU (1)
- MP-DCCP (1)
- Marxismus (1)
- Marxist theory (1)
- Mehta, Deepa (1)
- Nahrung (1)
- Nationale Minderheiten (1)
- Network Emulator (1)
- Nigeria (1)
- P4-INT (1)
- Postmarxismus (1)
- Praxis (1)
- Pruno-Rubion sprengelii (1)
- Rassismus (1)
- Religion (1)
- Rhamno-Prunetea (1)
- Selbstmordgefährdung (1)
- Sensing-aaS (1)
- Suizidalität (1)
- TTL validation of data consistency (1)
- Theorie (1)
- Vereinigte Staaten (1)
- Visualized Kathará (1)
- Willams, Raymond (1)
- agricultural landscape (1)
- caste system (1)
- computer performance evaluation (1)
- delay constrained (1)
- digitalization (1)
- disjoint multi-paths (1)
- e-Government (1)
- education (1)
- emulation (1)
- federated learning (1)
- feminism (1)
- film analysis (1)
- fog computing (1)
- food cultures (1)
- gender (1)
- globalization (1)
- hardware-in-the-loop simulation (1)
- hardware-in-the-loop streaming system (1)
- hit ratio analysis and simulation (1)
- justice (1)
- least cost (1)
- management (1)
- minorities (1)
- multipath (1)
- multipath packet scheduling (1)
- non-terrestrial networks (1)
- orchestration (1)
- ordinary culture (1)
- performance monitoring (1)
- post Marxism (1)
- racism (1)
- religion (1)
- satellite communication (1)
- scalability evaluation (1)
- service-curve estimation (1)
- shortest path routing (1)
- state management (1)
- suicidality (1)
- suppression of women (1)
- vegetation (1)
Institute
EU-Project number / Contract (GA) number
- 101069547 (1)
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.
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.
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.
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á.