IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI
K RAMA SUBBA RAO, SK. MASTAN BASHA, , ,
Affiliations (M.Tech) VLSI, Dept. of ECEAssitant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
A Network-on-chip is a new paradigm in complex system-on-chip designs that provide efficient on chip
communication networks. It allows scalable communication and allows decoupling of communication and computation. The
data is routed through the networks in terms of packets. We attempts to overcome latency and time reduction issue and
can provide multipurpose networking router by means of verilog and it was synthesized in Xilinx 13.2 version, simulated
Modelsim 10.0 version. In this paper our attempt is to provide a multipurpose networking router by means of Verilog code,
by this we can maintain the same switching speed with more secured way of approach we have even the packet storage
buffer on chip being generated by code in our design in the so we call this as the self-independent router called as the VLSI
Based router. The three architectures were analyzed for their performance in terms of delay, throughput and latency and
we concluded that CDMA router performs better than the other two.
K RAMA SUBBA RAO,SK. MASTAN BASHA."IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.841-846, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1128.pdf,
Channamallikarjuna Mattihalli, Suprith Ron,Naveen Kolla ” VLSI Based Robust Router Architecture” Third International Conference on Intelligent Systems Modelling and Simulation,2012.
Feng Liang, Luwen Zhang, Shaochong Lei, Guohe Zhang, Kaile Gao, and Bin Liang” Test Patterns of Multiple SIC Vectors: Theory and Application in BIST Schemes” ieee transactions on very large scale integration (vlsi) systems, vol. 21, no. 4, april 2013.
James Aweya “IP Router Architectures: An Overview”.
M. SOWMYA C. SHIREESHA G. SWETHA PRAKASH J. PATIL” VLSI Based Robust Router Architecture” .
 M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, “Scalable High Speed IP Routing Lookup,” Proc. ACM SIGCOMM’97, Cannes, France, Sept. 1997.
 V. Srinivasan and G. Varghese, “Faster IP Lookups using Controlled Prefix Expansion,” Proc. ACM SIGMETRICS, May 1998.
 S. Nilsson and G. Karlsson, “Fast Address Look-Up for Internet Routers,” Proc. Of IEEE Broadband Communications’98, April 1998.
E. Filippi, V. Innocenti, and V. Vercellone, “Address Lookup Solutions for Gigabit Switch/Router,” Proc. Globecom’98, Sydney, Australia, Nov. 1998.
M. Thottethodi, A. R. Lebeck, and S. S. Mukherjee, "BLAM: ahigh performance routing algorithm for virtual cut-through networks," in Proceedings of the International Parallel and Distributed Processing Symposium
 L. S. Peh and W. J. Dally, "A delay model and speculative architecture for pipelined routers," in Proceedings of the 7thInternational Symposium on High Performance Computer Architecture (HPCA).
 A. V. Yakovlev, A. M. Koelmans, and L. Lavagno, "High-level modeling and design of asynchronous interface logic," IEEEDesign & Test of Computers.
 H. Jingcao and R. Marculescu, "Energy- and performance aware mapping for regular NoC architectures," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, pp. 551-562, 2005.
 W. Hangsheng, L. S. Peh, and S. Malik, "A technology-aware and energy oriented topology exploration for on-chip Networks," in Proceedings of the Design, Automation and Test in Europe Conference and Exhibition .
 J. Duato, "A new theory of deadlock-free adaptive routing in wormhole networks," IEEE Transactions on Parallel and Distributed Systems, vol. 4.
 S. Arjun, W. J. Dally, A. K. Gupta, and B. Towles, "GOAL: aload-balanced adaptive routing algorithm for torus networks," in Proceedings of the International Symposium on ComputerArchitecture.
We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.