Algorithms for Future-Proof Networks

面向未来的网络算法

• 批准号: DP240101353
• 负责人: Prof Joachim Gudmundsson
• 金额: $ 37.82万
• 依托单位: The University of Sydney
• 依托单位国家: 澳大利亚
• 项目类别: Discovery Projects
• 财政年份: 2024
• 资助国家: 澳大利亚
• 起止时间: 2024-08-01 至 2026-12-31
• 项目状态: 未结题
• 来源: https://dataportal.arc.gov.au/RGS/Web/Grants/DP240101353
• 关键词: Algorithms; Future; Proof; Networks

This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world applications, including transport networks. This project aims to give solutions with hard guarantees on the timeliness of the delivery of the people, goods, or information being transported in these networks. Expected outcomes of this project include efficient and innovative algorithms for realistic geometric graphs, which both advances the knowledge in this field of computer science and make our existing networks more reliable. This should provide significant benefits in the maintenance and utilisation of the communication and transport networks we use every day.

该项目将设计算法来构建，增强和存在障碍物的几何图形上的路线。这样的图有许多现实世界的应用，包括传输网络。该项目旨在提供解决方案，对在这些网络中运输的人员、货物或信息的及时交付提供硬保证。该项目的预期成果包括用于现实几何图形的高效和创新算法，这既推进了计算机科学这一领域的知识，又使我们现有的网络更加可靠。这将为我们日常使用的通信和运输网络的维护和使用带来巨大的好处。