Forwarding index of cube-connected cycles

Authors:
Jun Yan;Jun-Ming Xu;Chao Yang
Affiliations:
Department of Computer Science, University of Science and Technology of China, Hefei, Anhui 230027, China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China;Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 13
Cited 0

Interconnection Networks Based on a Generalization of Cube-Connected Cycles

IEEE Transactions on Computers
The forwarding index of communication networks

IEEE Transactions on Information Theory
Fault diameter of interconnection networks

Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
On forwarding indices of networks

Discrete Applied Mathematics
Complexity of the forwarding index problem

SIAM Journal on Discrete Mathematics
Edge-forwarding index of star graphs and other Cayley graphs

Discrete Applied Mathematics
Cycles in the cube-connected cycles graph

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
The proof of a conjecture of Bouabdallah and Sotteau

Networks
Forwarding indices of folded n-cubes

Discrete Applied Mathematics
The forwarding indices of augmented cubes

Information Processing Letters
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Quantified Score

Hi-index	0.04

Visualization

Abstract

For a given connected graph G of order v, a routing R in G is a set of v(v-1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Shahrokhi and Szekely [F. Shahrokhi, L.A. Szekely, Constructing integral flows in symmetric networks with application to edge forwarding index problem, Discrete Applied Mathematics 108 (2001) 175-191] obtained an asymptotic formula for the edge forwarding index of n-dimensional cube-connected cycle CCC"n as 54n^22^n(1-o(1)). This paper determines the vertex forwarding index of CCC"n as 74n^22^n(1-o(1)) asymptotically.