Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Censoring Markov chains and stochastic bounds
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Worst case analysis of batch arrivals with the increasing convex ordering
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
A tool to model traffic aggregation in networks of reconfigurable optical ADD/DROP multiplexers
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We analyze the performance and optimize the design of a Reconfigurable Optical ADD and DROP Multiplexer (ROADM in the following). The analysis is based on stochastic bounds, a derivation of an extension of Pollacek formula for Batch queues and numerical analysis of discrete time Markov chains.