Towards a proof of recurrence for the Lorentz process
In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most K tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of...
Consider a variant of the simple random walk on the integers, with the following transition mechanism. At each site x, the probability of jumping to the right is ω(x)∈[½, 1), until the first time the process jumps to the left from site x, from which time onward the probability of jumping to the right is ½. We investigate the transience/recurrence properties of this process in both deterministic and stationary, ergodic environments {ω(x)}x∈Z. In deterministic environments, we also study the speed...
Let us consider two independent renewal processes generated by appropriate sequences of life times. We say that a renewal time is accepted if in the time between a signal and the preceding one, some signal of the second process occurs. Our purpose is to analyze the sequences of accepted renewals. For simplicity we consider continuous and discrete time separately. In the first case we mainly consider the renewal process rarefied by the Poisson process, in the second we analyze the process generated...