In recent years, Active Queue Management (AQM) mechanisms to improve the performance of TCP/IP networks have acquired a relevant role. In this paper, we present a simple and robust RED-type algorithm together with a couple of dynamical variants with the ability to adapt to the specific characteristics of different network environments, as well as to the user’s needs. We first present a basic version called Beta RED (BetaRED), where the parameters can be tuned according to the specific network conditions. The aim is to introduce control parameters that are easy to interpret and provide a good performance over a wide range of values. Secondly, BetaRED is used as a framework to design two dynamic algorithms, which we will call Adaptive Beta RED (ABetaRED) and Dynamic Beta RED (DBetaRED). In those new algorithms, certain parameters are dynamically adjusted so that the queue length remains stable around a predetermined reference value and according to changing network traffic conditions. Finally, we present a battery of simulations using the Network Simulator 3 (ns-3) software with a two-fold objective: to guide the user on how to adjust the parameters of the BetaRED mechanism, and to show a performance comparison of ABetaRED and DBetaRED with other representative algorithms that pursue a similar objective.
Hydrocephalus is a medical condition consisting of an abnormal accumulation of cerebrospinal fluid within the brain. A catheter is inserted in one of the brain ventricles and then connected to an external valve to drain the excess of cerebrospinal fluid. The main drawback of this technique is that, over time, the ventricular catheter ends up getting blocked by the cells and macromolecules present in the cerebrospinal fluid. A crucial factor influencing this obstruction is a non-uniform flow pattern through the catheter, since it facilitates adhesion of suspended particles to the walls. In this paper we focus on the effects that tilted holes as well as conical holes have on the flow distribution and shear stress. We have carried out 3D computational simulations to study the effect of the hole geometry on the cerebrospinal fluid flow through ventricular catheters. All the simulations were done with the OpenFOAM® toolbox. In particular, three different groups of models were investigated by varying (i) the tilt angles of the holes, (ii) the inner and outer diameters of the holes, and (iii) the distances between the so-called hole segments. The replacement of cylindrical holes by conical holes was found to have a strong influence on the flow distribution and to lower slightly the shear stress. Tilted holes did not involve flow distribution changes when the hole segments are sufficiently separated, but the mean shear stress was certainly reduced. The authors present new results about the behavior of the fluid flow through ventricular catheters. These results complete earlier work on this topic by adding the influence of the hole geometry. The overall objective pursued by this research is to provide guidelines to improve existing commercially available ventricular catheters.
The relation between the complexity of a time-switched dynamics and the complexity of its control sequence depends critically on the concept of a non-autonomous pullback attractor. For instance, the switched dynamics associated with scalar dissipative affine maps has a pullback attractor consisting of singleton component sets. This entails that the complexity of the control sequence and switched dynamics, as quantified by the topological entropy, coincide. In this paper we extend the previous framework to pullback attractors with nontrivial components sets in order to gain further insights in that relation. This calls, in particular, for distinguishing two distinct contributions to the complexity of the switched dynamics. One proceeds from trajectory segments connecting different component sets of the attractor; the other contribution proceeds from trajectory segments within the component sets. We call them “macroscopic” and “microscopic” complexity, respectively, because only the first one can be measured by our analytical tools. As a result of this picture, we obtain sufficient conditions for a switching system to be more complex than its unswitched subsystems, i.e., a complexity analogue of Parrondo’s paradox.
15 May 2017 in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
The obstruction of ventricular catheters (VCs) is a major problem in the standard treatment of hydrocephalus, the flow pattern of the cerebrospinal fluid (CSF) being one important factor thereof. As a first approach to this problem, some of the authors studied previously the CSF flow through VCs under time-independent boundary conditions by means of computational fluid dynamics in three-dimensional models. This allowed us to derive a few basic principles which led to designs with improved flow patterns regarding the obstruction problem. However, the flow of the CSF has actually a pulsatile nature because of the heart beating and blood flow. To address this fact, here we extend our previous computational study to models with oscillatory boundary conditions. The new results will be compared with the results for constant flows and discussed. It turns out that the corrections due to the pulsatility of the CSF are quantitatively small, which reinforces our previous findings and conclusions. This article is part of the themed issue ‘Mathematical methods in medicine: neuroscience, cardiology and pathology’.
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore, it simplifies a previous algorithm, also based on min-max symbols, which was originally proposed for twice differentiable multimodal maps. The new algorithm has been benchmarked against the old one with a number of multimodal maps, the results being reported in the paper. The comparison is favorable to the new algorithm, except in the unimodal case.
We derive an algorithm to recursively determine the lap number (minimal number of monotonicity segments) of the iterates of twice differentiable l-modal map, enabling to numerically calculate the topological entropy of these maps. The algorithm is obtained by the min-max sequences—symbolic sequences that encode qualitative information about all the local extrema of iterated maps.