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

Authors:
E. N. Bekkerman;S. G. Kataev;S. S. Kataeva
Affiliations:
Tomsk State Pedagogical University, Tomsk, Russia;Tomsk State Pedagogical University, Tomsk, Russia;Tomsk State University, Tomsk, Russia
Venue:
Automation and Remote Control
Year:
2013

Citing 6
Cited 0

Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Estimation of the Dead Time of an Asynchronous Double Stochastic Flow of Events under Incomplete Observability

Automation and Remote Control
Modeling and Analysis of Telecommunication Networks

Modeling and Analysis of Telecommunication Networks
Optimal Estimation of the States of a Synchronous Double Stochastic Flow of Events

Automation and Remote Control
Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic

IEEE/ACM Transactions on Networking (TON)
A Markovian approach for modeling packet traffic with long-range dependence

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the approximation problem for an observable random flow of events using an MC-flow. A separation algorithm for stationarity segments is suggested. In addition, we propose an evaluation algorithm for the number of states and intensity of the approximating MC-flow by event occurrence instants in the observable flow.