A5023945983- Reliability and Maintenance Optimization
- Probabilistic and Robust Engineering Design
- Statistical Distribution Estimation and Applications
- Advanced Optical Network Technologies
- Probability and Risk Models
- Software Reliability and Analysis Research
- Scheduling and Optimization Algorithms
- Advanced Graph Theory Research
- Advanced Queuing Theory Analysis
- E-Learning and Knowledge Management
- Risk and Safety Analysis
- Interconnection Networks and Systems
- Peer-to-Peer Network Technologies
- Graph theory and applications
- Mathematical Approximation and Integration
- Insurance, Mortality, Demography, Risk Management
- Advanced Manufacturing and Logistics Optimization
- VLSI and FPGA Design Techniques
- Network Traffic and Congestion Control
- Advanced Multi-Objective Optimization Algorithms
- Markov Chains and Monte Carlo Methods
- Power System Reliability and Maintenance
- Simulation Techniques and Applications
- Statistical Methods and Inference
- Image and Video Quality Assessment
Universidad de la República de Uruguay
2014-2024
Universidad La República
2006-2024
University of Quindío
2023
Higher University of San Andrés
2023
University of Buenos Aires
2023
University of the Andes
2023
Federico Santa María Technical University
2023
Universidad Católica Nuestra Señora de la Asunción
2023
Adolfo Ibáñez University
2022-2023
Universidad de Montevideo
1998-2009
Network reliability computation is an NP-hard problem which has attracted much attention in literature. This consists in, given a network where the links may fail or operate with known probabilities, to compute probability that subset of nodes (known as terminals) are connected by operational links. Given difficulty exact value reliability, alternative been explored literature use Monte Carlo estimation methods. In this work we discuss Permutation Carlo, highly efficient method. The method...
This paper proposes a new formulation of the recursive variance-reduction Monte Carlo estimator /spl kappa/ terminal unreliability parameter communication systems. allows significant reduction in simulation execution time, as demonstrated by experimental results.
In evaluating the capacity of a communication network architecture to resist possible faults some its components, several reliability metrics are used. This paper considers /spl Kscr/-terminal unreliability measure. The exact evaluation this parameter is, in general, very costly since it is NP-hard family. An alternative estimate using Monte Carlo simulation. For highly reliable networks, crude technique prohibitively expensive; thus variance reduction techniques must be We propose recursive...
Abstract Splitting is a variance reduction technique widely used to make efficient estimations of the probability rare events in simulation Markovian models. In this article, splitting applied improve well-known method called Creation Process (CP), network reliability estimation. The resulting proposal, here Splitting/CP, particularly appropriate case highly reliable networks; i.e., networks for which failure event. article introduces basis Splitting/CP and presents set computational...
We propose a polynomial-time algorithm for detecting and deleting classes of network edges which are irrelevant in the evaluation Source-to-terminal Diameter Constrained Network reliability parameter. As evaluating this parameter is known to be an NP-hard problem, proposed procedure may lead important computational gains when combined with exact method calculate reliability. For illustration, we integrate within recursive factorization approach based upon Moskowitz's edge decomposition....
The Creation Process is an algorithm that transforms a static network model into dynamic one. It the basis of different variance reduction methods designed to make efficient reliability estimations on highly reliable networks in which links can only assume two possible values, operational or failed. In this paper, extended let it operate models more than values. proposed algorithm, called here as Multilevel Process, method, also introduced here, stochastic flow networks. method proposed,...
Let G = ( V , E ) be a graph with distinguished set of terminal vertices K ⫅ . We define the ‐diameter as maximum distance between any pair If edges fail randomly and independently known probabilities (vertices are always operational), diameter-constrained K-terminal reliability R D ), is defined probability that surviving span subgraph whose does not exceed In general, computational complexity evaluating NP‐hard, this measure subsumes classical ‐terminal to belong class. note, we show even...
Abstract This article considers a communication network modeled by graph and distinguished set of terminal nodes . We assume that the never fail, but edges fail randomly independently with known probabilities. The classical K ‐reliability problem computes probability subnetwork is composed only surviving in such way all terminals communicate each other. d ‐diameter ‐constrained generalization also imposes constraint pair must be extremes path approximately length. It allows modeling...
Metabolic responses are essential for the adaptation of microorganisms to changing environmental conditions. The repertoire flux that metabolic network can display in different external conditions may be quantified applying variability analysis genome-scale reconstructions.A procedure is developed classify and quantify sources variability. We apply latest Escherichia coli reconstruction, glucose minimal medium, with an additional constraint account mechanism coordinating carbon nitrogen...
Abstract Let be a simple graph with nodes and links, subset of “terminals,” vector , positive integer d called “diameter.” We assume that are perfect but links fail stochastically independently, probabilities . The “diameter‐constrained reliability” (DCR) is the probability terminals resulting subgraph remain connected by paths composed or less. This number denoted general DCR computation belongs to class ‐hard problems, since it subsumes problem computing random connected. contributions...
The research community's attention has been attracted to the reliability of networks exposed large-scale disasters and this become a critical concern in network studies during last decade. Earthquakes are high on list those showing most significant impacts communication networks, simultaneously, they least predictable events. This study uses Probabilistic Seismic Hazard Analysis method estimate element state after an earthquake. approach considers seismic source model ground prediction...