A Monte Carlo Simulation Approach to the Reliability Modeling of the Beam Permit System of the Relativistic Heavy Ion Collider (RHIC) at BNL

N/

Socially and biologically inspired computing for self-organizing communications networks

The design and development of future communications networks call for a careful examination of biological and social systems. New technological developments like self-driving cars, wireless sensor networks, drones swarm, Internet of Things, Big Data, and Blockchain are promoting an integration process that will bring together all those technologies in a large-scale heterogeneous network. Most of the challenges related to these new developments cannot be faced using traditional approaches, and require to explore novel paradigms for building computational mechanisms that allow us to deal with the emergent complexity of these new applications. In this article, we show that it is possible to use biologically and socially inspired computing for designing and implementing self-organizing communication systems. We argue that an abstract analysis of biological and social phenomena can be made to develop computational models that provide a suitable conceptual framework for building new networking technologies: biologically inspired computing for achieving efficient and scalable networking under uncertain environments; socially inspired computing for increasing the capacity of a system for solving problems through collective actions. We aim to enhance the state-of-the-art of these approaches and encourage other researchers to use these models in their future work

Recursive Solution of Equilibrium State Probabilities for Three Tandem Queues with Limited Buffer Space

A recursive method for solving for the equilibrium state probabilities of a three tandem queue network with limited buffer space is presented. A set of 4x4 linear equations is solved at each step of the recursion, resulting in large computational savings. Such tandem networks are useful for modeling packets or calls flowing over sequential paths. 1

Scalable Scheduling For Clusters And Grids Using Cut Through Switching

A new scalable scheduling strategy using cut through switching is proposed in this paper. Recursive and closed form expressions for speedup are found in heterogeneous single level trees and in homogeneous multilevel trees, respectively. The ratio of speedup using cut through switching to that using store and forward switching is presented so as to illustrate the amount of improvement in speedup between these two different techniques

Quantitative fault tree analysis of the Beam Permit System elements of Relativistic Heavy Ion Collider (RHIC) at BNL DISCLAIMER QUANTITATIVE FAULT TREE ANALYSIS OF THE BEAM PERMIT SYSTEM ELEMENTS OF RELATIVISTIC HEAVY ION COLLIDER (RHIC) AT BNL*

Abstract The RHIC Beam Permit System (BPS) plays a key role in safeguarding against the anomalies developing in the collider during a run. The BPS collects RHIC subsystem statuses to allow the beam entry and its existence in the machine. The building blocks of BPS are Permit Module (PM) and Abort Kicker Module (AKM), which incorporate various electronic boards based on VME specification. This paper presents a quantitative Fault Tree Analysis (FTA) of the PM and AKM, yielding the failure rates of three top failures that are potential enough to cause a significant downtime of the machine. The FTA helps tracing down the top failure of the module to a component level failure (such as an IC or resistor). The fault trees are constructed for all module variants and are probabilistically evaluated using an analytical solution approach. The component failure rates are calculated using manufacturer datasheets and MIL-HDBK-217F. The apportionment of failure modes for components is calculated using FMD-97. The aim of this work is to understand the importance of individual components of the RHIC BPS regarding its reliable operation, and evaluate their impact on the operation of BPS

Performance Evaluation of a Starlite-like Architecture for ATM Switching

A Starlite-like switching architecture for ATM applications is examined in this paper. The switching architecture consists primarily of a Batcher sorting network and a Banyan switching network. A performance evaluation is done using both analysis and simulation. A discrete time queueing analysis is utilized due to the slotted nature of the system. Cells that are unable to make it through the system due to contention for resources are queued in a central buffer. There is one queue for each output line. The queues are implemented using a First In First Out (FIFO) queueing discipline. Only one packet from each queue is recirculated back to the system during each time slot. The average number of visits that a packet makes to the buffer and the mean queue length at various input utilizations are analyzed and compared to simulation values