Comparison of different methods for the calculation of traffic matrices

作者: Guy Matignon , Jean-Louis Debiesse

DOI: 10.1007/BF03000397

关键词:

摘要: Various methods allowing traffic matrices forecasting from total row and column forecasts are reviewed compared the points of view performance, properties adequation to a real case network. Some new or little known results relative Kruithof method (or double factor method) proved. An application apportionment is also given.

参考文章(10)
D Bear, Principles of telecommunication-traffic engineering Peregrinus on behalf of the Institution of Electrical Engineers. ,(1980)
Robert G. Busacker, Paul J. Gowen, A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS Defense Technical Information Center. ,(1960) , 10.21236/AD0249662
Lester Randolph Ford, Flows in networks ,(1962)
L. R. Ford, D. R. Fulkerson, SOLVING THE TRANSPORTATION PROBLEM Management Science. ,vol. 3, pp. 24- 32 ,(1956) , 10.1287/MNSC.3.1.24
Philip Wolfe, The Simplex Method for Quadratic Programming Econometrica. ,vol. 28, pp. 170- ,(1960) , 10.2307/1905320
George Bernard Dantzig, Linear Programming and Extensions ,(1963)
Richard Sinkhorn, Diagonal Equivalence to Matrices with Prescribed Row and Column Sums The American Mathematical Monthly. ,vol. 74, pp. 402- ,(1967) , 10.2307/2314570
D. Friedlander, A Technique for Estimating a Contingency Table, Given the Marginal Totals and Some Supplementary Data Journal of the Royal Statistical Society. Series A (General). ,vol. 124, pp. 412- 420 ,(1961) , 10.2307/2343244