37 research outputs found

    A security analysis for label switching routers

    Get PDF
    Label Switching Routers (LSR), such as IP switching of Ipsilon, use separate Virtual Circuits (VC)from different sources even having the same destination. Merging switches, on the other hand, allow multiple VCs of upstream traffic to use a single output VC if having same destination criteria. In this paper, we study IP switching of Ipsilon and identify certain security threats. We found that oscillation between routing and switching as a result of a malicious frequent suspension and releasing of flows is a main security threat that decreases performance of such systems. To stabilize the performance in face of such an attack, we propose to utilize merging switches to mitigate the implications of oscillation in LSR. The simulation results enhances this claim

    The detection of flow meter drift by using statistical process control

    No full text
    Flow meter drift is a serious problem, the financial losses from which can be huge. Flow meters do not usually get much attention and a drift can go unnoticed for a long time. In this research, a novel method is presented for the early detection of flow meter drift. The method is based on statistical process control (SPC). The method can be used with any type of flow meter (ultrasonic, magnetic etc.) regardless of its manufacturer. Another advantage of the presented method is that it does not require any knowledge of the mathematical models and relations that govern the process. The method is also capable of working with minimal data: only the monthly billing data are needed. Adapting the process can be done inexpensively

    The buffer allocation problem in production lines: Formulations, solution methods, and instances

    No full text
    Flow production lines with finite buffer capacities are used in practice for mass production, e.g., in the automotive and food industries. The decision regarding the allocation of buffer capacities to mitigate throughput losses from stochastic processing times and unreliable stations is known as the Buffer Allocation Problem (BAP).  This article classifies and reviews the literature on the BAP with respect to different versions of the optimization problem. It considers the detailed characteristics of the flow lines, the objective function, and the constraints. Moreover, a new classification scheme for solution methods is presented that differentiates between explicit solutions, integrated optimization methods, and iterative optimization methods. The characteristics of test instances derived from realistic cases and test instances used in multiple references are discussed.  The review reveals gaps in the literature regarding the considered optimization problems and solution methods, especially with a view on realistic lines. In addition, a library, FlowLineLib, of realistic and already used test instances is provided
    corecore