Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Bounds based on lumpable matrices for partially ordered state space
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Aggregated bounding Markov processes applied to the analysis of tandem queues
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Stochastic Monotonicity in Queueing Networks
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
| Hi-index | 0.00 |
We apply stochastic bounding methods with a partial order on the state space to the analysis of memory overflow in a router. Usually, stochastic bounds are associated to a total order implying useless constraints and decreasing the tightness of bounds. Here we present the basic methodology of sample path comparison with a partial order and some numerical results to show the accuracy of the results. We analyze the probability of a buffer overflow with two types of packets, a Pushout access mechanism and Markov modulated batch arrivals. This problem is strongly related to the memory rejection out a Fiber Delay Loop in an all optical router using deflection routing.