Hidden Markov modeling for network communication channels
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Markov-based channel model algorithm for wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Random Data: Analysis and Measurement Procedures
Random Data: Analysis and Measurement Procedures
Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Hidden Markov modeling of flat fading channels
IEEE Journal on Selected Areas in Communications
An adaptive FEC algorithm using hidden Markov chains
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Realizing the benefits of user-level channel diversity
ACM SIGCOMM Computer Communication Review
Linear-complexity models for wireless MAC-to-MAC channels
Wireless Networks
Markov and multifractal wavelet models for wireless MAC-to-MAC channels
Performance Evaluation
Accurate hidden Markov modeling of packet losses in indoor 802.11 networks
IEEE Communications Letters
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
Wireless Personal Communications: An International Journal
Predicting packet loss statistics with hidden Markov models for FEC control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.05 |
Simplifying stochastic models of the topology of Internet have been studied intensively during the past few years. One of the most interesting ones is a random graph, where the degrees of the N nodes are drawn independently from a distribution ...