Interconnection Network Routing and Graph Symmetry

高效的路由方案对两者都至关重要 传统和光互连网络。实现高 为了提高性能，建议对网络进行建模的图是顶点传递的，这意味着从任何顶点看它都是一样的。在这个项目中，我们将进行一个系统的研究，为这样的网络的路由问题。我们将重点讨论顶点传递性和其他一些对称性对路由方案效率的影响，这些路由方案由顶点和边的带宽以及光网络中所需的最小波长数来衡量。

Efficient routing schemes are of fundamental importance to both traditional and optical interconnection networks. To achieve high performance it is recommended that the graph modelling the network be vertex-transitive, meaning that it looks the same viewed from any vertex. In this project we will conduct a systematic study of the routing problem for such networks. We will focus on the effect of vertex-transitivity and some other symmetry properties on the efficiency of routing schemes measured by the vertex- and edge-congestions, and the minimum number of wavelengths needed in optical networks.