Email this article 
Open Access
Subscription or Fee Access
Network Throughput Improvement using Dijkstra’s and Floyd Warshall Algorithm
Abstract
In now a day’s explosion of digital world results in faster, easily accessible, most efficient, reliable communication over the network communication to exchange the information. Considering this advantages, this paper introduced the network on which shortest path algorithm implemented to communicate number of nodes on network in shortest, efficient path with efficient throughput mechanism. In this paper Dijkstra and Floyd Warshall algorithms are implement to find shortest and efficient path. In the simulation, it estimates parameters the throughput, arrival and blocking rate with packet error rate and signal to noise ratio. The routing algorithms are compared on the basis of parameters and better results estimated in network simulator NS2 software.
Keywords
References
Chao Zhang, Weidong Wang, Guo Wei, “Design of ARQ protocols for two-user cooperative diversity systems in wireless networks”, Science Direct Computer Communication 32 (2009), www.elsevier.com/locate/comcom
Sudip Misra and B. John Oommen, “Dynamic Algorithms for the Shortest Path Routing Problem: Learning Automata-Based Solutions,” IEEE transactions Part B: Cybernetics, Vol. 35, No. 6, December 2005.
Amit Kamboj and R. S. Chauhan, “Implementation of Shortest Path For Networks Topology using MATLAB” International Journal of Information Technology and Knowledge Management January June 2009, Volume 2, No. 1
Wei Zhang, Hao Chen, Chong Jiang, Lin Zhu, “Improvement and experimental evaluation Bellman Ford algorithm”, International Conference on Advanced Information and Communication Technology for Education (ICAICTE 2013).
Mounir Arioua, Said Belkouch, Mohamed Agdad, “Efficient Minimizing of Routing Cost in Wireless Networks”, Journal of Engineering and Development, Vol. 17, No.2, 2013.
MohdAzlishah Othman, HamzahAsyraniSulaiman, MohdMuzafarIsmail, Mohamad HarrisMisran, Maizatul Alice BintiMeor Said, RidzaAzriRamlee, “An Analysis of Least-Cost Routing using Bellman Ford and Dijkstra Algorithms in Wireless Routing Network”, International Journal of Advancements in Computing Technology(IJACT) Volume 5, Number 10, June 2013
Peter P. Pham and Sylvie Perreau, “Performance analysis of reactive shortest path and multipath routing mechanism with load balance”, IEEE INFOCOM 2003
Qingming Ma and peter Steenkiste, “On Path Selection for Traffic with Bandwidth Guarantees”, Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213, USA
Deqiang Chen, Martin Haenggiand J. Nicholas Laneman, “Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks ”, IEEE transactions on wireless communications, vol. 7, no. 12, December 2008
Anupama Tewar and Dr. Anuj Kumar, “Different Routing Algorithm for computer Networks”, KAAV international journal of science, engineering &technology, KIJSET/ Jan-Mar 2014/ Vol-1/Issue-1
Andrej KOS and Janez BEŠTER, “Poisson Packet Traffic Generation Based on Empirical Data”, systemics, cybernetics and informatics volume 1 - number 5
LIPING FU and L. R. RILETT, “Expected Shortest Paths In Dynamic And Stochastic Traffic Networks”, Transpn, Elsevier Science Res.-B, Vol. 32, No. 7, 1998
J. Nicholas Lanemanand Gregory W. Wornell, “Distributed Space–Time-Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks”, IEEE transactions on information theory, Vol. 49, No. 10, October 2003
Ramesh Babu H.S and Gowrishankar, “Call Admission Control for Next Generation Wireless Networks Using Higher Order Markov Model”, Computer and Information Science (CCSE), Volume 3, No. 1 February, 2010.
T. Senthil Kumaran *, V. Sankaranarayanan “Early congestion detection and adaptive routing in MANET”, Cairo University, Egyptian Informatics Journal, October 2011 pp.165-175, www.elsevier.com/locate/eij, www.sciencedirect.com
Shraddha Gajbhiye, “Optimal Power Flow Path Selection Using Different Shortest Path Algorithms”, International Journal of Innovations in Engineering and Technology (IJIET), Vol. 2 Issue 1 February 2013, ISSN: 2319 – 1058
Sachin Awasthi, Vijayshri Chaurasia, Ajay Somkuwar, “Verilog Implementation of a System for Finding Shortest Path by Using Floyd-Warshall Algorithm”, International Journal of Emerging Technologies in Computational and Applied Sciences(IJETCAS), March-May, 2013
Kairanbay Magzhan, Hajar Mat Jani, “A Review And Evaluations Of Shortest Path Algorithms”, International Journal of Scientific & Technology Research Volume 2, Issue 6, June 2013
Yasuhiro Urayama and Takuji Tachibana, “Virtual Network Construction with K-Shortest Path Algorithm and Prim’s MST Algorithm for Robust Physical Networks”, Proceedings of the International MultiConference of Engineers and Computer Scientists IMECS 2014 Vol I, March 12 - 14, 2014, Hong Kong.
Rakesh Kumar and Mahesh Kumar, “Reliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks” IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 3, January 2012
Nenad S. Kojić1, Marija B. Zajeganović Ivančić1, Irini S. Reljin2 and Branimir D. Reljin2, “New algorithm for packet routing in mobile ad-hoc networks”, Journal of Automatic Control, University of Belgrade, VOL. 20:9-16, 2010
Michael Alexander Djojo and Kanisius Karyono, “Computational Load Analysis of Dijkstra, A *and Floyd-Warshall Algorithms in Mesh Network”, International Conference on Robotics, Biomimetics, Intelligent Computational Systems (ROBIONETICS) Yogyakarta, Indonesia, November 25-27, 2013
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.