We study the phenomenon of entrainment in processor sharing networks, whereby, while individual network resources have sufficient capacity to meet demand, the requirement for simultaneous availability of resources means that a network may nevertheless be unstable. We show that instability occurs through a poor control strategy, and that, for a variety of network topologies, only small modifications to control strategies are required in order to ensure stability. For control strategies which possess a natural monotonicity property, we give some new results for the classification of the corresponding Markov processes, which lead to conditions both for stability and for instability. Finally, we study the effect of variation of call siz...
We study a processor sharing queue with a limited number of service positions and an infinite buffer...
We consider the allocation of reconfigurable resources in a serial manufacturing line with machine f...
We examine the stability of two interfering processors with service rates depending on the number of...
We study the phenomenon of entrainment in processor sharing networks, whereby, while individual netw...
or use of any of the information contained in it must acknowledge this thesis as the source of the q...
We study the phenomenon of entrainment in processor sharing networks, whereby, while individual netw...
We study two classes of stochastic systems, the limited processor sharing system and the multi-serve...
Motivated by a variety of applications in information and communication systems, we consider queuein...
International audienceThe equilibrium distributions of a Markovian model describing the interaction ...
We investigate the stability condition for redundancy-d systems where each of the servers follows a ...
We investigate the stability condition for redundancy-d systems where each of the servers follows a ...
Size-based scheduling strategies such as Shortest Remaining Processing Time first (SRPT) and Least A...
Traditional network models have played an important role over the last four decades in providing ins...
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. ...
A novel scheme for processing packets in a router is presented, which provides for load sharing amon...
We study a processor sharing queue with a limited number of service positions and an infinite buffer...
We consider the allocation of reconfigurable resources in a serial manufacturing line with machine f...
We examine the stability of two interfering processors with service rates depending on the number of...
We study the phenomenon of entrainment in processor sharing networks, whereby, while individual netw...
or use of any of the information contained in it must acknowledge this thesis as the source of the q...
We study the phenomenon of entrainment in processor sharing networks, whereby, while individual netw...
We study two classes of stochastic systems, the limited processor sharing system and the multi-serve...
Motivated by a variety of applications in information and communication systems, we consider queuein...
International audienceThe equilibrium distributions of a Markovian model describing the interaction ...
We investigate the stability condition for redundancy-d systems where each of the servers follows a ...
We investigate the stability condition for redundancy-d systems where each of the servers follows a ...
Size-based scheduling strategies such as Shortest Remaining Processing Time first (SRPT) and Least A...
Traditional network models have played an important role over the last four decades in providing ins...
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. ...
A novel scheme for processing packets in a router is presented, which provides for load sharing amon...
We study a processor sharing queue with a limited number of service positions and an infinite buffer...
We consider the allocation of reconfigurable resources in a serial manufacturing line with machine f...
We examine the stability of two interfering processors with service rates depending on the number of...