Author:
R. Prasad G.,Shet K. C.,Bhat Narasimha B.
Reference10 articles.
1. Alberto Leon-Garcia, Indra Widjaja, “Communication Networks: Fundamental concepts & key architectures”, Tata McGraw Hill Publishing limited, 2000.
2. Andre DeHon and John Wawrzynek, “Reconfigurable Computing:What, Why, and Implications for Design Automation”,Proceedings of 1999 Design Automation Conference, June 1999, pp 610-615.
3. Matti Tommiska, Jorma Skyta, “Dijkstra’s Shortest Path Routing Algorithm in Reconfigurable Hardware”, Proceedings of the 11th conference on Field Programmable Logic and Applications (FPL2001), Aug 2001, pp 653-657.
4. M.H. Xu, Y. Q. Liu, Y. X. Zhang and G.F. Luan, “An improved Dijkstra’s shortest path algorithm for sparse network”, Applied Mathematics and Computation Journal, Volume 185, Issue 1, 1 February 2007,pp 247-254.
5. Paolo Narvaez, Kai-Yeung Siu and Hong-Yi Tzeng, “New Dynamic SPT Algorithm Based on a Ball and String Model”, IEEE transactions on Networking, Dec 2001, pp 706-718.