Strong and weak orderings for an accurate resource dimensioning - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

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
No file

Dates and versions

hal-01303049 , version 1 (15-04-2016)

Identifiers

  • HAL Id : hal-01303049 , version 1

Cite

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. pp.1 - 12. ⟨hal-01303049⟩
74 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More