Forwarding index of cube-connected cycles ?
For a given connected graph G G of order v v , a routing R R in G G is a set of v(v?1) v ( v ? 1 ) elementary paths specified for every ordered pair of vertices in G G . The vertex (resp. edge) forwarding index of G G is the maximum number of paths in R R passing through any vertex (resp. edge) in G G . Shahrokhi and Szkely [F. Shahrokhi, L.A. Szkely, Constructing integral flows in symmetric networks with application to edge forwarding index problem, Discrete Applied Mathematics 108 (2001) 175191] obtained an asymptotic formula for the edge forwarding index of n n -dimensional cube-connected cycle CCCn C C C n as 5 4 n 2 2 n ( 1 ? o ( 1 ) ) . This paper determines the vertex forwarding index of CCCn C C C n as 7 4 n 2 2 n ( 1 ? o ( 1 ) ) asymptotically.
forwarding index cube-connected cycle routings