arXiv subjects

Stefan Schmid

Publications and source records attributed to Stefan Schmid.

At least 127 records · Page 7Linked to original sources

arXiv2022

On the Price of Locality in Static Fast Rerouting

Modern communication networks feature fully decentralized flow rerouting mechanisms which allow them to quickly react to link failures. This paper revisits the fundamental algorithmic problem underlying such local fast rerouting mechanisms. Is it possible to achieve perfect resilience, i.e., to define local routing tables which preserve connectivity as long as the underlying network is still connected? Feigenbaum et al. (ACM PODC'12) and Foerster et al. (SIAM APOCS'21) showed that, unfortunately, it is impossible in general. This paper charts a more complete landscape of the feasibility of perfect resilience. We first show a perhaps surprisingly large price of locality in static fast rerouting mechanisms: even when source and destination remain connected by a linear number of link-disjoint paths after link failures, local rerouting algorithms cannot find any of them which leads to a disconnection on the routing level. This motivates us to study resilience in graphs which exclude certain dense minors, such as cliques or a complete bipartite graphs, and in particular, provide characterizations of the possibility of perfect resilience in different routing models. We provide further insights into the price of locality by showing impossibility results for few failures and investigate perfect resilience on Topology Zoo networks.

cs.DC↗

arXiv2022

P4RROT: Generating P4 Code for the Application Layer

Throughput and latency critical applications could often benefit of performing computations close to the client. To enable this, distributed computing paradigms such as edge computing have recently emerged. However, with the advent of programmable data planes, computations cannot only be performed by servers but they can be offloaded to network switches. Languages like P4 enable to flexibly reprogram the entire packet processing pipeline. Though these devices promise high throughput and ultra-low response times, implementing application-layer tasks in the data plane programming language P4 is still challenging for an application developer who is not familiar with networking domain. In this paper, we first identify and examine obstacles and pain points one can experience when offloading server-based computations to the network. Then we present P4RROT, a code generator (in form of a library) which allows to overcome these limitations by providing a user-friendly API to describe computations to be offloaded. After discussing the design choices behind P4RROT, we introduce our proof-of-concept implementation for two P4 targets: Netronome SmartNIC and BMv2.

cs.NI↗

arXiv2022

Renaissance: A Self-Stabilizing Distributed SDN Control Plane using In-band Communications

By introducing programmability, automated verification, and innovative debugging tools, Software-Defined Networks (SDNs) are poised to meet the increasingly stringent dependability requirements of today's communication networks. However, the design of fault-tolerant SDNs remains an open challenge. This paper considers the design of dependable SDNs through the lenses of self-stabilization - a very strong notion of fault-tolerance. In particular, we develop algorithms for an in-band and distributed control plane for SDNs, called Renaissance, which tolerate a wide range of failures. Our self-stabilizing algorithms ensure that after the occurrence of arbitrary failures, (i) every non-faulty SDN controller can reach any switch (or another controller) within a bounded communication delay (in the presence of a bounded number of failures) and (ii) every switch is managed by a controller. We evaluate Renaissance through a rigorous worst-case analysis as well as a prototype implementation (based on OVS and Floodlight, and Mininet).

cs.NI↗

arXiv2022

Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries

Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which computation and communication is lock-step synchronous but controlled by an oblivious message adversary. In this basic model, determining consensus solvability and designing consensus algorithms in the case where it is possible, has been shown to be surprisingly difficult. We present an explicit decision procedure to determine if consensus is possible under a given adversary. This in turn enables us, for the first time, to study the time complexity of consensus in this model. In particular, we derive time complexity upper bounds for consensus solvability both for a centralized decision procedure as well as for solving distributed consensus. We complement these results with time complexity lower bounds. Intriguingly, we find that reaching consensus under an oblivious message adversary can take exponentially longer than broadcasting the input value of some process to all other processes.

cs.DC↗

arXiv2022

Kevin: de Bruijn-based topology with demand-aware links and greedy routing

We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter network realized with a simple and efficient control plane. In particular, Kevin makes effective use of the network capacity by supporting integrated and multi-hop routing as well as work-conserving scheduling. To this end, Kevin relies on local greedy routing with small forwarding tables which require local updates only during topological reconfigurations, making this approach ideal for dynamic networks. Specifically, Kevin is based on a de Bruijn topology (using a small number of optical circuit switches) in which static links are enhanced with opportunistic links.

cs.NI↗

arXiv2022

A Centrality Analysis of the Lightning Network

