Skip to Main content Skip to Navigation
Theses

Insensibilité dans les réseaux de files d'attente et applications au partage de ressources informatiques

Minh Anh Tran 1
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : 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 balancing elastic traffic sources worsens performance in terms of throughput and, in the presence of admission control, of blocking probability.
Complete list of metadatas

https://pastel.archives-ouvertes.fr/tel-00196718
Contributor : Minh Anh Tran <>
Submitted on : Thursday, December 13, 2007 - 1:28:56 PM
Last modification on : Wednesday, October 14, 2020 - 4:11:50 AM
Long-term archiving on: : Monday, April 12, 2010 - 7:22:11 AM

Identifiers

  • HAL Id : tel-00196718, version 1

Collections

Citation

Minh Anh Tran. Insensibilité dans les réseaux de files d'attente et applications au partage de ressources informatiques. Réseaux et télécommunications [cs.NI]. Télécom ParisTech, 2007. Français. ⟨tel-00196718⟩

Share

Metrics

Record views

736

Files downloads

582