arXiv subjects

Stefan Schmid

Publications and source records attributed to Stefan Schmid.

At least 163 records · Page 9Linked to original sources

arXiv2020

Walking and running with non-specific chronic low back pain: what about the lumbar lordosis angle?

Non-specific chronic low back pain (NSCLBP) is a major health problem, affecting about one fifth of the population worldwide. To avoid further pain or injury, patients with NSCLBP seem to adopt a stiffer movement pattern during everyday living activities. However, it remains unknown how NSCLBP affects the lumbar lordosis angle (LLA) during repetitive activities such as walking or running. This pilot study therefore aimed at exploring possible NSCLBP-related alterations in LLAs during walking and running by focusing on discrete parameters as well as continuous data. Thirteen patients with NSCLBP and 20 healthy pain-free controls were enrolled and underwent a full-body movement analysis involving various everyday living activities such as standing, walking and running. LLAs were derived from markers placed on the spinous processes of the vertebrae L1-L5 and S1. Possible group differences in discrete (average and range of motion (ROM)) and continuous LLAs were analyzed descriptively using mean differences with confidence intervals ranging from 95% to 75%. Patients with NSCLBP indicated reduced average LLAs during standing, walking and running and a tendency for lower LLA-ROM during walking. Analyses of continuous data indicated the largest group differences occurring around 25% and 70% of the walking and 25% and 75% of the running cycle. Furthermore, patients indicated a reversed movement pattern during running, with increasing instead of a decreasing LLAs after foot strike. This study provides preliminary evidence that NSCLBP might affect LLAs during walking and running. These results can be used as a basis for future large-scale investigations involving hypothesis testing.

physics.med-ph↗

arXiv2020

On Search Friction of Route Discovery in Offchain Networks

Offchain networks provide a promising solution to overcome the scalability challenges of cryptocurrencies. However, design tradeoffs of offchain networks are still not well-understood today. In particular, offchain networks typically rely on fees-based incentives and hence require mechanisms for the efficient discovery of ``good routes'': routes with low fees (cost efficiency) and a high success rate of the transaction routing (effectiveness). Furthermore, the route discovery should be confidential (privacy), and e.g., not reveal information about who transacts with whom or about the transaction value. This paper provides an analysis of the ``search friction'' of route discovery, i.e., the costs and tradeoffs of route discovery in large-scale offchain networks in which nodes behave strategically. As a case study, we consider the Lighning network and the route discovery service provided by the trampoline nodes, evaluating the tradeoff in different scenarios also empirically. Finally, we initiate the discussion of alternative charging schemes for offchain networks.

cs.NI↗

arXiv2020

Dynamic Balanced Graph Partitioning

This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between $n$ nodes, with patterns that may change over time, the objective is to service these requests efficiently by partitioning the nodes into $\ell$ clusters, each of size $k$, such that frequently communicating nodes are located in the same cluster. The partitioning can be updated dynamically by migrating nodes between clusters. The goal is to devise online algorithms which jointly minimize the amount of inter-cluster communication and migration cost. The problem features interesting connections to other well-known online problems. For example, scenarios with $\ell=2$ generalize online paging, and scenarios with $k=2$ constitute a novel online variant of maximum matching. We present several lower bounds and algorithms for settings both with and without cluster-size augmentation. In particular, we prove that any deterministic online algorithm has a competitive ratio of at least $k$, even with significant augmentation. Our main algorithmic contributions are an $O(k \log{k})$-competitive deterministic algorithm for the general setting with constant augmentation, and a constant competitive algorithm for the maximum matching variant.

cs.DS↗

arXiv2020

The Value of Information in Selfish Routing

Path selection by selfish agents has traditionally been studied by comparing social optima and equilibria in the Wardrop model, i.e., by investigating the Price of Anarchy in selfish routing. In this work, we refine and extend the traditional selfish-routing model in order to answer questions that arise in emerging path-aware Internet architectures. The model enables us to characterize the impact of different degrees of congestion information that users possess. Furthermore, it allows us to analytically quantify the impact of selfish routing, not only on users, but also on network operators. Based on our model, we show that the cost of selfish routing depends on the network topology, the perspective (users versus network operators), and the information that users have. Surprisingly, we show analytically and empirically that less information tends to lower the Price of Anarchy, almost to the optimum. Our results hence suggest that selfish routing has modest social cost even without the dissemination of path-load information.

cs.GT↗

arXiv2020

Consistent SDNs through Network State Fuzzing

