Failure Impact,Availability and Cost Analysis of PONs Based on a Network Geometric Model

Passive Optical Networks(PONs)are considered as the preferred solution for broadband fibre-based access networks.This is because PONs present low cost deployment,low energy consumption and also meet high bandwidth demands from end users.In addition,end users expect a high availability for access networks,while operators are more concerned about reducing the failure impact(number of clients affected by failures).Moreover,operators are also interested in reducing the cost of the access network.This paper provides a deep insight into the consequences that the physical topology and design decisions cause on the availability,the failure impact and the cost of a PON.In order to do that,the physical layout of the PON deployment area is approximated by a network geometric model.A PON deployed according to the geometric model is then assessed in terms of failure impact,availability and cost.This way,the effects of different design decisions and the physical layout on these three parameters are evaluated.In addition,the tradeoffs between availability,failure impact and cost caused by planning decisions and the physical topology are identified and pinpointed.     

Instant Controlled Pressure Drop technology: From a new fundamental approach of instantaneous transitory thermodynamics to large industrial applications on high performance–high controlled quality unit operations

Solvent extraction processes have been largely used in various industries. They recently were improved through new physical concepts such as CO₂ Supercritical Fluid Extraction, Ultrasound assisted process, Microwave-assisted extraction, Instant Controlled Pressure Drop DIC-assisted extraction… Systematically, a pretreatment stage of grinding takes place in order to improve the exchange surface increasing the starting accessibility. Swelling of the material structure implies an increase of the porosity thus leading to higher solvent diffusivity within the solid matrix. A new concept of expanded granule powder has recently been defined using Instant Controlled Pressure Drop DIC technology. Whatever the type of solvent is (even CO₂-SFE), such a swelled structure dramatically intensifies the kinetics through a higher specific exchange surface thanks to the open pores, while improving the solution solvent–solute diffusivity within the solid. Coupled to ultrasound, the internal transfer of solute within the pore solvent can likewise be intensified by replacing molecular diffusion within the pores by an effective convection transfer. In this work, we carried out a first approach of modeling of solvent extraction kinetics of expanded granules involving higher exchange surface and greater internal diffusion process.     

A {(\frac 4 3) -} approximation algorithm for a special case of the two machine flow shop problem with several availability constraints

In this paper, we deal with a special case of the two-machine flow shop scheduling problem with several availability constraints on the second machine, under the resumable scenario. We develop an improved algorithm with a relative worst-case error bound of 4/3.     

Mean time to failure and availability of semi-Markov missions with maximal repair

We analyze mean time to failure and availability of semi-Markov missions that consist of phases with random sequence and durations. It is assumed that the system is a complex one with nonidentical components whose failure properties depend on the mission process. The stochastic structure of the mission is described by a Markov renewal process. We characterize mean time to failure and system availability under the maximal repair policy where the whole system is replaced by a brand new after successfully completing a phase before the next phase starts. Special cases involving Markovian missions are also considered to obtain explicit formulas.     

Availability analysis of crank-case manufacturing in a two-wheeler automobile industry

The paper describes the availability of crank-case manufacturing system in an automobile industry. The units discussed here fail either directly from normal working state or indirectly through partial failure state. The machines are subjected to both preventive and corrective maintenance. Failure and repair times of the units are independent. The problem is formulated using probability consideration and supplementary variable technique. The system of equations governing the working of system consists of ordinary as well as partial differential equations. Lagrange method and Runge–Kutta method is used to solve partial differential equation and ordinary differential equation respectively. The study reveals that successful program of preventive and routine maintenance will reduce equipment failures, extend the life of the equipment, and increase the system availability to considerable margin.     

修理延迟的设备修如旧模型的可用度

本文通过将使用时间在可能发生故障的时刻划分成时间区间,对修如旧模型下的多部件系统,在修理延迟条件下,对各类故障在同一时间区间里相容的条件下导出了任意给定时刻设备的可用度函数,并对文[3]中的算法做了改进,得到了更精确更合理的结果     

Pseudo Availability of Repairable System

Availability is a very basic characteristic of a system for measuring its performance. Various traditional availabilities have been defined in the literature. This article considers repairable system, the failure of which can be detected only by inspection, and incorporates both inspection and repair into consideration. The concept of pseudo availability is introduced and studied. Pseudo availability differs from the traditional availabilities in that once the system is in ‘up’ state it will remain there forever without change. The expression and/or its Laplace transform are derived. The limiting behavior of pseudo availability is also studied. AMS 2000 Subject Classification Primary 60K10, Secondary 60E10     

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint

We study the problem of scheduling n non-preemptable jobs on a single machine which is not available for processing during a given time period. The objective is to minimize the sum of the job completion times. The best known approximation algorithm for this NP-hard problem has a relative worst-case error bound of 17.6%. We present a parametric O(nlog n)-algorithm H with which better worst-case error bounds can be obtained. The best error bound calculated for the algorithm in the paper is 7.4%. In a computational experiment, we test the algorithm with the performance guarantee set to 10.2%. It turns out that randomly generated instances with up to 1000 jobs can be solved with a mean (maximum) error of 0.31% (3.18%) and a mean (maximum) computation time of 0.8 (9.7) seconds.     

Optimal charging times of a battery for memory backup

This paper considers the following charging policy for a battery to back up memories of a computer system: If the voltage of a battery is lower than a prespecified threshold level when the power is on, a battery is charged for a fixed time T. Using the probability theory, an availability of the system is derived and an optimal time T^* to maximize it is discussed. A numerical example is finally given.     

Scheduling two agents with controllable processing times

We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in parallel while processing their jobs. The processing times of the jobs of agent A are compressible at additional cost. The objective function for agent B is always the same, namely a regular function _fmax$f_{\text{max}}$. Several different objective functions are considered for agent A, including the total completion time plus compression cost, the maximum tardiness plus compression cost, the maximum lateness plus compression cost and the total compression cost subject to deadline constraints (the imprecise computation model). All problems are to minimize the objective function of agent A subject to a given upper bound on the objective function of agent B. These problems have various applications in computer systems as well as in operations management. We provide NP-hardness proofs for the more general problems and polynomial-time algorithms for several special cases of the problems.