Entropy 2013, 15(1), 361-371; doi:10.3390/e15010361
Article

Asymptotic Behavior of the Maximum Entropy Routing in Computer Networks

email
Received: 26 November 2012; in revised form: 16 January 2013 / Accepted: 17 January 2013 / Published: 21 January 2013
(This article belongs to the Special Issue Information Theory Applied to Communications and Networking)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: Maximum entropy method has been successfully used for underdetermined systems. Network design problem, with routing and topology subproblems, is an underdetermined system and a good candidate for maximum entropy method application. Wireless ad-hoc networks with rapidly changing topology and link quality, where the speed of recalculation is of crucial importance, have been recently successfully investigated by maximum entropy method application. In this paper we prove a theorem that establishes asymptotic properties of the maximum entropy routing solution. This result, besides being theoretically interesting, can be used to direct initial approximation for iterative optimization algorithms and to speed up their convergence.
Keywords: maximum entropy method (MEM); computer network topology; computer network routing; optimization
PDF Full-text Download PDF Full-Text [191 KB, uploaded 21 January 2013 08:43 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

Tuba, M. Asymptotic Behavior of the Maximum Entropy Routing in Computer Networks. Entropy 2013, 15, 361-371.

AMA Style

Tuba M. Asymptotic Behavior of the Maximum Entropy Routing in Computer Networks. Entropy. 2013; 15(1):361-371.

Chicago/Turabian Style

Tuba, Milan. 2013. "Asymptotic Behavior of the Maximum Entropy Routing in Computer Networks." Entropy 15, no. 1: 361-371.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert