Browsing by Subject "Computer network"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Infinite-and finite-buffer Markov fluid queues: a unified analysis
    (Applied Probability Trust, 2004) Akar, N.; Sohraby, K.
    In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varies with respect to the state of an underlying continuous-time Markov chain. We present a novel algorithmic approach to solve numerically for the steady-state solution of such queues. Using this approach, both infinite- and finite-buffer cases are studied. We show that the solution of the infinite-buffer case is reduced to the solution of a generalized spectral divide-and-conquer (SDC) problem applied on a certain matrix pencil. Moreover, this SDC problem does not require the individual computation of any eigenvalues and eigenvectors. Via the solution for the SDC problem, a matrix-exponential representation for the steady-state queue-length distribution is obtained. The finite-buffer case, on the other hand, requires a similar but different decomposition, the so-called additive decomposition (AD). Using the AD, we obtain a modified matrix-exponential representation for the steady-state queue-length distribution. The proposed approach for the finite-buffer case is shown not to have the numerical stability problems reported in the literature.
  • Thumbnail Image
    ItemOpen Access
    An O(n1/3) algorithm for distributed mutual exclusion
    (Elsevier, 1998) Chaudhuri, P.; Karaata, M. H.
    In this paper, a distributed algorithm is proposed that realizes mutual exclusion among n nodes in a computer network. No common or global memory is shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The best-known algorithms so far, for the distributed mutual exclusion problem, require O(√n) messages per mutual exclusion invocation. The proposed algorithm is the first to cross this O(√n) barrier and the message complexity achieved by our algorithm is O(n1/3) per mutual exclusion. © 1998 Elsevier Science B.V. All rights reserved.