Closed-loop two-echelon repairable item systems

In this paper we consider closed loop two-echelon repairable item systems with repair facilities both at a number of local service centers (called bases) and at a central location (the depot). The goal of the system is to maintain a number of production facilities (one at each base) in optimal operational condition. Each production facility consists of a number of identical machines which may fail incidentally. Each repair facility may be considered to be a multi-server station, while any transport from the depot to the bases is modeled as an ample server. At all bases as well as at the depot, ready-for-use spare parts (machines) are kept in stock. Once a machine in the production cell of a certain base fails, it is replaced by a ready-for-use machine from that base's stock, if available. The failed machine is either repaired at the base or repaired at the central repair facility. In the case of local repair, the machine is added to the local spare parts stock as a ready-for-use machine after repair. If a repair at the depot is needed, the base orders a machine from the central spare parts stock to replenish its local stock, while the failed machine is added to the central stock after repair. Orders are satisfied on a first-come-first-served basis while any requirement that cannot be satisfied immediately either at the bases or at the depot is backlogged. In case of a backlog at a certain base, that base's production cell performs worse. To determine the steady state probabilities of the system, we develop a slightly aggregated system model and propose a special near-product-form solution that provides excellent approximations of relevant performance measures. The depot repair shop is modeled as a server with state-dependent service rates, of which the parameters follow from an application of Norton's theorem for Closed Queuing Networks. A special adaptation to a general Multi-Class MDA algorithm is proposed, on which the approximations are based. All relevant performance measures can be calculated with errors which are generally less than one percent, when compared to simulation results. \u

Non-Equilibrium Statistical Physics of Currents in Queuing Networks

We consider a stable open queuing network as a steady non-equilibrium system of interacting particles. The network is completely specified by its underlying graphical structure, type of interaction at each node, and the Markovian transition rates between nodes. For such systems, we ask the question ``What is the most likely way for large currents to accumulate over time in a network ?'', where time is large compared to the system correlation time scale. We identify two interesting regimes. In the first regime, in which the accumulation of currents over time exceeds the expected value by a small to moderate amount (moderate large deviation), we find that the large-deviation distribution of currents is universal (independent of the interaction details), and there is no long-time and averaged over time accumulation of particles (condensation) at any nodes. In the second regime, in which the accumulation of currents over time exceeds the expected value by a large amount (severe large deviation), we find that the large-deviation current distribution is sensitive to interaction details, and there is a long-time accumulation of particles (condensation) at some nodes. The transition between the two regimes can be described as a dynamical second order phase transition. We illustrate these ideas using the simple, yet non-trivial, example of a single node with feedback.Comment: 26 pages, 5 figure

Analysis of Multiple Flows using Different High Speed TCP protocols on a General Network

We develop analytical tools for performance analysis of multiple TCP flows (which could be using TCP CUBIC, TCP Compound, TCP New Reno) passing through a multi-hop network. We first compute average window size for a single TCP connection (using CUBIC or Compound TCP) under random losses. We then consider two techniques to compute steady state throughput for different TCP flows in a multi-hop network. In the first technique, we approximate the queues as M/G/1 queues. In the second technique, we use an optimization program whose solution approximates the steady state throughput of the different flows. Our results match well with ns2 simulations.Comment: Submitted to Performance Evaluatio

Geometric Universality of Currents

We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent on time and instantaneous occupation numbers at the nodes of the graph. We show that under the assumption of constancy of the relative rates, the system demonstrates a profound statistical symmetry, resulting in geometric universality of the statistics of the particle currents. This phenomenon applies broadly to many man-made and natural open stochastic systems, such as queuing of packages over the internet, transport of electrons and quasi-particles in mesoscopic systems, and chains of reactions in bio-chemical networks. We illustrate the utility of our general approach using two enabling examples from the two latter disciplines.Comment: 15 pages, 5 figure

Energy consumption in coded queues for wireless information exchange

We show the close relation between network coding and queuing networks with negative and positive customers. Moreover, we develop Markov reward error bounding techniques for networks with negative and positive customers. We obtain bounds on the energy consumption in a wireless information exchange setting using network coding