Refine
Has Fulltext
- yes (54) (remove)
Is part of the Bibliography
- no (54) (remove)
Year of publication
- 2023 (54) (remove)
Document Type
- Book article / Book chapter (34)
- Working Paper (14)
- Journal article (3)
- Book (2)
- Other (1)
Keywords
- Kulturwissenschaften (6)
- cultural studies (6)
- India (5)
- Indien (5)
- Linienbandkeramik (5)
- Neolithikum (4)
- Vulnerabilität (4)
- Digitalisierung (3)
- Linear Pottery (3)
- Neolithic (3)
Institute
- Institut für Informatik (14)
- Institut für Altertumswissenschaften (11)
- Institut für Systematische Theologie (9)
- Institut für Internationales Recht, Europarecht und Europäisches Privatrecht (8)
- Neuphilologisches Institut - Moderne Fremdsprachen (7)
- Institut für Anatomie und Zellbiologie (3)
- Institut für Geographie (1)
- Institut für Geographie und Geologie (1)
Sonstige beteiligte Institutionen
EU-Project number / Contract (GA) number
- 101069547 (1)
Nach ersten, wenig erfolgreichen Entwicklungsimpulsen in den 1990er Jahren ist der Online-Lebensmitteleinzelhandel in Deutschland inzwischen in eine Expansionsphase übergegangen, die durch einen Wandel unterschiedlicher Einflussfaktoren begünstigt wurde, so zuletzt beispielsweise durch Rahmenbedingungen der Covid-19-Pandemie. Diese Entwicklung führt dabei nicht nur zu einer Herausbildung neuer oder transformierter Betriebsformen, sondern treibt auch einen Wandel von räumlichen Organisationstrukturen an, der veränderte Standortanforderungen handelnder Akteure mit sich bringt.
Diese Arbeit untersucht jene Veränderungen in Bezug auf Logistik, Lagerinfrastruktur und Filialsysteme anhand von ausgewählten Unternehmensbeispielen aus dem ergänzenden, reinen sowie kombinierten E-Commerce. Dabei bedient sich die Arbeit einerseits am theoretischen Ansatz der Multi-Level-Perspektive aus dem Blickwinkel der Transitionsforschung, um zu ergründen, warum eine Expansion des Online-Lebensmitteleinzelhandels heute im Gegensatz zu den 1990er Jahren begünstigt wird. Andererseits wird mithilfe eines Methodenmixes aus Sekundärdatenanalyse und qualitativer Forschung analysiert, welche Charakteristika die neuen Betriebsformen aufweisen und welche veränderten Ansprüche diese an die Organisationsstruktur sowie die Standorte von Handelsunternehmen stellen.
Dabei kann verdeutlicht werden, dass logistische Abläufe (wie auch der Ort der Warenübergabe) heute eine hohe Relevanz für die Charakteristik einer Betriebsform aufweisen und der Online-Lebensmitteleinzelhandel somit zu einer größeren Hybridisierung des Lebensmitteleinkaufs – überwiegend in urbanen Räumen – führt. Dies zeigt zudem, dass bisherige Betriebsformensystematiken nicht mehr ausreichen, um die komplexen Merkmale der neuen Betriebsformen und Vertriebsmodelle hinreichend abzubilden.
No abstract available.
No abstract available.
No abstract available.
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.