Routing algorithms based on 2D turn model for irregular networks

A. Jouraku, M. Koibuchi, H. Amano, A. 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 - International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002
EditorsD. Frank Hsu, Rafael P. Saldana, Oscar H. Ibarra
PublisherIEEE Computer Society
Pages289-294
Number of pages6
ISBN (Electronic)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

Publication series

NameProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Volume2002-January

Other

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

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Routing algorithms based on 2D turn model for irregular networks'. Together they form a unique fingerprint.

Cite this