Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks
Sign Up to like & getrecommendations! Published in 2019 at "IEEE/ACM Transactions on Networking"
DOI: 10.1109/tnet.2019.2910019
Abstract: A set of $k~(\geqslant 2)$ spanning trees in the underlying graph of a network topology is called completely independent spanning trees, (CISTs for short), if they are pairwise edge-disjoint and inner-node-disjoint. Particularly, if $k=2$ ,… read more here.
Keywords: protection; dual cists; cayley graphs; dual cist ... See more keywords