Interconnection Network Routing and Graph Symmetry

互连网络路由和图对称

• 批准号: DP0344803
• 负责人: Prof Sanming Zhou
• 金额: $ 7.53万
• 依托单位: The University of Melbourne
• 依托单位国家: 澳大利亚
• 项目类别: Discovery Projects
• 财政年份: 2003
• 资助国家: 澳大利亚
• 起止时间: 2003-01-01 至 2004-05-01
• 项目状态: 已结题
• 来源: https://dataportal.arc.gov.au/RGS/Web/Grants/DP0344803
• 关键词: Interconnection; Network; Routing; 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.

有效的路由方案对两者都至关重要