Results 1  10
of
65,084
A LARGEDEVIATIONS ANALYSIS OF MARKOVMODULATED INFINITESERVER QUEUES
"... ABSTRACT. This paper studies an infiniteserver queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N, tail probabilities are examined when letting N te ..."
Abstract
 Add to MetaCart
ABSTRACT. This paper studies an infiniteserver queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N, tail probabilities are examined when letting N
TIMESCALING LIMITS FOR MARKOVMODULATED INFINITESERVER QUEUES
"... ABSTRACT. In this paper we study semiMarkov modulated M/M/ ∞ queues, which are to be understood as infiniteserver systems in which the Poisson input rate is modulated by a Markovian background process (where the times spent in each of its states are assumed deterministic), and the service times ar ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
ABSTRACT. In this paper we study semiMarkov modulated M/M/ ∞ queues, which are to be understood as infiniteserver systems in which the Poisson input rate is modulated by a Markovian background process (where the times spent in each of its states are assumed deterministic), and the service times
Markovmodulated infiniteserver queues:
"... This paper studies an infiniteserver queue in a semiMarkov environment: the queue’s input rate is modulated by a semiMarkovian background process, and the service times are assumed to be exponentially distributed. The primary objective of this paper is to propose approximations for the queueleng ..."
Abstract
 Add to MetaCart
This paper studies an infiniteserver queue in a semiMarkov environment: the queue’s input rate is modulated by a semiMarkovian background process, and the service times are assumed to be exponentially distributed. The primary objective of this paper is to propose approximations for the queue
RARE EVENT ANALYSIS OF MARKOVMODULATED INFINITESERVER QUEUES: A POISSON LIMIT
"... ABSTRACT. This paper studies an infiniteserver queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factorN and the rates νij of the background process byN1+ε ..."
Abstract
 Add to MetaCart
ABSTRACT. This paper studies an infiniteserver queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factorN and the rates νij of the background process byN1
A FUNCTIONAL CENTRAL LIMIT THEOREM FOR A MARKOVMODULATED INFINITESERVER QUEUE
"... ABSTRACT. The production of molecules in a chemical reaction network is modelled as a Poisson process with a Markovmodulated arrival rate and an exponential decay rate. We analyze the distributional properties of M, the number of molecules, under specific timescaling; the background process is sp ..."
Abstract
 Add to MetaCart
ABSTRACT. The production of molecules in a chemical reaction network is modelled as a Poisson process with a Markovmodulated arrival rate and an exponential decay rate. We analyze the distributional properties of M, the number of molecules, under specific timescaling; the background process
A FUNCTIONAL CENTRAL LIMIT THEOREM FOR A MARKOVMODULATED INFINITESERVER QUEUE
"... ABSTRACT. The production of molecules in a chemical reaction network is modelled as a Poisson process with a Markovmodulated arrival rate and an exponential decay rate. We analyze the distributional properties of M, the number of molecules, under specific timescaling; the background process is spe ..."
Abstract
 Add to MetaCart
ABSTRACT. The production of molecules in a chemical reaction network is modelled as a Poisson process with a Markovmodulated arrival rate and an exponential decay rate. We analyze the distributional properties of M, the number of molecules, under specific timescaling; the background process
Analysis of an InfiniteServer Queue with
 Batch Markovian Arrival Streams”, Queueing Systems
, 2002
"... Abstract. This paper considers an infiniteserver queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
numerical examples are provided to discuss the impact of system parameters on the performance. Keywords: Infiniteserver queue, Markovian arrival stream, batch arrivals, timedependent analysis, limiting distribution
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 560 (10 self)
 Add to MetaCart
. In contrast, heuristic attempts to sparsely solve such systems – greedy algorithms and thresholding – perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almostspherical sections in Banach space theory, and deviation bounds for the eigenvalues
Disconnected Operation in the Coda File System
 ACM Transactions on Computer Systems
, 1992
"... Disconnected operation is a mode of operation that enables a client to continue accessing critical data during temporary failures of a shared data repository. An important, though not exclusive, application of disconnected operation is in supporting portable computers. In this paper, we show that di ..."
Abstract

Cited by 1014 (36 self)
 Add to MetaCart
that disconnected operation is feasible, efficient and usable by describing its design and implementation in the Coda File System. The central idea behind our work is that caching of data, now widely used for performance, can also be exploited to improve availability.
Results 1  10
of
65,084