An entropy maximization problem in shortest path routing networks
Citations
23 citations
Cites background or methods from "An entropy maximization problem in ..."
...They further proposed the use of entropy maximization and betweenness entropy in order to make communications routing decentralized [25] and handle single edge failures [34]....
[...]
...For example, information functionals are based on edge or node betweenness centrality [24,25,34,50,53] distances to a given vertex [28], degree, degree power or probability distribution of degrees [31,41], paths or paths’ length [16,35], and closeness or eigenvector centrality [53]....
[...]
...[14] X X X X [15] X X acyclic [16] X X acyclic [17] X X X X [18] X X [19] X X strongly connected, aperiodic [20] X X connected [21] X X [22] X X [23] X X [24] X X no self-loops [25] X X [26] X X [27] X X [28] X X no self-loops [29] X X X [30] X X [31] X X [32] X X [33] X X [34] X X [35] X X [36] X X [37] X X [38] X X [39] X X [40] X X [41] X X [42] X X no self-loops [43] X X [44] X X [45] X X [46] X X [47] X X connected [48] X X [49] X X X X [50] X X [51] X X [52] X X [53] X X X [54] X X [55] X X [56] X X [57] X X [58] not specified [59] X X [60] X X [61] X X [62] X X [63] X X...
[...]
...[24] Chellappan, Vanniarajan and Sivalingam, Krishna M 2013 proceeding 2013 19th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN) [25] V....
[...]
...[24,25,34] H(G) = − ∑ (u,v)∈E p(u, v) log p(u, v) p(u, v) = η•,•(u, v) ∑(x,y)∈E η•,•(x, y) where η•,•(u, v) is the...
[...]
13 citations
3 citations
Cites background from "An entropy maximization problem in ..."
...Network Centrality [1]: The network centrality or the entropy of SPBC is defined by...
[...]
...The Shortest Path Betweenness Centrality (SPBC) of a link (i) is defined as (1) Network Centrality [1]: The network centrality or the entropy of SPBC is defined by (2) Where, (3) represents the random variable associated with the probability distribution formed from equation (3)....
[...]
...Shortest Path Betweenness Centrality [1]: Let represent the total number of shortest paths between every pair of source-destination nodes (s, t): s and t V....
[...]
References
16 citations
"An entropy maximization problem in ..." refers background in this paper
...Also, as noted in [8], in the context of network resilience, a link or node failure may have varying impact on the entire network....
[...]
...More information on centrality related work can be found in [7], [8]....
[...]
...This justifies the claim made in [8] that the criticality of a link is also determined based on the back up quality of the link....
[...]
14 citations
10 citations
"An entropy maximization problem in ..." refers methods in this paper
...In [3], we introduced a network-wide measure based on the idea of centrality....
[...]
9 citations
"An entropy maximization problem in ..." refers background in this paper
...The inverse shortest path problem has been extensively studied in [1], [2], [5]....
[...]