CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm

by Pawan Kumar Gupta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 181 - Number 37
Year of Publication: 2019
Authors: Pawan Kumar Gupta
10.5120/ijca2019918341

Pawan Kumar Gupta . Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm. International Journal of Computer Applications. 181, 37 ( Jan 2019), 38-42. DOI=10.5120/ijca2019918341

@article{ 10.5120/ijca2019918341,
author = { Pawan Kumar Gupta },
title = { Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Jan 2019 },
volume = { 181 },
number = { 37 },
month = { Jan },
year = { 2019 },
issn = { 0975-8887 },
pages = { 38-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume181/number37/30276-2019918341/ },
doi = { 10.5120/ijca2019918341 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:08:26.273432+05:30
%A Pawan Kumar Gupta
%T Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 181
%N 37
%P 38-42
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The shortest path problem is to find a path between two vertices on a given graph, such that the sum of the weights on its constituent edges is minimized. The classic Dijkstra’s algorithm was designed to solve the single source shortest path problem for a static graph. It works starting from the source node and calculating the shortest path on the whole network. This work aims to develop a Hybrid algorithm Dijkstra’s - Floyd Warshall algorithm to solve entropy maximization routing protocol problem. The algorithm has to find the shortest path between the source and destination nodes. Route guidance algorithm is use to find best shortest path in routing network, this is poised to minimize costs between the origin and destination nodes. The proposed algorithm is compared with the existing in order to find the best and shortest paths.

References
  1. Vanniarajan Chellappan, Krishna M. Sivalingam, and Kamala Krithivasan. "An Entropy Maximization Problem in Shortest Path Routing Networks." Local & Metropolitan Area Networks (LANMAN), 2014 IEEE 20th International Workshop on. IEEE, 2014.
  2. LI Ji, WANG Bing-Hong, WANG Wen-Xu, ZHOU Tao, "Network entropy based on topology configuration and its computation to random networks." Chinese Physics Letters 25.11 (2008): 4177.
  3. J. N. Kapur and H. K. Kesvan, “Entropy optimization principles and their applications. Springer Netherlands, 1992.
  4. Marco Frittelli, "The minimal entropy martingale measure and the valuation problem in incomplete markets." Mathematical finance 10.1 (2000): 39-52.
  5. Ginestra Bianconi, Entropy of network ensembles." Physical Review E79.3 (2009): 036114.
  6. Brian P. Tighe, Adrianne R.T. van Eerd, and Thijs J. H. Vlugt,  "Entropy maximization in the force network ensemble for granular solids." Physical review letters 100.23 (2008): 238001.
  7. Naonori Ueda and Ryohei Nakano, “Deterministic annealing EM algorithm."Neural Networks 11.2 (1998): 271-282.
  8. Maximilien Gadouleau and Soren Riis, “Graph-theoretical constructions for graph entropy and network coding based communications." Information Theory, IEEE Transactions on 57.10 (2011): 6703-6717.
  9. S. Mart´ınez, F. Nicol´as, F. Pennini, and A. Plastino, “Tsallis’ entropy maximization procedure revisited."Physica A: Statistical Mechanics and its Applications 286.3 (2000): 489-502.
  10. R.L.C. Vink_ and G.T. Barkema, “Configurational entropy of network-forming materials." Physical review letters 89.7 (2002): 076405.
  11. Babak Hassibi, Sormeh Shadbakht “Normalized entropy vectors, network information theory and convex optimization." Information Theory for Wireless Networks, 2007 IEEE Information Theory Workshop on. IEEE, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Entropy Dijkstra’s Algorithm Dijkstra’s-Floyd Warshall algorithm

Powered by PhDFocusTM