Search
Filters
total: 25
Search results for: FAST CALCULATION OF ALTERNATE PATHS
-
Toward Fast Calculation of Communication Paths for Resilient Routing
PublicationUtilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublicationProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
Evaluation of time-efficiency of disjoint paths calculation schemes
PublicationThe concept of alternate paths has been shown in the literature to provide fast response of a network to failures of its elements (nodes/links) affecting flows along the primary communication paths. Various approaches have been proposed to reduce the time necessary to redirect the respective flows onto the alternate paths. In this paper, we focus on another important objective, that so far has not received much attention, i.e.,...
-
An approach to improve the time efficiency of disjoint paths calculation
PublicationFailures of network elements can be appropriately dealt with by utilization of alternate disjoint paths to provide redirection of flows affected by failures of the respective working paths. Known approaches can be broadly divided by decision on backup paths installation into proactive and reactive mechanisms, as well as based on the scope of recovery actions into local and global rerouting. There are several important scenarios...
-
Comparison of IP-based and explicit paths for one-to-one fast reroute in MPLS networks
Publication -
Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute
Publication -
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
PublicationDisjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...
-
INTER-LAYER SHARING OF BACKUP PATH CAPACITIES PROVIDING FAST SERVICE RECOVERY IN IP-MPLS/WDM NETWORKS
PublicationIn this paper, we investigate the issue of providing the transmission continuity in IP-MPLS/WDM networks in the presence of failures of nodes/links. Special focus is put on assuring fast restoration of flows affected after a failure in a scenario assuming sharing the backup path capacities in order to decrease the overall bandwidth consumption. In particular, we propose a new approach to inter-layer sharing of link capacity reserved...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Discrete convolution based on polynomial residue representation
PublicationThis paper presents the study of fast discrete convolution calculation with use of the Polynomial Residue Number System (PRNS). Convolution can be based the algorithm similar to polynomial multiplication. The residue arithmetic allows for fast realization of multiplication and addition, which are the most important arithmetic operations in the implementation of convolution. The practical aspects of hardware realization of PRNS...
-
Computer-Aided Calculations of Earth Potential Rise in High Voltage Overhead Lines
PublicationHigh voltage overhead power lines with earth wires comprise towers made of conductive material. Some towers are in locations where people can be expected to be either for a long time or for a short time but very frequently. Evaluation of shock hazard near such towers requires calculation of line-to-earth short-circuit current, earth current and especially earth potential rise. Number of towers in high voltage power lines can exceed...
-
Termination functions for evolutionary path planning algorithm
PublicationIn this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Five...
-
Disaster-Resilient Routing Schemes for Regional Failures
PublicationLarge-scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical...
-
Compact global association based adaptive routing framework for personnel behavior understanding
PublicationPersonnel behavior understanding under complex scenarios is a challenging task for computer vision. This paper proposes a novel Compact model, which we refer to as CGARPN that incorporates with Global Association relevance and Adaptive Routing Pose estimation Network. Our framework firstly introduces CGAN backbone to facilitate the feature representation by compressing the kernel parameter space compared with typical algorithms,...
-
A nine-input 1.25 mW, 34 ns CMOS analog median filter for image processing in real time
PublicationIn this paper an analog voltage-mode median filter, which operates on a 3 × 3 kernel is presented. The filter is implemented in a 0.35 μm CMOS technology. The proposed solution is based on voltage comparators and a bubble sort configuration. As a result, a fast (34 ns) time response with low power consumption (1.25 mW for 3.3 V) is achieved. The key advantage of the configuration is relatively high accuracy of signal processing,...
-
Very accurate time propagation of coupled Schrödinger equations for femto- and attosecond physics and chemistry, with C++ source code
PublicationIn this article, I present a very fast and high-precision (up to 33 decimal places) C++ implementation of the semi-global time propagation algorithm for a system of coupled Schrödinger equations with a time-dependent Hamiltonian. It can be used to describe time-dependent processes in molecular systems after excitation by femto- and attosecond laser pulses. It also works with an arbitrary user supplied Hamiltonian and can be used...
-
Simulation model for evaluation of QOS dynamic routing
PublicationCurrent informational networks use a large variety of technologies to support data exchange. Most of them are focused on IP protocol and include mechanisms which by definition should supply demanded QoS. One of those mechanisms is efficient path calculation - routing. Traffic offered to the network can change very rapidly in short term. Routing should support such traffic changes and all the time calculate valid paths in terms...
-
Flow through a prosthetic mechanical aortic valve: Numerical model and experimental study
PublicationThis research presents a numerical model dedicated for virtual patient diagnostics in the field of synthetic valve implantation. The model operates based on computational fluid dynamics solver with implemented rigid body motion solver. Characteristic indicators related to the prosthetic valve were determined to assess the correctness of cardiac system operation after implantation. A novel approach for dynamic time discretization...
-
Numerical assessment of ultimate strength of severe corroded stiffened plates
PublicationThe objective of this work is to investigate numerically (using the non-linear FEM and the approach stipulated by the Common Structural Rules) the severe nonuniform corrosion degradation effect on the ultimate strength of stiffened plates and compare the results to the already published experimental works. Different factors governing structural behavior of corroded stiffened plates are investigated, such as corrosion degradation level,...
-
A New Approach of Solidification Analysis in Modular Latent Thermal Energy Storage Unit Based on Image Processing
PublicationThe solidification process of RT18HC in a cylindrical shell and tube storage unit has been studied using a new methodology based on image processing. The main idea of the algorithm is to label the region of solidification and use statistical functions to calculate the dimensions of the solidification front over time. Said analysis includes two methods. The first method is to measure the solid fraction changes during solidification....
-
Efficient model order reduction for FEM analysis of waveguide structures and resonators
PublicationAn efficient model order reduction method for three-dimensional Finite Element Method (FEM) analysis of waveguide structures is proposed. The method is based on the Efficient Modal Order Reduction (ENOR) algorithm for creating macro-elements in cascaded subdomains. The resulting macro-elements are represented by very compact submatrices, leading to significant reduction of the overall number of unknowns. The efficiency of the model...
-
Zastosowanie sygnałów o projektowanych kształtach do diagnostyki obiektów wysoko-impedancyjnych metodą spektroskopii impedancyjnej
PublicationW artykule przedstawiono metodę szybkiej spektroskopii impedancyjnej obiektów o wysokich impedancjach (|Zx| > 1 GOhm) z zastosowaniem sygnałów o projektowanych kształtach. Sygnał pobudzenia wytwarzany jest w module DAQ U2531A i doprowadzany na wejście badanego obiektu za pośrednictwem przetwornika cyfrowo-analogowego (CA). Sygnały odpowiedzi proporcjonalne do napięcia na mierzonej impedancji Zx oraz prądu płynącego przez Zx są...
-
A Concept for Safe and Less Expensive Acceleration of a Marine Steam Turbine Start-up
PublicationThis paper analyses the issue of accelerated start-up of a marine steam turbine, which is an important problem because the start-up of a steam machine involves the combustion of fuel that is not transformed into useful energy. To find novel technologies that offer improvements in this aspect is essential due to restrictions on reducing ship emissions. Thus, the shorter the start-up time, the better for the environment and economy....
-
Designing of Track Axis Alignment with the Use of Satellite Measurements and Particle Swarm Optimization
PublicationDesigning of the track’s alignment is a key issue from the point of view of maintaining of proper geometries. The paper presents a design method for sections of railway line located in the horizontal arch. The method is adapted to the technique of mobile satellite measurements. The general principles of this measurement method have been described in the article. A project's solution has been presented using mathematical notation...
-
A new concept of PWM duty cycle computation using the Barycentric Coordinates in a Three-Dimensional voltage vectors arrangement
PublicationThe paper presents a novel approach to the Pulse Width Modulation (PWM) duty cycle computing for complex or irregular voltage vector arrangements in the two (2D) and three–dimensional (3D) Cartesian coordinate systems. The given vectors arrangement can be built using at least three vectors or collections with variable number of involved vectors (i.e. virtual vectors). Graphically, these vectors form a convex figure, in particular,...