Adaptive routing algorithms and implementation for TESH network

The Tori-connected mESH (TESH) Network is a k-ary n-cube networks of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level k-ary n-cube networks. Many adaptive routing algorithms for k-ary n-cube networks have already been pro...

Full description

Bibliographic Details
Main Authors:	Miura, Yasuyuki, Kaneko, Masahiro, Rahman, M.M. Hafizur, Watanabe, Shigeyoshi
Format:	Article
Language:	English
Published:	Scientific Research 2013
Subjects:	TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices
Online Access:	http://irep.iium.edu.my/29554/ http://irep.iium.edu.my/29554/ http://irep.iium.edu.my/29554/ http://irep.iium.edu.my/29554/1/CN_2013022711330004_2013.pdf

id	iium-29554
recordtype	eprints
spelling	iium-295542013-05-22T11:11:13Z http://irep.iium.edu.my/29554/ Adaptive routing algorithms and implementation for TESH network Miura, Yasuyuki Kaneko, Masahiro Rahman, M.M. Hafizur Watanabe, Shigeyoshi TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices The Tori-connected mESH (TESH) Network is a k-ary n-cube networks of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level k-ary n-cube networks. Many adaptive routing algorithms for k-ary n-cube networks have already been proposed. Thus, those algorithms can also be applied to TESH network. We have proposed three adaptive routing algorithms—channel-selection, link-selection, and dynamic dimension reversal—for the efficient use of network resources of a TESH network to improve dynamic communication performance. In this paper, we implement these routers using VHDL and evaluate the hardware cost and delay for the proposed routing algorithms and compare it with the dimension order routing. The delay and hardware cost of the proposed adaptive routing algorithms are almost equal to that and slightly higher than that of dimension order routing, respectively. Also we evaluate the communication performance with hardware implementation. It is found that the communication performance of a TESH network using these adaptive algorithms is better than when the dimension-order routing algorithm is used. Scientific Research 2013-02 Article PeerReviewed application/pdf en http://irep.iium.edu.my/29554/1/CN_2013022711330004_2013.pdf Miura, Yasuyuki and Kaneko, Masahiro and Rahman, M.M. Hafizur and Watanabe, Shigeyoshi (2013) Adaptive routing algorithms and implementation for TESH network. Communications and Networks, 5 (1). pp. 34-49. ISSN 1947-3826 (O), 1949-2421 (P) http://www.scirp.org/journal/PaperInformation.aspx?PaperID=28236 10.4236/cn.2013.51004
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices
spellingShingle	TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices Miura, Yasuyuki Kaneko, Masahiro Rahman, M.M. Hafizur Watanabe, Shigeyoshi Adaptive routing algorithms and implementation for TESH network
description	The Tori-connected mESH (TESH) Network is a k-ary n-cube networks of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level k-ary n-cube networks. Many adaptive routing algorithms for k-ary n-cube networks have already been proposed. Thus, those algorithms can also be applied to TESH network. We have proposed three adaptive routing algorithms—channel-selection, link-selection, and dynamic dimension reversal—for the efficient use of network resources of a TESH network to improve dynamic communication performance. In this paper, we implement these routers using VHDL and evaluate the hardware cost and delay for the proposed routing algorithms and compare it with the dimension order routing. The delay and hardware cost of the proposed adaptive routing algorithms are almost equal to that and slightly higher than that of dimension order routing, respectively. Also we evaluate the communication performance with hardware implementation. It is found that the communication performance of a TESH network using these adaptive algorithms is better than when the dimension-order routing algorithm is used.
format	Article
author	Miura, Yasuyuki Kaneko, Masahiro Rahman, M.M. Hafizur Watanabe, Shigeyoshi
author_facet	Miura, Yasuyuki Kaneko, Masahiro Rahman, M.M. Hafizur Watanabe, Shigeyoshi
author_sort	Miura, Yasuyuki
title	Adaptive routing algorithms and implementation for TESH network
title_short	Adaptive routing algorithms and implementation for TESH network
title_full	Adaptive routing algorithms and implementation for TESH network
title_fullStr	Adaptive routing algorithms and implementation for TESH network
title_full_unstemmed	Adaptive routing algorithms and implementation for TESH network
title_sort	adaptive routing algorithms and implementation for tesh network
publisher	Scientific Research
publishDate	2013
url	http://irep.iium.edu.my/29554/ http://irep.iium.edu.my/29554/ http://irep.iium.edu.my/29554/ http://irep.iium.edu.my/29554/1/CN_2013022711330004_2013.pdf
first_indexed	2023-09-18T20:43:24Z
last_indexed	2023-09-18T20:43:24Z
_version_	1777409515376869376

Adaptive routing algorithms and implementation for TESH network

Similar Items