Loading...

Routing algorithms study and comparing in interconnection networks

Barati, H ; Sharif University of Technology | 2008

522 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICTTA.2008.4530201
  3. Publisher: 2008
  4. Abstract:
  5. A routing algorithm defines a route which packet traverses to get to destination. In this research we study some kind of routing algorithms that are used in internal connections networks of multi-processor and multi-computers systems. Then we discuss about some routing algorithms which have been implemented network on chip architecture. First, we present a group of routing algorithms based on various criterions, and review so-called category. Afterwards, we study adaptive and deterministic routing algorithms and express circular model applying in internal connections networks and its governing rules in order to prevent dead lock. Then we survey adaptive algorithms such as Deflection routing, Odd-Even, negative-first, north-last, west-first and finally we study and review routing algorithms like Backtracking Protocols, and Deflection Routing
  6. Keywords:
  7. Adaptive algorithms ; Algorithms ; Communication ; Computer science ; Network routing ; Routing protocols ; Technology ; Adaptive routing algorithms ; Backtracking protocols ; Dead-lock ; Deflection routing ; Deterministic routing ; Deterministic routing algorithms ; Information and communication technologies ; Interconnection networks ; Internal connections ; International conferences ; Multi processors ; Multi-computers ; Network-on-chip architecture ; Routing algorithms
  8. Source: 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA, Damascus, 7 April 2008 through 11 April 2008 ; 2008 ; 1424417520 (e-ISBN); 9781424417513 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4530201