Proceedings ArticleDOI
An entropy maximization problem in shortest path routing networks
Vanniarajan Chellappan,Krishna M. Sivalingam,Kamala Krithivasan +2 more
- pp 1-6
TLDR
In the context of an IP network, an interesting case of the inverse shortest path problem is investigated using the concept of network centrality, and a heuristic approach is proposed to obtain a centrality distribution that maximizes the entropy.Abstract:
In the context of an IP network, we investigate an interesting case of the inverse shortest path problem using the concept of network centrality. For a given network, the centrality distribution associated with the links of a network can be determined based on the number of shortest paths passing through each link. An entropy measure for this distribution is defined, and we then forumulate the inverse shortest problem in terms of maximizing this entropy. We then obtain a centrality distribution that is as broadly distributed as possible subject to the topology constraints. An appropriate change in the weight of a link alters the number of shortest paths that pass through it, thereby modifying the centrality distribution. The idea is to obtain a centrality distribution that maximizes the entropy. This problem is shown to be NP-hard, and a heuristic approach is proposed. An application to handling link failure scenarios in Open Shortest Path First routing is discussed.read more
Citations
More filters
Journal ArticleDOI
A Survey of Information Entropy Metrics for Complex Networks.
Yamila M. Omar,Peter Plapper +1 more
TL;DR: A narrative literature review of information entropy metrics for complex networks is conducted following the PRISMA guidelines, identifying the areas in need for further development aiming to guide future research efforts.
Journal ArticleDOI
A Centrality Entropy Maximization Problem in Shortest Path Routing Networks
TL;DR: This paper investigates an interesting case of the inverse shortest path problem using the concept of network centrality, and a heuristic approach is proposed to obtain a centrality distribution that maximizes the entropy.
Journal ArticleDOI
Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm
TL;DR: This work aims to develop a Hybrid algorithm Dijkstra’s Floyd Warshall algorithm to solve entropy maximization routing protocol problem and is compared with the existing in order to find the best and shortest paths.