• Accueil
  • Accueil
  • Accueil
  • Accueil



Accueil > Équipes > METHODES > Séminaires Méthodes > Séminaires METHODES > Séminaires 2012 METHODES

"Seeking simplicity in complex systems"

présenté par Alexandre Brandwajn, Baskin School of Engineering, University of California at Santa Cruz, USA

le jeudi 22 mars 2012 à 14H30 en salle B206


Queueing network models are an important tool in the evaluation of the performance of computer systems and networks. Explicit analytical solutions exist for a class of such models, but features such as realistic global dependencies, priorities, or simple commonly used service disciplines, preclude their direct application. Additionally, even when analytical solutions are known, their numerical computation may still be challenging due to the size of the state space of classical queueing models.

In this talk, we try to show that the use of conditional probabilities may be valuable in exposing simple properties hidden from view by “classical” state descriptions.

Examples include tandem networks with blocking, multi-server systems with priorities, as well as guided state sampling in large system models.