Payment channel networks (PCNs) such as the Lightning Network offer an appealing solution to the scalability problem faced by many cryptocurrencies operating on a blockchain such as Bitcoin. However, PCNs also inherit the stringent dependability requirements of blockchain. In particular, in order to mitigate liquidity bottlenecks as well as on-path attacks, it is important that payment channel networks maintain a high degree of decentralization. Motivated by this requirement, we conduct an empirical centrality analysis of the popular Lightning Network, and in particular, the betweenness centrality distribution of the routing system. Based on our extensive data set (using several millions of channel update messages), we implemented a TimeMachine tool which enables us to study the network evolution over time. We find that although the network is generally fairly decentralized, a small number of nodes can attract a significant fraction of the transactions, introducing skew. Furthermore, our analysis suggests that over the last two years, the centrality has increased significantly, e.g., the inequality (measured by the Gini index) has increased by more than 10%.

cs.CR↗

arXiv2022

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies

Reconfigurable optical topologies promise to improve the performance in datacenters by dynamically optimizing the physical network in a demand-aware manner. State-of-the-art optical technologies allow to establish and update direct connectivity (in the form of edge-disjoint matchings) between top-of-rack switches within microseconds or less. However, to fully exploit temporal structure in the demand, such fine-grained reconfigurations also require fast algorithms for optimizing the interconnecting matchings. Motivated by the desire to offload a maximum amount of demand to the reconfigurable network, this paper initiates the study of fast algorithms to find k disjoint heavy matchings in graphs. We present and analyze six algorithms, based on iterative matchings, b-matching, edge coloring, and node-rankings. We show that the problem is generally NP-hard and study the achievable approximation ratios. An extensive empirical evaluation of our algorithms on both real-world and synthetic traces (88 in total), including traces collected in Facebook datacenters and in HPC clusters reveals that all our algorithms provide high-quality matchings, and also very fast ones come within 95% or more of the best solution. However, the running times differ significantly and what is the best algorithm depends on k and the acceptable runtime-quality tradeoff.

cs.DS↗

arXiv2021

PowerTCP: Pushing the Performance Limits of Datacenter Networks

Increasingly stringent throughput and latency requirements in datacenter networks demand fast and accurate congestion control. We observe that the reaction time and accuracy of existing datacenter congestion control schemes are inherently limited. They either rely only on explicit feedback about the network state (e.g., queue lengths in DCTCP) or only on variations of state (e.g., RTT gradient in TIMELY). To overcome these limitations, we propose a novel congestion control algorithm, PowerTCP, which achieves much more fine-grained congestion control by adapting to the bandwidth-window product (henceforth called power). PowerTCP leverages in-band network telemetry to react to changes in the network instantaneously without loss of throughput and while keeping queues short. Due to its fast reaction time, our algorithm is particularly well-suited for dynamic network environments and bursty traffic patterns. We show analytically and empirically that PowerTCP can significantly outperform the state-of-the-art in both traditional datacenter topologies and emerging reconfigurable datacenters where frequent bandwidth changes make congestion control challenging. In traditional datacenter networks, PowerTCP reduces tail flow completion times of short flows by 80% compared to DCQCN and TIMELY, and by 33% compared to HPCC even at 60% network load. In reconfigurable datacenters, PowerTCP achieves 85% circuit utilization without incurring additional latency and cuts tail latency by at least 2x compared to existing approaches.

cs.NI↗

arXiv2021

Robust Routing Made Easy

With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure connectivity despite such failures. While most modern communication networks feature robust routing mechanisms, these mechanisms are often fairly complex to design and verify, as they need to account for the effects of failures and rerouting on communication. This paper revisits the design of robust routing mechanisms, with the aim to avoid such complexity. In particular, we showcase simple and generic blackbox transformations that increase resilience of routing against independently distributed failures, which allows to simulate the routing scheme on the original network, even in the presence of non-benign node failures (henceforth called faults). This is attractive as the system specification and routing policy can simply be preserved. We present a scheme for constructing such a reinforced network, given an existing (synchronous) network and a routing scheme. We prove that this algorithm comes with small constant overheads, and only requires a minimal amount of additional node and edge resources. At the same time, it allows to tolerate a large number of independent random (node) faults, asymptotically almost surely. We complement our analytical results with simulations on different real-world topologies.

cs.DC↗

arXiv2021

Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths)

Today's communication networks have stringent availability requirements and hence need to rapidly restore connectivity after failures. Modern networks thus implement various forms of fast reroute mechanisms in the data plane, to bridge the gap to slow global control plane convergence. State-of-the-art fast reroute commonly relies on disjoint route structures, to offer multiple independent paths to the destination. We propose to leverage the network's path diversity to extend edge disjoint path mechanisms to tree routing, in order to improve the performance of fast rerouting. We present two such tree-mechanisms in detail and show that they boost resilience by up to 12% and 25% respectively on real-world, synthetic, and data center topologies, while still retaining good path length qualities.

cs.NI↗

arXiv2021

HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks

