An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network

Chiuyuan Chen; Jing Kai Lou

doi:10.1109/LCOMM.2006.1613752

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network

Chiuyuan Chen^*, Jing Kai Lou

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

This letter considers the problem of designing efficient routing algorithms for the backward network of a bidirectional general shuffle-exchange network (BNBGSEN for short); switch elements in the network are of size k × k. It has been shown in [1] that the algorithm in [5] can be used to obtain (as many as k) backward control tags for a source j to get to a destination i in a BNBGSEN. In this letter, we show that a BNBGSEN has a wonderful property: for each destination i, there are two backward control tags associated with it such that every source j can get to i by using one of the two tags. We use this property to derive an efficient tag-based routing algorithm.

Original language	English
Pages (from-to)	296-298
Number of pages	3
Journal	IEEE Communications Letters
Volume	10
Issue number	4
DOIs	https://doi.org/10.1109/LCOMM.2006.1613752
State	Published - 1 Apr 2006

Keywords

Multistage interconnection network
Omega network
Shuffle-exchange
Tag-based routing algorithm

Access to Document

10.1109/LCOMM.2006.1613752

Fingerprint Dive into the research topics of 'An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network'. Together they form a unique fingerprint.

Cite this

@article{a190b4ddbe56469d89392fbfe7765e65,

title = "An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network",

abstract = "This letter considers the problem of designing efficient routing algorithms for the backward network of a bidirectional general shuffle-exchange network (BNBGSEN for short); switch elements in the network are of size k × k. It has been shown in [1] that the algorithm in [5] can be used to obtain (as many as k) backward control tags for a source j to get to a destination i in a BNBGSEN. In this letter, we show that a BNBGSEN has a wonderful property: for each destination i, there are two backward control tags associated with it such that every source j can get to i by using one of the two tags. We use this property to derive an efficient tag-based routing algorithm.",

keywords = "Multistage interconnection network, Omega network, Shuffle-exchange, Tag-based routing algorithm",

author = "Chiuyuan Chen and Lou, {Jing Kai}",

year = "2006",

month = apr,

day = "1",

doi = "10.1109/LCOMM.2006.1613752",

language = "English",

volume = "10",

pages = "296--298",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network

AU - Chen, Chiuyuan

AU - Lou, Jing Kai

PY - 2006/4/1

Y1 - 2006/4/1

N2 - This letter considers the problem of designing efficient routing algorithms for the backward network of a bidirectional general shuffle-exchange network (BNBGSEN for short); switch elements in the network are of size k × k. It has been shown in [1] that the algorithm in [5] can be used to obtain (as many as k) backward control tags for a source j to get to a destination i in a BNBGSEN. In this letter, we show that a BNBGSEN has a wonderful property: for each destination i, there are two backward control tags associated with it such that every source j can get to i by using one of the two tags. We use this property to derive an efficient tag-based routing algorithm.

AB - This letter considers the problem of designing efficient routing algorithms for the backward network of a bidirectional general shuffle-exchange network (BNBGSEN for short); switch elements in the network are of size k × k. It has been shown in [1] that the algorithm in [5] can be used to obtain (as many as k) backward control tags for a source j to get to a destination i in a BNBGSEN. In this letter, we show that a BNBGSEN has a wonderful property: for each destination i, there are two backward control tags associated with it such that every source j can get to i by using one of the two tags. We use this property to derive an efficient tag-based routing algorithm.

KW - Multistage interconnection network

KW - Omega network

KW - Shuffle-exchange

KW - Tag-based routing algorithm

UR - http://www.scopus.com/inward/record.url?scp=33645822114&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2006.1613752

DO - 10.1109/LCOMM.2006.1613752

M3 - Article

AN - SCOPUS:33645822114

VL - 10

SP - 296

EP - 298

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 4

ER -

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network

Abstract

Keywords

Access to Document

Other files and links

Cite this