Constructing Independent Spanning Trees on Transposition Networks

In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection no...

Full description

Bibliographic Details
Main Authors: Chien-Fu Lin, Jie-Fu Huang, Sun-Yuan Hsieh
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9160957/
_version_ 1811210527446138880
author Chien-Fu Lin
Jie-Fu Huang
Sun-Yuan Hsieh
author_facet Chien-Fu Lin
Jie-Fu Huang
Sun-Yuan Hsieh
author_sort Chien-Fu Lin
collection DOAJ
description In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection node fails, users want to reconnect as rapidly as possible, it is urgently in need to construct a new path. Thus, searching node-disjoint paths is crucial for finding a new path in networks. In this article, we expand the target to construct independent spanning trees to maximize the fault tolerance of transposition networks.
first_indexed 2024-04-12T04:56:09Z
format Article
id doaj.art-bf5deccde993417d9488086fb18511af
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-04-12T04:56:09Z
publishDate 2020-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-bf5deccde993417d9488086fb18511af2022-12-22T03:47:07ZengIEEEIEEE Access2169-35362020-01-01814712214713210.1109/ACCESS.2020.30148229160957Constructing Independent Spanning Trees on Transposition NetworksChien-Fu Lin0https://orcid.org/0000-0002-8188-0729Jie-Fu Huang1https://orcid.org/0000-0002-7984-6273Sun-Yuan Hsieh2https://orcid.org/0000-0003-4746-3179Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, TaiwanDepartment of Computer Science and Information Engineering, National Cheng Kung University, Tainan, TaiwanDepartment of Computer Science and Information Engineering, National Cheng Kung University, Tainan, TaiwanIn interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection node fails, users want to reconnect as rapidly as possible, it is urgently in need to construct a new path. Thus, searching node-disjoint paths is crucial for finding a new path in networks. In this article, we expand the target to construct independent spanning trees to maximize the fault tolerance of transposition networks.https://ieeexplore.ieee.org/document/9160957/Independent spanning treestransposition networksinterconnection networksCayley graphs
spellingShingle Chien-Fu Lin
Jie-Fu Huang
Sun-Yuan Hsieh
Constructing Independent Spanning Trees on Transposition Networks
IEEE Access
Independent spanning trees
transposition networks
interconnection networks
Cayley graphs
title Constructing Independent Spanning Trees on Transposition Networks
title_full Constructing Independent Spanning Trees on Transposition Networks
title_fullStr Constructing Independent Spanning Trees on Transposition Networks
title_full_unstemmed Constructing Independent Spanning Trees on Transposition Networks
title_short Constructing Independent Spanning Trees on Transposition Networks
title_sort constructing independent spanning trees on transposition networks
topic Independent spanning trees
transposition networks
interconnection networks
Cayley graphs
url https://ieeexplore.ieee.org/document/9160957/
work_keys_str_mv AT chienfulin constructingindependentspanningtreesontranspositionnetworks
AT jiefuhuang constructingindependentspanningtreesontranspositionnetworks
AT sunyuanhsieh constructingindependentspanningtreesontranspositionnetworks