Construction of Dual-CISTs on an Infinite Class of Networks

The main method to achieve fault-tolerant network systems is by exploiting and effectively utilizing the edge-disjoint and/or inner-vertex-disjoint paths between pairs of source and destination vertices. Completely independent spanning trees (CISTs for short) are powerful tools for reliable broadcas...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 33; no. 8; pp. 1902 - 1910
Main Authors:	Qin, Xiao-Wen, Hao, Rong-Xia, Wu, Jie
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	a protection routing Ad hoc networks Algorithms Apexes Broadcasting CIST-partition Completely independent spanning trees Computer networks constructive algorithm Fault tolerance Fault tolerant systems Graph theory Hamilton bipartition sufficient condition Hypercubes Network topologies Network topology Routing Routing (telecommunications) System effectiveness Trees (mathematics)
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!