Premium
The forwarding indices of wrapped butterfly networks
Author(s) -
Hou Xinmin,
Xu JunMing,
Xu Min
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20271
Subject(s) - vertex (graph theory) , combinatorics , computer science , upper and lower bounds , graph , routing (electronic design automation) , mathematics , computer network , mathematical analysis
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom