Topological properties of OTIS-networks

An Efficient Construction of Node Disjoint Paths in OTIS Networks

“…Provided that a parallel path construction method in the basis graph Ω is known, there is a straightforward construction of parallel paths in OTIS-Ω according to [3]. The idea of the construction in OTIS-Ω is as follows.…”

“…The construction described in [3] is here called Algorithm 2, which constructs k parallel paths between 〈g 1 , p 1 〉 and 〈g 2 , p 2 〉 in OTIS-Ω, where k is the number of parallel paths from p 1 to p 2 in Ω generated by the given construction of parallel paths in Ω. See [3] for the detailed description and proof of the correctness of the algorithm.…”

“…See [3] for the detailed description and proof of the correctness of the algorithm. Now we give the performance of Algorithm 2.…”

“…〈3,0〉 The following basis topological metrics of OTIS-Ω as functions of the corresponding metrics of Ω are derived from Definition 1 and similar expressions in [3,9]:…”

“…Although some studies are related to general properties, including fault tolerance, of OTIS networks [3,9,17,18], so far all research work in this direction is only confined to OTIS networks with basis networks being maximally fault tolerant, and those proposed constructions of parallel paths in these OTIS networks are closely dependent upon the corresponding constructions in their basis networks [2,3,9].…”