Strong and weak orderings for an accurate resource dimensioning

Abstract : End to end QoS (Quality of Service) is crucial in computer networks, but very hard to study as the systems are in general very complex. We suppose that systems can be modeled by multidimensional Markov processes, which could be very hard to analyse if there is no specific solution form. We propose to apply stochastic comparisons of Markov processes in order to solve this problem. We provide new processes, easier to analyze and representing stochastic bounds (upper or lower) for the original model. In this paper, we propose strong and weak bounding processes for a general queueing network model, and discuss their accuracy for QoS constraints
Type de document :
Communication dans un congrès
VECoS 2011 : 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, Sep 2011, Tunis, Tunisia. British Computer Society, Proceedings VECoS 2011 : 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, pp.1 - 12, 2011
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01303049
Contributeur : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Soumis le : vendredi 15 avril 2016 - 17:06:29
Dernière modification le : jeudi 3 mai 2018 - 16:58:02

Identifiants

  • HAL Id : hal-01303049, version 1

Collections

Citation

Hind Castel-Taleb, Nihal Pekergin. Strong and weak orderings for an accurate resource dimensioning. VECoS 2011 : 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, Sep 2011, Tunis, Tunisia. British Computer Society, Proceedings VECoS 2011 : 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, pp.1 - 12, 2011. 〈hal-01303049〉

Partager

Métriques

Consultations de la notice

57