Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
New call blocking versus handoff blocking in cellular networks
Wireless Networks
End-to-end performance analysis with traffic aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking - Pioneering tomorrow's Internet Selected papers from the TERENA Networking Conference 2000 22–25 May 2000, Lisbon, Portugal
Analytic modeling of handoffs in wireless cellular networks
Information Sciences—Applications: An International Journal
Dynamic-Distributed Differentiated Service for Multimedia Applications
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Performance measure bounds in mobile networks by state space reduction
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Multi-services MAC protocol for wireless networks
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Loss rates bounds for IP switches in MPLS networks
AICCSA '06 Proceedings of the IEEE International Conference on Computer Systems and Applications
Stochastic bounds on partial ordering: application to memory overflows due to bursty arrivals
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Designing multiprotocol label switching networks
IEEE Communications Magazine
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
Stochastic comparisons for performability of telecommunication systems
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
On the choice of the stochastic comparison method for multidimensional Markov chains analysis
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Accuracy of strong and weak comparisons for network of queues
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
An algorithm approach to bounding aggregations of multidimensional Markov chains
Theoretical Computer Science
Combined CAC and forced handoff for mobile network performability
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
Hi-index | 0.25 |
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indices bounds. The main objective is to find Markovian bounding models with reduced state spaces, which are easier to solve. We apply the methodology to performance evaluation of complex telecommunication systems modelled by large size Markov chains which cannot be solved by exact methods. This methodology can be applied for continuous- or discrete-time Markov chains. In the first study, we consider an MPLS switch represented by two stages of buffers. Various kinds of traffic with different QoS levels enter the first stage, and transit in the second stage. The goal is to compute packet loss rates in the second stage. In the other study, we define a CAC scheme in a mobile network which gives the priority to the handover over the new calls. Performance evaluation of the CAC scheme consists in the computation of the dropping handover and call blocking probabilities. For the two studies, systems are represented by large state Markov chains whose resolution is difficult. We propose to define intuitively bounding systems in order to compute performance measures bounds. Using stochastic comparisons methods, we prove that the new systems represent bounds for the exact ones. Different methods can be used. For the MPLS switch, we use the coupling equivalent to the sample-path ordering, allowing the comparison of the loss rates. In the case of the CAC scheme, we apply the increasing sets formalism used to define weaker orderings, enabling the comparison of the dropping handovers and blocking probabilities. We validate stochastic comparison method by presenting some numerical results illustrating the interest of the approach.