The conventional wisdom is that a software-defined network (SDN) operates under the premise that the logically centralized control plane has an accurate representation of the actual data plane state. Unfortunately, bugs, misconfigurations, faults or attacks can introduce inconsistencies that undermine correct operation. Previous work in this area, however, lacks a holistic methodology to tackle this problem and thus, addresses only certain parts of the problem. Yet, the consistency of the overall system is only as good as its least consistent part. Motivated by an analogy of network consistency checking with program testing, we propose to add active probe-based network state fuzzing to our consistency check repertoire. Hereby, our system, PAZZ, combines production traffic with active probes to periodically test if the actual forwarding path and decision elements (on the data plane) correspond to the expected ones (on the control plane). Our insight is that active traffic covers the inconsistency cases beyond the ones identified by passive traffic. PAZZ prototype was built and evaluated on topologies of varying scale and complexity. Our results show that PAZZ requires minimal network resources to detect persistent data plane faults through fuzzing and localize them quickly while outperforming baseline approaches.

cs.NI↗

arXiv2020

Towards Runtime Verification of Programmable Switches

Is it possible to patch software bugs in P4 programs without human involvement? We show that this is partially possible in many cases due to advances in software testing and the structure of P4 programs. Our insight is that runtime verification can detect bugs, even those that are not detected at compile-time, with machine learning-guided fuzzing. This enables a more automated and real-time localization of bugs in P4 programs using software testing techniques like Tarantula. Once the bug in a P4 program is localized, the faulty code can be patched due to the programmable nature of P4. In addition, platform-dependent bugs can be detected. From P4_14 to P4_16 (latest version), our observation is that as the programmable blocks increase, the patchability of P4 programs increases accordingly. To this end, we design, develop, and evaluate P6 that (a) detects, (b) localizes, and (c) patches bugs in P4 programs with minimal human interaction. P6 tests P4 switch non-intrusively, i.e., requires no modification to the P4 program for detecting and localizing bugs. We used a P6 prototype to detect and patch seven existing bugs in eight publicly available P4 application programs deployed on two different switch platforms: behavioral model (bmv2) and Tofino. Our evaluation shows that P6 significantly outperforms bug detection baselines while generating fewer packets and patches bugs in P4 programs such as switch.p4 without triggering any regressions.

cs.SE↗

arXiv2020

Push-Down Trees: Optimal Self-Adjusting Complete Trees

This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a tradeoff between the benefits of such adjustments (shorter routes) and their costs (reconfigurations). In particular, we consider the problem of designing a self-adjusting tree network which serves single-source, multi-destination communication. The problem has interesting connections to self-adjusting datastructures. We present two constant-competitive online algorithms for this problem, one randomized and one deterministic. Our approach is based on a natural notion of Most Recently Used (MRU) tree, maintaining a working set. We prove that the working set is a cost lower bound for any online algorithm, and then present a randomized algorithm RANDOM-PUSH which approximates such an MRU tree at low cost, by pushing less recently used communication partners down the tree, along a random walk. Our deterministic algorithm MOVE-HALF does not directly maintain an MRU tree, but its cost is still proportional to the cost of an MRU tree, and also matches the working set lower bound.

cs.DS↗

arXiv2020

Towards Fine-Grained Billing For Cloud Networking

We revisit multi-tenant network virtualization in data centers, and make the case for tenant-specific virtual switches. In particular, tenant-specific virtual switches allow cloud providers to extend fine-grained billing (known, e.g., from serverless architectures) to the network, accounting not only for IO, but also CPU or energy. We sketch an architecture and present economical motivation and recent technological enablers. We also find that virtual switches today do not offer sufficient multi-tenancy and can introduce artificial performance bottlenecks, e.g., in load balancers. We conclude by discussing additional use cases for tentant-specific switches.

cs.NI↗

arXiv2020

Spinal Compressive Forces in Adolescent Idiopathic Scoliosis With and Without Carrying Loads: A Musculoskeletal Modeling Study

