Diameter and routing in enhanced OTIS cube
RK Das - 2007 International Conference on Computing: Theory …, 2007 - ieeexplore.ieee.org
2007 International Conference on Computing: Theory and …, 2007•ieeexplore.ieee.org
Enhanced OTIS-cube (E-OTIS-Q n), a variation of the OTIS-cube (OTIS-Q n) was proposed
in (RK Das, 2005). E-OTIS-Q n is regular of degree n+ 1 and is obtained from the normal
OTIS-cube by adding some extra links. In (RK Das, 2005), it was shown that the diameter of
E-OTIS-Q n is less than or equal to lfloor4n+ 5/3rfloor and a heuristic for point-to-point
routing has been proposed. In this paper, an optimal algorithm for one-to-one routing in E-
OTIS-Q n has been developed. We have shown that the diameter of E-OTIS-Q n is equal to …
in (RK Das, 2005). E-OTIS-Q n is regular of degree n+ 1 and is obtained from the normal
OTIS-cube by adding some extra links. In (RK Das, 2005), it was shown that the diameter of
E-OTIS-Q n is less than or equal to lfloor4n+ 5/3rfloor and a heuristic for point-to-point
routing has been proposed. In this paper, an optimal algorithm for one-to-one routing in E-
OTIS-Q n has been developed. We have shown that the diameter of E-OTIS-Q n is equal to …
Enhanced OTIS-cube (E-OTIS-Q n ), a variation of the OTIS-cube (OTIS-Q n ) was proposed in (R.K. Das, 2005). E-OTIS-Q n is regular of degree n+1 and is obtained from the normal OTIS-cube by adding some extra links. In (R.K. Das, 2005), it was shown that the diameter of E-OTIS-Q n is less than or equal to lfloor4n+5/3rfloor and a heuristic for point-to-point routing has been proposed. In this paper, an optimal algorithm for one-to-one routing in E-OTIS-Q n has been developed. We have shown that the diameter of E-OTIS-Q n is equal to lfloor4n+4/3rfloor which is almost two-third of the diameter of OTIS-Q n
ieeexplore.ieee.org
Showing the best result for this search. See all results