论文信息 - Scaling of Most-Likely Traffic Patterns of Hose- and Cost-Constrained Ring and Mesh Networks - 字舞流文

Scaling of Most-Likely Traffic Patterns of Hose- and Cost-Constrained Ring and Mesh Networks

We report analytical results and statistical comparisons for the solution to the hose- and cost-constrained inverse problem for the traffic matrix and distance-dependence of ring and mesh networks based on the method of maximum entropy.

S.K. Korotky | K.N. Oikonomou

[1] S.K. Korotky,et al. Network global expectation model: a statistical formalism for quickly quantifying network needs and costs , 2004, Journal of Lightwave Technology.

[2] John E. Shore,et al. Discrete utterance speech recognition without time alignment , 1983, IEEE Trans. Inf. Theory.

[3] Walter Willinger,et al. The many facets of internet topology and traffic , 2006, Networks Heterog. Media.

[4] Carsten Lund,et al. Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach , 2005, IEEE/ACM Transactions on Networking.

[5] Rodney W. Johnson,et al. Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.

[6] Rodney W. Johnson,et al. Comments on and correction to 'Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy' (Jan 80 26-37) , 1983, IEEE Trans. Inf. Theory.

[7] M. Bhardwaj,et al. Analytical description of shared restoration capacity for mesh networks , 2005 .