The pathogenesis of adolescent idiopathic scoliosis (AIS) remains poorly understood and biomechanical data are limited. A deeper insight into spinal loading could provide valuable information for the improvement of current treatment strategies. This work therefore aimed at using subject-specific musculoskeletal full-body models of patients with AIS to predict segmental compressive forces around the curve apex and to investigate how these forces are affected by simulated load carrying. Models were created based on spatially calibrated biplanar radiographic images from 24 patients with mild to moderate AIS and validated by comparing predictions of paravertebral muscle activity with reported values from in vivo studies. Spinal compressive forces were predicted during unloaded upright standing as well as upright standing with external loads of 10%, 15% and 20% of body weight (BW) applied to the scapulae to simulate carrying a backpack in the regular way, in front of the body and over both shoulders. The validation studies showed higher convex muscle activity, which was comparable to the literature. The implementation of spinal deformity resulted in a 10% increase of compressive force at the curve apex during unloaded upright standing. Apical compressive forces further increased by 50-62%, 77-94% and 103-128% for 10%, 15% and 20% BW loads, respectively. Moreover, load-dependent compressive force increases were the lowest in the regular backpack and the highest in the frontpack and convex conditions. The predictions indicated increased segmental compressive forces during unloaded standing, which could be ascribed to the scoliotic deformation. When carrying loads, compressive forces further increased depending on the carrying mode and the weight of the load. These results can be used as a basis for further studies investigating segmental loading in AIS patients during functional activities.

physics.med-ph↗

arXiv2020

Toward Active and Passive Confidentiality Attacks On Cryptocurrency Off-Chain Networks

Cryptocurrency off-chain networks such as Lightning (e.g., Bitcoin) or Raiden (e.g., Ethereum) aim to increase the scalability of traditional on-chain transactions. To support nodes in learning about possible paths to route their transactions, these networks need to provide gossip and probing mechanisms. This paper explores whether these mechanisms may be exploited to infer sensitive information about the flow of transactions, and eventually harm privacy. In particular, we identify two threats, related to an active and a passive adversary. The first is a probing attack: here the adversary aims to detect the maximum amount which is transferable in a given direction over a target channel by actively probing it and differentiating the response messages it receives. The second is a timing attack: the adversary discovers how close the destination of a routed payment actually is, by acting as a passive man-in-the middle and analyzing the time deltas between sent messages and their corresponding responses. We then analyze the limitations of these attacks and propose remediations for scenarios in which they are able to produce accurate results.

cs.CR↗

arXiv2020

Musculoskeletal full-body models including a detailed thoracolumbar spine for children and adolescents aged 6-18 years

Currently available musculoskeletal inverse-dynamics thoracolumbar spine models are entirely based on data from adults and might therefore not be applicable for simulations in children and adolescents. In addition, these models lack lower extremities, which are required for comprehensive evaluations of functional activities or therapeutic exercises. We therefore created OpenSim-based musculoskeletal full-body models including a detailed thoracolumbar spine for children and adolescents aged 6-18 years and validated by comparing model predictions to in vivo data. After combining our recently developed adult thoracolumbar spine model with a lower extremity model, children and adolescent models were created for each year of age by adjusting segmental length and mass distribution, center of mass positions and moments of inertia of the major body segments as well as sagittal pelvis and spine alignment based on literature data. Similarly, muscle strength properties were adjusted based on CT-derived cross-sectional area measurements. Simulations were conducted from in vivo studies reported in the literature involving children and adolescents evaluating maximum trunk muscle strength (MTMS), lumbar disc compressibility (LDC), intradiscal pressure (IDP) and trunk muscle activity (MA). Model predictions correlated highly with in vivo data (MTMS: r>=0.82, p<=0.03; LDC: r=0.77, p<0.001; IDP: r>=0.78, p<0.001; MA: r>=0.90, p<0.001), indicating suitability for the reasonably accurate prediction of maximal trunk muscle strength, segmental loading and trunk muscle activity in children and adolescents. When aiming at investigating children or adolescents with pathologies such as idiopathic scoliosis, our models can serve as a basis for the creation of deformed spine models and for comparative purposes.

physics.med-ph↗

arXiv2020

Measuring lumbar back motion during functional activities using a portable strain gauge sensor-based system: a comparative evaluation and reliability study

Quantifying lumbar back motion during functional activities in real-life environments may contribute to a better understanding of common pathologies such as spinal disorders. The current study therefore aimed at the comparative evaluation of the Epionics SPINE system, a portable device for measuring sagittal lumbar back motion during functional activities. Twenty healthy participants were therefore evaluated with the Epionics SPINE and a Vicon motion capture system in two identical separate research visits. They performed the following activities: standing, sitting, chair rising, box lifting, walking, running and a counter movement jump (CMJ). Lumbar lordosis angles were extracted as continuous values as well as average and range of motion (ROM) parameters. Agreement between the systems was evaluated using Bland-Altman analyses, whereas within- and between-session reliability were assessed using intraclass correlation coefficients (ICC) and minimal detectable changes (MDC). The analysis showed excellent agreement between the systems for chair rising, box lifting and CMJ with a systematic underestimation of lumbar lordosis angles during walking and running. Reliability was moderate to high for all continuous and discrete parameters (ICC>=0.62), except for ROM during running (ICC=0.29). MDC values were generally below 15°, except for CMJ (peak values up to 20° within and 25° between the sessions). The Epionics SPINE system performed similarly to a Vicon motion capture system for measuring lumbar lordosis angles during functional activities and showed high consistency within and between measurement sessions. These findings can serve researchers and clinicians as a bench mark for future investigations using the system in populations with spinal pathologies.

