scholarly journals A Novel Control Theoretic Model for Resilient Packet Ring (RPR) Fairness

2021 ◽  
Author(s):  
Hossein Ghandehari-Alavijeh

Resilient Packet Ring (RPR) is a new Data Link Layer ring protocol. In RPR, the ring is a shared medium for multiple nodes compete to get a portion of shared bandwidth. Fairness algorithm is responsible for allocating fair bandwidth among competing nodes. In our research, we address the stability problems of the current RPR Fairness and introduce a new solution. The present work is the first control theoretic approach to RPR Fairness and Congestion Control that rigorously models the dynamics of RPR Fairness algorithm by using control theory. The key idea is to involve the active nodes in the Fairness and Queue Congestion Control process which means developing a decentralized control system. In RPR, when the number of nodes or the distance between the RPR nodes is high, the delay plays an important role in the behavior of the fairness which may lead to oscillation, instability and packet loss. We propose the implementation of Smith predictor as a valuable technique to overcome the effects of this delay and achieve higher throughput. Our new theoretical insights allow us to design fairness and congestion control algorithms that achieve fair bandwidth allocation and high throughput with small buffer requirement even in presence of large delay and large number of active nodes in the ring.

2021 ◽  
Author(s):  
Hossein Ghandehari-Alavijeh

Resilient Packet Ring (RPR) is a new Data Link Layer ring protocol. In RPR, the ring is a shared medium for multiple nodes compete to get a portion of shared bandwidth. Fairness algorithm is responsible for allocating fair bandwidth among competing nodes. In our research, we address the stability problems of the current RPR Fairness and introduce a new solution. The present work is the first control theoretic approach to RPR Fairness and Congestion Control that rigorously models the dynamics of RPR Fairness algorithm by using control theory. The key idea is to involve the active nodes in the Fairness and Queue Congestion Control process which means developing a decentralized control system. In RPR, when the number of nodes or the distance between the RPR nodes is high, the delay plays an important role in the behavior of the fairness which may lead to oscillation, instability and packet loss. We propose the implementation of Smith predictor as a valuable technique to overcome the effects of this delay and achieve higher throughput. Our new theoretical insights allow us to design fairness and congestion control algorithms that achieve fair bandwidth allocation and high throughput with small buffer requirement even in presence of large delay and large number of active nodes in the ring.


2020 ◽  
Vol 117 (32) ◽  
pp. 19245-19253 ◽  
Author(s):  
Soumyadip Sahu ◽  
Zhenzhen Wang ◽  
Xinfu Jiao ◽  
Chunfang Gu ◽  
Nikolaus Jork ◽  
...  

Regulation of enzymatic 5′ decapping of messenger RNA (mRNA), which normally commits transcripts to their destruction, has the capacity to dynamically reshape the transcriptome. For example, protection from 5′ decapping promotes accumulation of mRNAs into processing (P) bodies—membraneless, biomolecular condensates. Such compartmentalization of mRNAs temporarily removes them from the translatable pool; these repressed transcripts are stabilized and stored until P-body dissolution permits transcript reentry into the cytosol. Here, we describe regulation of mRNA stability and P-body dynamics by the inositol pyrophosphate signaling molecule 5-InsP7(5-diphosphoinositol pentakisphosphate). First, we demonstrate 5-InsP7inhibits decapping by recombinant NUDT3 (Nudix [nucleoside diphosphate linked moiety X]-type hydrolase 3) in vitro. Next, in intact HEK293 and HCT116 cells, we monitored the stability of a cadre of NUDT3 mRNA substrates following CRISPR-Cas9 knockout ofPPIP5Ks(diphosphoinositol pentakisphosphate 5-kinases type 1 and 2, i.e.,PPIP5KKO), which elevates cellular 5-InsP7levels by two- to threefold (i.e., within the physiological rheostatic range). ThePPIP5KKO cells exhibited elevated levels of NUDT3 mRNA substrates and increased P-body abundance. Pharmacological and genetic attenuation of 5-InsP7synthesis in the KO background reverted both NUDT3 mRNA substrate levels and P-body counts to those of wild-type cells. Furthermore, liposomal delivery of a metabolically resistant 5-InsP7analog into wild-type cells elevated levels of NUDT3 mRNA substrates and raised P-body abundance. In the context that cellular 5-InsP7levels normally fluctuate in response to changes in the bioenergetic environment, regulation of mRNA structure by this inositol pyrophosphate represents an epitranscriptomic control process. The associated impact on P-body dynamics has relevance to regulation of stem cell differentiation, stress responses, and, potentially, amelioration of neurodegenerative diseases and aging.


Author(s):  
Zakarya Omar ◽  
Xingsong Wang ◽  
Khalid Hussain ◽  
Mingxing Yang

