On modeling network congestion using continuous-time bivariate Markov chains

2011 45th Annual Conference on Information Sciences and Systems, CISS 2011

Volumn , Issue , 2011, Pages

  Mark, Brian L ^a   Ephraim, Yariv ^a  

^a Krasnow Institute for Advanced Study   (United States)

Author keywords

Markov models; network models; parameter estimation

Indexed keywords

APPROXIMATE ESTIMATION; BIVARIATE; CONTINUOUS TIME; ESTIMATION ALGORITHM; EXPECTATION MAXIMIZATION; FINITE-STATE; INTER-ARRIVAL TIME; MARKOV CHAIN; MARKOV MODEL; MODELING NETWORKS; NETWORK MODELS; NETWORK PATHS; PACKET DELAY; RANDOM PATHS; SAMPLE PATH; STATISTICAL PROPERTIES;

COMPUTER NETWORKS; CONTINUOUS TIME SYSTEMS; ESTIMATION; INFORMATION SCIENCE; MARKOV PROCESSES; PACKET LOSS; PARAMETER ESTIMATION; STATISTICAL METHODS;

COMPUTER SIMULATION;

EID: 79957849155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2011.5766118     Document Type: Conference Paper

References (21)

1. A. Albert. Estimating the infinitesimal generator of a continuous time, finite state Markov process. Annals of Mathematical Statistics, 23(2):727-753, Jun. 1962.
2. S. Asmussen, O. Nerman, and M. Olsson. Fitting phase-type distributions via the EM algorithm. Scand. J. Stat., 23(4):419-441, 1996.
3. F. G. Ball, R. K. Milne, and G. F. Yeo. Continuous-time Markov chains in a random environment, with applications to ion channel modelling. Adv. in Appl. Prob., 26(4):919-946, Dec. 1994.
4. L. E. Baum, T. Petrie, G. Solues, and N. Weiss. A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. Ann. Math. Statist., 41:164-171, 1970.
5. L. Breuer. An EM algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure. Annals of Operations Research, 112:123-138, 2002. (Pubitemid 37132252)
6. M. Carbone and L. Rizzo. Dummynet revisited. ACM Computer Communication Review, 40(2), April 2010.
7. M. Carson and D. Santay. NIST Net - A Linux-based Network Emulation Tool. ACM Computer Communication Review, June 2003.
8. E. Çinlar. Markov Renewal Theory: A Survey. Management Science, 21(7):727-752, Dec. 1975.
9. X. Chang. Network Simulations with OPNET. In P. A. Farrington, H. B. Nembhard, D. T. Sturrock, and G. W. Evans, editors, Proc. Winter Simulation Conference, pages 307-314, 1999.
10. Y. Ephraim and W. J. J. Roberts. An EM algorithm for Markov modulated Markov processes. IEEE Trans. Sig. Proc., 57(2), Feb. 2009.
11. K. Fall and K. Varadhan, editors. The ns Manual. The VINT Project, May 2010.
12. R. B. Israel, J. S. Rosenthal, and J. Z. Wei. Finding generators for Markov chains via empirical transition matrices with applications to credit ratings. Math. Finance, 11(2):245-265, Apr. 2001.
13. A. Klemm, C. Lindemann, and M. Lohmann. Modeling IP traffic using the batch Markovian arrival process. Performance Evaluation, 54:149-173, 2003.
14. B. L. Mark and Y. Ephraim. Parameter estimation for continuous-time bivariate Markov chains. Feb. 2011 (to be submitted for publication).
15. C. Moler and C. Van Loan. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Review, 45(1):3-49, 2003.
16. W. J. J. Roberts and Y. Ephraim. An EM algorithm for ion-channel current estimation. IEEE Trans. Sig. Proc., 56:26-33, Jan. 2008.
17. W. J. J. Roberts, Y. Ephraim, and E. Dieguez. On Rydén's EM algorithm for estimating MMPPs. IEEE Sig. Proc. Let., 13(6):373-377, June 2006.
18. T. Rydén. An EM algorithm for estimation in Markov-modulated Poisson processess. Computational Statistics and Data Analysis, 21:431-447, 1996.
19. K. Salamatian and S. Vaton. Hidden Markov modelling for network communication channels. In Proc. ACM Sigmetrics, June 2001.
20. C. F. Van Loan. Computing integrals involving the matrix exponential. IEEE Trans. on Automatic Control, 23(3), June 1978.
21. W. Wei, B. Wang, and D. Towsley. Continuous-time hidden Markov models for network performance evaluation. Performance Evaluation, 49:129-146, Sept. 2002.