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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 33; číslo 8; s. 1902 - 1910
Hlavní autoři:	Qin, Xiao-Wen, Hao, Rong-Xia, Wu, Jie
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.08.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!