Payment channels effectively move the transaction load off-chain thereby successfully addressing the inherent scalability problem most cryptocurrencies face. A major drawback of payment channels is the need to ``top up'' funds on-chain when a channel is depleted. Rebalancing was proposed to alleviate this issue, where parties with depleting channels move their funds along a cycle to replenish their channels off-chain. Protocols for rebalancing so far either introduce local solutions or compromise privacy. In this work, we present an opt-in rebalancing protocol that is both private and globally optimal, meaning our protocol maximizes the total amount of rebalanced funds. We study rebalancing from the framework of linear programming. To obtain full privacy guarantees, we leverage multi-party computation in solving the linear program, which is executed by selected participants to maintain efficiency. Finally, we efficiently decompose the rebalancing solution into incentive-compatible cycles which conserve user balances when executed atomically. Keywords: Payment Channel Networks, Privacy and Rebalancing.

cs.CR↗

arXiv2021

The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications

Programmable data plane technology enables the systematic reconfiguration of the low-level processing steps applied to network packets and is a key driver in realizing the next generation of network services and applications. This survey presents recent trends and issues in the design and implementation of programmable network devices, focusing on prominent architectures, abstractions, algorithms, and applications proposed, debated, and realized over the past years. We elaborate on the trends that led to the emergence of this technology and highlight the most important pointers from the literature, casting different taxonomies for the field and identifying avenues for future research.

cs.NI↗

arXiv2021

Self-Adjusting Packet Classification

This paper is motivated by the vision of more efficient packet classification mechanisms that self-optimize in a demand-aware manner. At the heart of our approach lies a self-adjusting linear list data structure, where unlike in the classic data structure, there are dependencies, and some items must be in front of the others; for example, to correctly classify packets by rules arranged in a linked list, each rule must be in front of lower priority rules that overlap with it. After each access we can rearrange the list, similarly to Move-To-Front, but dependencies need to be respected. We present a 4-competitive online rearrangement algorithm, whose cost is at most four times worse than the optimal offline algorithm; no deterministic algorithm can be better than 3-competitive. The algorithm is simple and attractive, especially for memory-limited systems, as it does not require any additional memory (e.g., neither timestamps nor frequency statistics). Our approach can simply be deployed as a drop-in replacement for a static datastructure, potentially benefitting many existing networks. We evaluate our self-adjusting list packet classifier on realistic ruleset and traffic instances. We find that our classifier performs similarly to a static list for low-locality traffic, but significantly outperforms Efficuts (by a factor 7x), CutSplit (3.6x), and the static list (14x) for high locality and small rulesets. Memory consumption is 10x lower on average compared to Efficuts and CutSplit.

cs.DS↗

arXiv2021

Skin marker-based subject-specific spinal alignment modeling: A feasibility study

Musculoskeletal models have the potential to improve diagnosis and optimize clinical treatment by predicting accurate outcomes on an individual basis. However, the subject-specific modeling of spinal alignment is often strongly simplified or is based on radiographic assessments, exposing subjects to unnecessary radiation. We therefore developed a novel skin marker-based approach for modeling subject-specific spinal alignment and evaluated its feasibility by comparing the predicted with the actual intervertebral joint (IVJ) locations/orientations (ground truth) using lateral-view radiographic images. Moreover, the predictive performance of the subject-specific models was evaluated by comparing the predicted L1/L2 spinal loads during various functional activities with in vivo measured data obtained from the OrthoLoad database. IVJ locations/orientations were predicted closer to ground truth as opposed to standard model scaling, with average location prediction errors of 0.99+/-0.68 cm on the frontal and 1.21+/-0.97 cm on the transverse axis as well as an average orientation prediction error of 4.74°+/-2.80°. Simulated spinal loads showed similar curve patterns but considerably larger values as compared to in vivo measured data. Differences in spinal loads between generic and subject-specific models become only apparent on an individual subject level. These results underline the feasibility of the proposed method and associated workflow for inter- and intra-subject investigations using musculoskeletal simulations. When implemented into standard model scaling workflows, it is expected to improve the accuracy of muscle activity and joint loading simulations, which is crucial for investigations of treatment effects or pathology-dependent deviations.

physics.med-ph↗

arXiv2021

An Axiomatic Perspective on the Performance Effects of End-Host Path Selection

