论文信息 - Heuristic approximation method for a random flow of events by an MC-flow with arbitrary number of states - 字舞流文

Heuristic approximation method for a random flow of events by an MC-flow with arbitrary number of states

S. Kataev | E. N. Bekkerman | S. Kataeva

[1] Robert Shorten,et al. A Google-like model of road network dynamics and its application to regulation and control , 2011, Int. J. Control.

[2] M.J. Neely,et al. Delay Analysis for Maximal Scheduling With Flow Control in Wireless Networks With Bursty Traffic , 2009, IEEE/ACM Transactions on Networking.

[3] Melike Baykal-Gursoy,et al. Modeling traffic flow interrupted by incidents , 2009, Eur. J. Oper. Res..

[4] I. V. Bushlanov,et al. Optimal Estimation of the States of a Synchronous Double Stochastic Flow of Events , 2004 .

[5] Trang Dinh Dang,et al. Fractal analysis and modeling of VoIP traffic , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[6] Jeremiah F. Hayes,et al. Modeling and Analysis of Telecommunications Networks , 2004 .

[7] A. M. Gortsev,et al. Estimation of the Dead Time of an Asynchronous Double Stochastic Flow of Events under Incomplete Observability , 2003 .

[8] Dimitrios Hatzinakos,et al. Network heavy traffic modeling using α-stable self-similar processes , 2001, IEEE Trans. Commun..

[9] Bo Friis Nielsen,et al. A Markovian approach for modeling packet traffic with long-range dependence , 1998, IEEE J. Sel. Areas Commun..