Sufficient Conditions for Existence of a Fixed Point in Stochastic Reward Net-Based Iterative Models
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Fixed-Point Approximations for Distributed Systems
Proceedings of the International Workshop on Computer Performance and Reliability
Fixed Point Iteration in Availability Modeling
Proceedings of the 5th International GI/ITG/GMA Conference on Fault-Tolerant Computing Systems, Tests, Diagnosis, Fault Treatment
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Modeling Fiber Delay Loops in an All Optical Switch
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Level crossing ordering of Markov chains: computing end to end delays in an all optical network
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Management Science
80Gb/s multi-wavelength optical packet switching using PLZT switch
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
Analysis and Synthesis of Computer Systems: Texts)
Analysis and Synthesis of Computer Systems: Texts)
Transport time distribution for deflection routing on an odd torus
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
IEEE Communications Magazine
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Personal communication systems using multiple hierarchical cellular overlays
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We illustrate through examples how monotonicity may help for performance evaluation of networks. We consider two different applications of stochastic monotonicity in performance evaluation. In the first one, we assume that a Markov chain of the model depends on a parameter that can be estimated only up to a certain level and we have only an interval that contains the exact value of the parameter. Instead of taking an approximated value for the unknown parameter, we show how we can use the monotonicity properties of the Markov chain to take into account the error bound from the measurements. In the second application, we consider a well known approximation method: the decomposition into Markovian submodels. In such an approach, models of complex networks or other systems are decomposed into Markovian submodels whose results are then used as parameters for the next submodel in an iterative computation. One obtains a fixed point system which is solved numerically. In general, we have neither an existence proof of the solution of the fixed point system nor a convergence proof of the iterative algorithm. Here we show how stochastic monotonicity can be used to answer these questions and provide, to some extent, the theoretical foundations for this approach. Furthermore, monotonicity properties can also help to derive more efficient algorithms to solve fixed point systems.