Forwarding and optical indices of 4-regular circulant networks

DOI10.1016/j.jda.2015.09.002zbMath1343.05141arXiv1405.6848OpenAlexW3101700496MaRDI QIDQ891819

Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou

Publication date: 17 November 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.6848

zbMATH Keywords

routing and wavelength assignmentcirculant networksedge-forwarding indexarc-forwarding indexoptical index

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

The undirected optical indices of complete \(m\)-ary trees ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal routing in double loop networks
• Forwarding and optical indices of a graph
• Efficient algorithms for wavelength assignment on trees of rings
• The edge-forwarding index or orbital regular graphs
• Multiplicative circulant networks. Topological properties and communication algorithms
• On orbital regular graphs and Frobenius graphs
• A survey on Knödel graphs.
• Efficient collective communciation in optical networks
• On forwarding indices of networks
• A survey on multi-loop networks.
• Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• The forwarding indices of graphs - a survey
• Gossiping and routing in undirected triple-loop networks
• Computing the Diameter in Multiple-Loop Networks
• All-to-all communication for some wavelength-routed all-optical networks
• A 2-approximation algorithm for path coloring on a restricted class of trees of rings
• Colouring paths in directed symmetric trees with applications to WDM routing
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• LATIN 2004: Theoretical Informatics
• All-to-all wavelength-routing in all-optical compound networks
• A complementary survey on double-loop networks