physics.med-ph↗

arXiv2019

Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff

Off-chain transaction networks can mitigate the scalability issues of today's trustless electronic cash systems such as Bitcoin. However, these peer-to-peer networks also introduce a new attack surface which is not well-understood today. This paper identifies and analyzes, a novel Denial-of-Service attack which is based on route hijacking, i.e., which exploits the way transactions are routed and executed along the created channels of the network. This attack is conceptually interesting as even a limited attacker that manipulates the topology through the creation of new channels can navigate tradeoffs related to the way it attacks the network. Furthermore, the attack also highlights a fundamental design tradeoff for the defender (who determines its own routes): to become less predictable and hence secure, a rational node has to pay higher fees to nodes that forward its payments. We find that the three most common implementations for payment channels in Bitcoin (lnd, C-lightning, Eclair) approach routing differently. We begin by surveying the current state of the Lightning network and explore the routes chosen by these implementations. We find that in the current network nearly 60\% of all routes pass through only five nodes, while 80\% go through only 10 nodes. Thus, a relatively small number of colluding nodes can deny service to a large fraction of the network. We then turn to study an external attacker who creates links to the network and draws more routes through its nodes by asking for lower fees. We find that just five new links are enough to draw the majority (65\% - 75\%) of the traffic regardless of the implementation being used. The cost of creating these links is very low. We discuss the differences between implementations and eventually derive our own suggested routing policy, which is based on a novel combination of existing approaches.

cs.CR↗

arXiv2019

Integrality properties in the Moduli Space of Elliptic Curves: Isogeny Case

For a fixed $j$-invariant $j_0$ of an elliptic curve without complex multiplication we bound the number of $j$-invariants $j$ that are algebraic units and such that elliptic curves corresponding to $j$ and $j_0$ are isogenous. Our bounds are effective. We also modify the problem slightly by fixing a singular modulus $α$ and looking at all $j$ such that $j-α$ is an algebraic unit and such that elliptic curves corresponding to $j$ and $j_0$ are isogenous. The number of such $j$ can again be bounded effectively.

math.NT↗

arXiv2019

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees

While SDNs enable more flexible and adaptive network operations, (logically) centralized reconfigurations introduce overheads and delays, which can limit network reactivity. This paper initiates the study of a more distributed approach, in which the consistent network updates are implemented by the switches and routers directly in the data plane. In particular, our approach leverages concepts from local proof labeling systems, which allows the data plane elements to locally check network properties, and we show that this is sufficient to obtain global network guarantees. We demonstrate our approach considering three fundamental use cases, and analyze its benefits in terms of performance and fault-tolerance.

cs.DC↗

arXiv2019

Integrality properties in the Moduli Space of Elliptic Curves: CM Case

A result of Habegger shows that there are only finitely many singular moduli such that $j$ or $j-α$ is an algebraic unit. The result uses Duke's Equidistribution Theorem and is thus not effective. For a fixed $j$-invariant $α\in \bar{\mathbb{Q}}$ of an elliptic curve without complex multiplication, we prove that there are only finitely many singular moduli $j$ such that $j-α$ is an algebraic unit. The difference to the work of Habegger is that we give explicit bounds.

math.NT↗

arXiv2019

The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game

The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to "one-shot games"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature.

cs.GT↗

arXiv2019

Measuring the Complexity of Packet Traces

This paper studies the structure of several real-world traces (including Facebook, High-Performance Computing, Machine Learning, and simulation generated traces) and presents a systematic approach to quantify and compare the structure of packet traces based on the entropy contained in the trace file. Insights into the structure of packet traces can lead to improved network algorithms that are optimized toward specific traffic patterns. We then present a methodology to quantify the temporal and non-temporal components of entropy contained in a packet trace, called the trace complexity, using randomization and compression. We show that trace complexity provides unique insights into the characteristics of various applications and argue that there is a need for traffic generation models that preserve the intrinsic structure of empirically measured application traces. We then propose a traffic generator model that is able to produce a synthetic trace that matches the complexity level of its corresponding real-world trace.

cs.NI↗