Discovery Projects - Grant ID: DP0344803

Funding Activity

Website
http://dataportal.arc.gov.au/NCGP/Web/Grant/Grant/DP0344803

Funding Status
Closed

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

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.

Funded Activity Details

Start Date: 01-01-2003

End Date: 01-05-2004

Funding Scheme: Discovery Projects

Funding Amount: $253,035.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Mathematical Logic, Set Theory, Lattices And Combinatorics | Pure Mathematics | Discrete Mathematics | Computer Communications Networks

ANZSRC Socio-Economic Objective (SEO)

Telecommunications | Mathematical sciences |

Other Keywords

Computer Communications Networks | Discrete Mathematics | Mathematical Logic, Set Theory, Lattices And Combinatorics | Mathematical sciences | Pure Mathematics | Telecommunications

Related Links