One dimensional continuous loss networks are spatial birth-and-death processes which can be dominated by a multitype branching process. Using the Peron-Frobenius theory for sub-criticality of branching process we obtain a sufficient condition for ergodicity of one-dimensional loss networks on ℝ with arbitrary length distribution π and cable capacity C.343349360Fernández, R., Ferrari, P.A., Garcia, N.L., Loss network representation of Pierls contours (2001) Annals of Probability, 29 (2), pp. 902-937Fernández, R., Ferrari, P.A., Garcia, N.L., Perfect simulation for interacting point processes, loss networks and Ising models (2002) Los Alamos Archive: Mathematics. Abstract Math., PR-9911162T. , PreprintFerrari, P.A., Garcia, N.L., One-dimensio...
We present a perfect simulation algorithm for measures that are absolutely continuous with respect t...
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase M...
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase M...
We study one-dimensional continuous loss networks with length distribution G and cable capacity C. W...
We study one-dimensional continuous loss networks with length distribution G and cable capacity C. W...
Resource sharing systems are used to model situations where several servers must complete jobs using...
Resource sharing systems are used to model situations where several servers must complete jobs using...
AbstractWe study one-dimensional resource sharing systems which can be seen as interacting particle ...
AbstractPerfect simulation of an one-dimensional loss network on R with length distribution π and ca...
AbstractPerfect simulation of an one-dimensional loss network on R with length distribution π and ca...
An exponential two-node queueing network with one server on each node is studied. The first node is...
An exponential two-node queueing network with one server on each node is studied. The first node is...
Abstract: An explicit, computable and sufficient condition for exponential ergodicity of single birt...
An exponential two-node queueing network with one server on each node is studied. The first node is...
Perfect simulation of a one-dimensional loss network on R with length distribution pi and cable capa...
We present a perfect simulation algorithm for measures that are absolutely continuous with respect t...
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase M...
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase M...
We study one-dimensional continuous loss networks with length distribution G and cable capacity C. W...
We study one-dimensional continuous loss networks with length distribution G and cable capacity C. W...
Resource sharing systems are used to model situations where several servers must complete jobs using...
Resource sharing systems are used to model situations where several servers must complete jobs using...
AbstractWe study one-dimensional resource sharing systems which can be seen as interacting particle ...
AbstractPerfect simulation of an one-dimensional loss network on R with length distribution π and ca...
AbstractPerfect simulation of an one-dimensional loss network on R with length distribution π and ca...
An exponential two-node queueing network with one server on each node is studied. The first node is...
An exponential two-node queueing network with one server on each node is studied. The first node is...
Abstract: An explicit, computable and sufficient condition for exponential ergodicity of single birt...
An exponential two-node queueing network with one server on each node is studied. The first node is...
Perfect simulation of a one-dimensional loss network on R with length distribution pi and cable capa...
We present a perfect simulation algorithm for measures that are absolutely continuous with respect t...
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase M...
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase M...