CFP last date
22 April 2024
Reseach Article

On Chip Packet Routing: An Algorithm for Packet Routing in a Network-on-Chip

Published on January 2012 by Naren V Tikare
Emerging Technology Trends on Advanced Engineering Research - 2012
Foundation of Computer Science USA
ICETT - Number 3
January 2012
Authors: Naren V Tikare
b64adc5f-471b-4cda-9ea9-8b91d029a318

Naren V Tikare . On Chip Packet Routing: An Algorithm for Packet Routing in a Network-on-Chip. Emerging Technology Trends on Advanced Engineering Research - 2012. ICETT, 3 (January 2012), 7-13.

@article{
author = { Naren V Tikare },
title = { On Chip Packet Routing: An Algorithm for Packet Routing in a Network-on-Chip },
journal = { Emerging Technology Trends on Advanced Engineering Research - 2012 },
issue_date = { January 2012 },
volume = { ICETT },
number = { 3 },
month = { January },
year = { 2012 },
issn = 0975-8887,
pages = { 7-13 },
numpages = 7,
url = { /proceedings/icett/number3/9842-1022/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Emerging Technology Trends on Advanced Engineering Research - 2012
%A Naren V Tikare
%T On Chip Packet Routing: An Algorithm for Packet Routing in a Network-on-Chip
%J Emerging Technology Trends on Advanced Engineering Research - 2012
%@ 0975-8887
%V ICETT
%N 3
%P 7-13
%D 2012
%I International Journal of Computer Applications
Abstract

The paper proposes a novel algorithm for a Network-on- Chip, which is based on packet switching. Unlike datagram protocol used in large communication network, which can be one of the algorithms in NoC; this paper concentrates on static method of routing of packets. The algorithm described here, uses three different types of packets to achieve communication between various intellectual properties connected to the chip. A packet named route establisher commences the start of packet transfer establishing a fixed route from the source node to the destination node. The packet following route establisher is the data packet, which hops through the same nodes as fixed by the route establisher. When all the data is sent or received, source IP has an option of destroying the link with the destination IP, using route destroyer packet, or might keep it for future communication. A simple prototype using sixteen nodes is used in the design to prove the working of NoC, which further can be expanded to any number of nodes as per the requirement in the design. The proposed algorithm is applicable for a network which is a square mesh topology. The number of nodes in a row should be exactly equal to the number of nodes in a column. The paper also enhances a unique internal architecture of a node in NoC, focusing on the uses of Content Addressable Memory (CAM) as a routing table in a node.

References
  1. L. Benini (Ed. ), Integration. The VLSI journal, special issue on Network on Chip, volume 38, Issue 1, pages 1- 13, 2004.
  2. W. J. Dally and B. Towles, "Route Packets, Not Wires: On-Chip Interconnection networks" Proc. Design Automation Conf. (DAC), pp. 683- 689, 2001.
  3. Journal of System Architecture; Volume 50, Issue 2- 3, February 2004, Pages 61-63, Special issue on networks on chip.
  4. The 2nd IEEE International Symposium on Networks- on-Chip, April 2008.
  5. W. J. Dally and C. L. Seitz, "The Torus Routing Chip," Technical Report 5208: TR: 86, Computer Science Dept. , California Inst. of Technology, pp. 1-19, 1986.
  6. P. Guerrier and A. Greiner, "A Generic Architecture for On-Chip Packet-Switched Interconnections," Proc. Design and Test in Europe (DATE), pp. 250-256, Mar. 2000.
  7. S. Kumar et al. , "A Network on Chip Architecture and Design Methodology," Proc. Int'l symposium. VLSI (ISVLSI), pp. 117-124, 2002.
  8. S. Kumar et al. , "A Network on Chip Architecture and Design Methodology," Proc. Int'l symposium. VLSI (ISVLSI), pp. 117- 24, 2002.
  9. F. Karim et al. , "An interconnect Architecture for Networking Systems on Chips," IEEE Micro, vol. 22, no. 5, pp. 36-45, Sept. /Oct. 2002.
  10. H. H. Najaf-abadi et al. , "Performance Modeling of Fully Adaptive Wormhole Routing in 2D Mesh-Connected Multiprocessors," Proc. Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS), pp. 528-534, Oct. 2004.
  11. Computer Communications, Volume 30, Issue 18, 10 December 2007, Pages 3823-3831 Optical Networking: Systems and Protocols.
  12. Communication networks; fundamental concepts and key architectures-Alberto Leon and Indira Widjaja, McGraw hill companies, 2001.
  13. http://www. asic-world. com/verilog/verilog_one_day2. html as read on 18th may 2010.
  14. Ran Ginosar, "Fourteen Ways to Fool Your Synchronizer," async, pp. 89, Ninth IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'03), 2003
  15. Biberman, A. ; Lee, B. ; Sherwood Droz, N. ; Lipson, M. ; Bergman, K. ; "Broadband Operation of Nanophotonic Router for Silicon Photonic Networks-on-Chip, "IEEE Photonics Technology Letters, 2010.
  16. IEEE Computer Society Annual Symposium on VLSI (ISVLSI'02),A Network on Chip architecture and Design Methodology, Pittsburgh, Pennsylvania, April 25-April 26 for NoC architecture.
  17. Journal of Systems Architecture, Volume 50, Issues 2-3, February 2004, Pages 105-128 Special issue on networks on chip.
Index Terms

Computer Science
Information Sciences

Keywords

Network-on-chip Static Routing Parallelism Content Addressable Memory (cam) Routing Table