Optimal placement of extrapolators for random flow prediction
From MaRDI portal
The article investigates the quality of a linear predictor of the sum of random flows as a function of the placement of extrapolators in the network elements. The problem of optimal flow partitioning into groups is formulated in terms of minimum mean square prediction error. The problem is presented as a nonlinear integer program. A theorem concerning the structure of the optimal programs is proved, and this theorem is used to design an efficient algorithm for optimal extrapolator placement.
Recommendations
- Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences
- scientific article; zbMATH DE number 2104049
- Optimal linear extrapolation algorithm for realization of a vector random sequence observed without errors
- scientific article; zbMATH DE number 33715
- Optimal Flows in Stochastic Dynamic Networks with Congestion
This page was built for publication: Optimal placement of extrapolators for random flow prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801799)