Title :
Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains
Author :
Krishnamurthy, Vikram ; Dey, Subhrakanti
Author_Institution :
Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia
Abstract :
We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains
Keywords :
Markov processes; computational complexity; multiplexing; queueing theory; state estimation; telecommunication traffic; ATM networks; bursty traffic; continuous-time Markov chains; modulated Poisson process; nearly completely decomposable Markov chains; queueing networks; reduced-complexity estimation; state estimation; traffic multiplexing; variable bit rate video traffic; Aggregates; Asynchronous transfer mode; Bit rate; Electronic mail; Large-scale systems; Matrix decomposition; State estimation; State-space methods; Telecommunication traffic; Traffic control;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936070