AbstractThe typical power-assisted hip exoskeleton utilizes rotary electrohydraulic actuator to carry out strength augmentation required by many tasks such as running, lifting loads and climbing up. Nevertheless, it is difficult to precisely control it due to the inherent nonlinearity and the large dead time occurring in the output. The presence of large dead time fires undesired fluctuation in the system output. Furthermore, the risk of damaging the mechanical parts of the actuator increases as these high-frequency underdamped oscillations surpass the natural frequency of the system. In addition, system closed-loop performance is degraded and the stability of the system is unenviably affected. In this work, a Sliding Mode Controller enhanced by a Smith predictor (SMC-SP) scheme that counts for the output delay and the inherent parameter nonlinearities is presented. SMC is utilized for its robustness against the uncertainty and nonlinearity of the servo system parameters whereas the Smith predictor alleviates the dead time of the system’s states. Experimental results show smoother response of the proposed scheme regardless of the amount of the existing dead time. The response trajectories of the proposed SMC-SP versus other control methods were compared for a different predefined dead time.


2019 ◽  
Vol 69 (1) ◽  
pp. 185-198
Author(s):  
Fadoua Chigr ◽  
Frédéric Mynard

AbstractThis article fits in the context of the approach to topological problems in terms of the underlying convergence space structures, and serves as yet another illustration of the power of the method. More specifically, we spell out convergence-theoretic characterizations of the notions of weak base, weakly first-countable space, semi-metrizable space, and symmetrizable spaces. With the help of the already established similar characterizations of the notions of Frchet-Ursyohn, sequential, and accessibility spaces, we give a simple algebraic proof of a classical result regarding when a symmetrizable (respectively, weakly first-countable, respectively sequential) space is semi-metrizable (respectively first-countable, respectively Fréchet) that clarifies the situation for non-Hausdorff spaces. Using additionally known results on the commutation of the topologizer with product, we obtain simple algebraic proofs of various results of Y. Tanaka on the stability under product of symmetrizability and weak first-countability, and we obtain the same way a new characterization of spaces whose product with every metrizable topology is weakly first-countable, respectively symmetrizable.


2020 ◽  
Vol 30 (13) ◽  
pp. 2030038
Author(s):  
Nikola Beneš ◽  
Luboš Brim ◽  
Samuel Pastva ◽  
David Šafránek

Digital bifurcation analysis is a new algorithmic method for exploring how the behavior of a parameter-dependent discrete system varies with a change in its parameters and, in particular, for the identification of bifurcation points where such variation becomes dramatic. We have developed the method in an analogy with the traditional bifurcation theory and have successfully applied it to models taken from systems biology. In this paper, we report on the application of the digital bifurcation analysis for analyzing the stability of internet congestion control protocols by inspecting their attractor bifurcations. In contrast to the analytical methods, our approach allows fully automated analysis. We compared the robustness of the basic Random Early Drop (RED) approach with four substantially different extensions, namely gentle, adaptive, gradient descent, and integral feedback RED. The basic RED protocol is well known to exhibit unstable behavior when parameters are varied. In the case of adaptive and gradient descent RED protocol, the analysis showed significant improvements in stability, whereas in the results for gentle and integral feedback RED protocols the improvement was negligible. We performed a series of model simulations, the results of which were in accordance with our bifurcation analysis. Based on our results, we can recommend both adaptive and gradient descent RED to improve the robustness of the RED protocol.


2019 ◽  
Vol 111 ◽  
pp. 06016
Author(s):  
Nikolajs Bogdanovs ◽  
Romualds Beļinskis ◽  
Ernests Petersons ◽  
Andris Krūmiņš ◽  
Artūrs Brahmanis

The analysis of a problem of development of control systems for objects with big time delay is carried out in this work. For such objects it is difficult to provide high-quality control, because the control is carried on the last status of object’s output. The main setup methods of PID regulators have been examined. Based on this analysis the technique of complete synthesis of the regulator of higher level is given in order to regulate building’s heating system. This work offers a new method of object’s control with distributed delay. As the test bed for the offered structure of control the valve of hot water supply in a heat-node is used. Using the test bed the stability of the system with time delay have been studied, which is controlled by the PID-regulator assisted by Smith Predictor used to compensate the dead time.


2018 ◽  
Vol 15 (4) ◽  
pp. 82-96 ◽  
Author(s):  
Lei Wu ◽  
Yuandou Wang

Cloud computing, with dependable, consistent, pervasive, and inexpensive access to geographically distributed computational capabilities, is becoming an increasingly popular platform for the execution of scientific applications such as scientific workflows. Scheduling multiple workflows over cloud infrastructures and resources is well recognized to be NP-hard and thus critical to meeting various types of Quality-of-Service (QoS) requirements. In this work, the authors consider a multi-objective scientific workflow scheduling framework based on the dynamic game-theoretic model. It aims at reducing make-spans, cloud cost, while maximizing system fairness in terms of workload distribution among heterogeneous cloud virtual machines (VMs). The authors consider randomly-generated scientific workflow templates as test cases and carry out extensive real-world tests based on third-party commercial clouds. Experimental results show that their proposed framework outperforms traditional ones by achieving lower make-spans, lower cost, and better system fairness.


Sign in / Sign up

Export Citation Format

Share Document