Title :
Routing algorithms based on 2D turn model for irregular networks
Author :
Jouraku, Akiya ; Koibuchi, Michihiro ; Amano, Hideharu ; Funahashi, Akira
Author_Institution :
Dept. of Comput. Sci., Keio Univ., Kanagawa, Japan
fDate :
6/24/1905 12:00:00 AM
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
Keywords :
computer networks; concurrency control; resource allocation; telecommunication network routing; telecommunication traffic; trees (mathematics); 2D direction; 2D turn model; deadlock freedom; irregular networks; performance; prohibited turn selection; routing algorithms; simulation; spanning tree; stability; traffic balancing; traffic unbalancing; up*/down* routing; Bandwidth; Computer science; Electronic mail; Information technology; Routing; Switches; System recovery; Telecommunication traffic; Traffic control; Tree graphs;
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on
Conference_Location :
Makati City, Metro Manila
Print_ISBN :
0-7695-1579-7
DOI :
10.1109/ISPAN.2002.1004296
