A finite-buffered banyan network analysis technique designed to model networks at high traffic loads is presented. The technique specially models two states of the network queues: queue empty and queue congested (roughly, zero or one slots free). A congested queue tends to stay congested because packets bound for the queue accumulate in the previous stage. The expected duration of this state is...

Abstract: The present investigation deals with the multi component machine repair problem by including the concepts of reneging and interdependent controlled rates. We consider a machining system consisting of M operating units, S1 and S2 warm spares of two kinds and a repair facility having R permanent repairmen and r additional removable repairmen. When all the spares are used and the operati...

Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...

This thesis is based on some applications of Markov chains and decision processes for performance analysis ofcongestion avoidance algorithms and power control. First, we study the behaviour of the window size of an MIMDcongestion control algorithm when subject to different loss processes. We show that the logarithm of the embeddedwindow size follows an additive recursive equation, w...

The Message Passing Interface (MPI) message queues have been shown to grow proportionately to the job size for many applications. With such a behaviour and knowing that message queues are used very frequently, ensuring fast queue operations at large scales is of paramount importance in the current and the upcoming exascale computing eras. Scalability, however, is two-fold. With the growing proc...

Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...