Electrical and Computer Engineering
2332 Main Mall
Vancouver,
BC
Canada
V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:
info@ece.ubc.ca
| Title | Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains |
| Publication Type | Conference Paper |
| Year of Publication | 2001 |
| Authors | Krishnamurthy, V., and S. Dey |
| Conference Name | Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on |
| Pagination | 207 |
| Keywords | ATM networks, bursty traffic, computational complexity, continuous-time Markov chains, Markov processes, modulated Poisson process, multiplexing, nearly completely decomposable Markov chains, queueing networks, queueing theory, reduced-complexity estimation, state estimation, telecommunication traffic, traffic multiplexing, variable bit rate video traffic |
| Abstract | We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains |
| URL | http://dx.doi.org/10.1109/ISIT.2001.936070 |
| DOI | 10.1109/ISIT.2001.936070 |