In various contexts of networking research, end-host path selection has recently regained momentum as a design principle. While such path selection has the potential to increase performance and security of networks, there is a prominent concern that it could also lead to network instability (i.e., flow-volume oscillation) if paths are selected in a greedy, load-adaptive fashion. However, the extent and the impact vectors of instability caused by path selection are rarely concretized or quantified, which is essential to discuss the merits and drawbacks of end-host path selection. In this work, we investigate the effect of end-host path selection on various metrics of networks both qualitatively and quantitatively. To achieve general and fundamental insights, we leverage the recently introduced axiomatic perspective on congestion control and adapt it to accommodate joint algorithms for path selection and congestion control, i.e., multi-path congestion-control protocols. Using this approach, we identify equilibria of the multi-path congestion-control dynamics and analytically characterize these equilibria with respect to important metrics of interest in networks (the 'axioms') such as efficiency, fairness, and loss avoidance. Moreover, we analyze how these axiomatic ratings for a general network change compared to a scenario without path selection, thereby obtaining an interpretable and quantititative formalization of the performance impact of end-host path-selection. Finally, we show that there is a fundamental trade-off in multi-path congestion-control protocol design between efficiency, stability, and loss avoidance on one side and fairness and responsiveness on the other side.

cs.NI↗

arXiv2021

From Stoop to Squat: A comprehensive analysis of lumbar loading among different lifting styles

Lifting up objects from the floor has been identified as a risk factor for low back pain, whereby a flexed spine during lifting is often associated with producing higher loads in the lumbar spine. Even though recent biomechanical studies challenge these assumptions, conclusive evidence is still lacking. This study therefore aimed at comparing lumbar loads among different lifting styles using a comprehensive state-of-the-art motion capture-driven musculoskeletal modeling approach. Thirty healthy pain-free individuals were enrolled in this study and asked to repetitively lift a 15 kg-box by applying 1) a freestyle, 2) a squat and 3) a stoop lifting technique. Whole-body kinematics were recorded using an optical motion capture system and used to drive a full-body musculoskeletal model including a detailed thoracolumbar spine. Compressive, shear and total loads were calculated based on a static optimization approach and expressed as factor body weight (BW). In addition, lumbar lordosis angles and total lifting time were calculated. All parameters were compared among the lifting styles using a repeated measures design. For all lumbar segments, stoop lifting showed significantly lower compressive and total loads (-0.3 to -1.0BW) when compared to freestyle and squat lifting. Stoop lifting produced higher shear loads (+0.1 to +0.8BW) in the segments T12/L1 to L4/L5, but lower loads in L5/S1 (-0.2 to -0.4BW). Peak compressive and total loads during squat lifting occurred approximately 30% earlier in the lifting cycle compared to stoop lifting. Stoop lifting showed larger lumbar lordosis range of motion (35.9+/-10.1°) than freestyle (24.2+/-7.3°) and squat (25.1+/-8.2°) lifting. Lifting time differed significantly with freestyle being executed the fastest (4.6+/-0.7s), followed by squat (4.9+/-0.7s) and stoop (5.9+/-1.1s).

physics.med-ph↗

arXiv2021

The Stoop-Squat-Index: a simple but powerful measure for quantifying lifting behavior

The widely held belief that squat lifting should be preferred over stoop lifting to prevent back injury is increasingly being challenged by recent biomechanical evidence. However, most of these studies only focus on very localized parameters such as lumbar spine flexion, while evaluations of whole-body lifting strategies are largely lacking. For this reason, a novel index, the Stoop-Squat-Index, was developed, which describes the proportion between trunk forward lean and lower extremity joint flexion, with possible values ranging from 0 (full squat lifting) to 100 (full stoop lifting). To enable the interpretation of the index in a real-life setting, normative values were established using motion capture data from 30 healthy pain-free individuals that were collected in the context of a previous study. The results showed mean index values of lower than 30 and higher than 90 for the most relevant phases of the squat and stoop movements, respectively, with mean index values differing significantly from each other for the full duration of the lifting phases. The main advantages of the index are that it is simple to calculate and can not only be derived from motion capture data but also from conventional video recordings, which enables large-scale in-field measurements with relatively low expenditure. When used in combination with lumbar spine flexion measurements, the index can contribute important information, which is necessary for comprehensively evaluating whole-body lifting strategies and to shed more light on the debate over the connection between lifting posture and back complaints.

physics.med-ph↗

arXiv2021

Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion

To ensure high availability, datacenter networks must rely on local fast rerouting mechanisms that allow routers to quickly react to link failures, in a fully decentralized manner. However, configuring these mechanisms to provide a high resilience against multiple failures while avoiding congestion along failover routes is algorithmically challenging, as the rerouting rules can only depend on local failure information and must be defined ahead of time. This paper presents a randomized local fast rerouting algorithm for Clos networks, the predominant datacenter topologies. Given a graph $G=(V,E)$ describing a Clos topology, our algorithm defines local routing rules for each node $v\in V$, which only depend on the packet's destination and are conditioned on the incident link failures. We prove that as long as number of failures at each node does not exceed a certain bound, our algorithm achieves an asymptotically minimal congestion up to polyloglog factors along failover paths. Our lower bounds are developed under some natural routing assumptions.

cs.DC↗