Asymptotic behavior of the maximum entropy routing in computer networks

DOI10.3390/e15010361zbMath1308.68020OpenAlexW2008019524MaRDI QIDQ742656

Milan Tuba

Publication date: 19 September 2014

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e15010361

zbMATH Keywords

optimizationmaximum entropy method (MEM)computer network routingcomputer network topology

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Minimum mutual information and non-Gaussianity through the maximum entropy method: theory and properties
• Tsallis entropy, escort probability and the incomplete information theory
• A maximum entropy modelling of the rain drop size distribution
• Axiomatic characterizations of information measures
• Simultaneous Equation Model based on the generalized maximum entropy for studying the effect of management factors on enterprise performance
• Information Theory and Statistical Mechanics

This page was built for publication: Asymptotic behavior of the maximum entropy routing in computer networks