The forwarding indices of wrapped butterfly networks

Let G be a connected graph. A routing in G is a set of fixed paths for all ordered pairs of vertices in G. The forwarding index of G is the minimum of the largest number of paths specified by a routing passing through any vertex of G taken over all routings in G. This article investigates the forwarding index of a wrapped butterfly graph, determines the exact value for the directed case, and gives an upper bound for undirected case. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009

[1]  Jun-Ming Xu,et al.  FORWARDING INDICES OF CARTESIAN PRODUCT GRAPHS , 2006 .

[2]  Jun-Ming Xu,et al.  The forwarding indices of augmented cubes , 2007, Inf. Process. Lett..

[3]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

[4]  Farhad Shahrokhi,et al.  Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem , 2001, Discret. Appl. Math..

[5]  Miguel Angel Fiol,et al.  The spectra of wrapped butterfly digraphs , 2003, Networks.

[6]  Gérard Gimenez,et al.  Genetic Programming to Design Communication Algorithms for Parallel Architectures , 1998, Parallel Process. Lett..

[7]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[8]  Stéphane Pérennes,et al.  Hamilton Circuits in the Directed Wrapped Butterfly Network , 1998, Discret. Appl. Math..

[9]  Bruce M. Maggs,et al.  Simple Algorithms for Routing on Butterfly Networks with Bounded Queues , 1999, SIAM J. Comput..

[10]  Ralf Klasing,et al.  Broadcasting in Butterfly and deBruijn Networks , 1994, Discret. Appl. Math..

[11]  Jun-Ming Xu,et al.  Forwarding indices of folded n-cubes , 2005, Discret. Appl. Math..

[12]  Stephen A. Wong.  Hamilton cycles and paths in butterfly graphs , 1995, Networks.

[13]  Bruce M. Maggs,et al.  Improved Routing and Sorting on Multibutterflies , 1997, STOC '97.

[14]  Fan Chung Graham,et al.  The forwarding index of communication networks , 1987, IEEE Trans. Inf. Theory.

[15]  Nobuhiko Koike,et al.  Parallel programming on Cenju : a multiprocessor system for modular circuit simulation , 1990 .

[16]  Gen-Huey Chen,et al.  Cycles in butterfly graphs , 2000 .

[17]  Jun Yan,et al.  Forwarding index of cube-connected cycles , 2009, Discret. Appl. Math..

[18]  André Raspaud,et al.  Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph , 1994, Inf. Process. Lett..

[19]  Robert Elsässer,et al.  Scalable Sparse Topologies with Small Spectrum , 2001, STACS.

[20]  Jaroslav Opatrny,et al.  Forwarding indices of consistent routings and their complexity , 1994, Networks.

[21]  Richard Cole,et al.  Routing on butterfly networks with random faults , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[22]  Complexity of the Forwarding Index Problem , 1993, SIAM J. Discret. Math..

[23]  Stéphane Pérennes,et al.  Hamilton Cycle Decomposition of the Butterfly Network , 1998, Parallel Process. Lett..

[24]  Wilfried Oed.  Cray Y-MP C90: System features and early benchmark results (Short communication) , 1992, Parallel Comput..