Routing algorithms based on 2D turn model for irregular networks

A. Jouraku, M. Koibuchi, Hideharu Amano, Akira Funahashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

In order to solve traffic unbalancing caused by up∗/down∗ routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks.

Original languageEnglish
Title of host publicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
PublisherIEEE Computer Society
Pages289-294
Number of pages6
Volume2002-January
ISBN (Print)0769515797
DOIs
Publication statusPublished - 2002
EventInternational Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 - Makati, Manila, Philippines
Duration: 2002 May 222002 May 24

Other

OtherInternational Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002
CountryPhilippines
CityMakati, Manila
Period02/5/2202/5/24

    Fingerprint

Keywords

  • Bandwidth
  • Computer science
  • Electronic mail
  • Information technology
  • Routing
  • Switches
  • System recovery
  • Telecommunication traffic
  • Traffic control
  • Tree graphs

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Jouraku, A., Koibuchi, M., Amano, H., & Funahashi, A. (2002). Routing algorithms based on 2D turn model for irregular networks. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (Vol. 2002-January, pp. 289-294). [1004296] IEEE Computer Society. https://doi.org/10.1109/ISPAN.2002.1004296