Text size
  • Small
  • Medium
  • Large
  • Standard
  • Blue text on blue
  • High contrast (Yellow text on black)
  • Blue text on beige

    Strong and Weak orderings for an accurate resource dimensioning

    Fifth International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2011)

    Tunis, Tunisia, 15-16 September 2011


    Hind Castel-Taleb and Nihal Pekergin


    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.


    PDF filePDF Version of this Paper (206kb)