In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applications to computer resource sharing. First of all, we prove that networks of symmetric queues with Jackson or Kelly routing are both insensitive to the service requirement distribution even if at arrivals, departures or migration events, customers at each queue are randomly permuted according to some law that may depend on the network state. We also identify some non-symmetric service disciplines for which the insensitivity property holds. We then propose two new throughput metrics for data networks. We prove some generic properties satisfied by these two metrics and we illustrate their difference through some examples. Finally, we prove that...
The thesis deals with the performance evaluation of multi-service telecommunication networks. We fir...
We consider a multi-class queueing network as a model of packet transfer in a communication network....
In this paper we study quantitative as well as qualitative properties of Fork/Join queueing networks...
In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applic...
In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applic...
In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applic...
We represent a data network as a set of links shared by a dynamic number of competing flows. These f...
We study a single class of traffic acting on a symmetric set of processor-sharing queues with finite...
International audienceLoad balancing with various types of load information has become a key compone...
International audienceLoad balancing with various types of load information has become a key compone...
The growing demand for cloud-based services encourages operators to maximize resource efficiency wit...
The growing demand for cloud-based services encourages operators to maximize resource efficiency wit...
The growing demand for cloud-based services encourages operators to maximize resource efficiency wit...
Abstract We study a single class of traf?c acting on a symmetric set of processorsharing queues with...
The thesis deals with the performance evaluation of multi-service telecommunication networks. We fir...
The thesis deals with the performance evaluation of multi-service telecommunication networks. We fir...
We consider a multi-class queueing network as a model of packet transfer in a communication network....
In this paper we study quantitative as well as qualitative properties of Fork/Join queueing networks...
In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applic...
In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applic...
In this thesis, we tackle the problem of insensitivity in queueing networks and consider some applic...
We represent a data network as a set of links shared by a dynamic number of competing flows. These f...
We study a single class of traffic acting on a symmetric set of processor-sharing queues with finite...
International audienceLoad balancing with various types of load information has become a key compone...
International audienceLoad balancing with various types of load information has become a key compone...
The growing demand for cloud-based services encourages operators to maximize resource efficiency wit...
The growing demand for cloud-based services encourages operators to maximize resource efficiency wit...
The growing demand for cloud-based services encourages operators to maximize resource efficiency wit...
Abstract We study a single class of traf?c acting on a symmetric set of processorsharing queues with...
The thesis deals with the performance evaluation of multi-service telecommunication networks. We fir...
The thesis deals with the performance evaluation of multi-service telecommunication networks. We fir...
We consider a multi-class queueing network as a model of packet transfer in a communication network....
In this paper we study quantitative as well as qualitative properties of Fork/Join queueing networks...