SING: Efficient Survivable Routing in Next Generation Networks

SING：下一代网络中的高效生存路由

• 批准号: 0830739
• 负责人: Guoliang Xue
• 金额: --
• 依托单位: Arizona State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2011-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0830739&HistoricalAwards=false
• 关键词: SING; Efficient; Survivable; Routing; Next

This research involves the design and analysis of efficient algorithms for survivable routing in next generation networks. Current research in this area are either heuristic based that lacks performance guarantee, or computationally intensive that lacks scalability. The PI concentrates on efficient survivable routing in a very important class of network topologies known as minimum isolated failure immune networks. Efficient algorithms will be designed for survivable routing in such networks. This transformative research will provide a solid theoretical foundation for survivable routing in next generation networks.The INTELLECTUAL MERIT of this research lies in exploring a new dimension of research in survivable routing in next generation networks, using combinatorial optimization and algorithms as tools of investigation.The research will extend the frontiers of knowledge in survivable networks in the following directions: (1) improving heuristic based or integer linear programming based algorithms for survivable lightpath routing in mesh network to polynomial time optimal algorithms for survivable lightpath routing in minimum isolated failure immune networks; (2) extending heuristic based QoS-aware redundant tree schemes to QoS-aware redundant tree schemes with provably good performance; (3) extending heuristic based double-failure protection to guaranteed double-failure protection.In terms of BROADER IMPACTS, this research will lead to (i) integration of research into educational experiences of students at the undergraduate and graduate levels, especially students from underrepresented groups;(ii) unification of seemingly diverse disciplines which have common underlying mathematical foundation; (iii) dissemination of research results through presentation and publication in high-quality conferences and journals.

这项研究涉及下一代网络中可生存路由的有效算法的设计和分析。目前在该领域的研究要么是基于启发式的，因此缺乏性能保证，要么是缺乏可扩展性的计算密集型。 PI集中在一类非常重要的网络拓扑中的有效生存路由，称为最小隔离失败免疫网络。有效的算法将设计用于此类网络中的可生存路由。这项变革性研究将为下一代网络中的可生存路线提供稳固的理论基础。这项研究的智力优点在于使用组合优化和算法作为调查工具，探索下一代网络中生存的可生存路线研究的新维度。在网格网络中可生存的LightPath路由到多项式时间的最佳算法，用于生存的LightPath路由，以最小隔离的失败免疫网络； （2）将基于启发式的QoS感知的冗余树方案扩展到QoS感知的冗余树方案，其性能良好； （3）扩展基于启发式的双重失败保护以保证双重失败保护。在更广泛的影响方面，这项研究将导致（i）将研究在本科生和研究生级别的学生的教育经验中融为一体，尤其是来自代表性不足的群体的学生；（ii）（ii）统一的，这些统一的统一是多元化的群众，这些统一是普通的，这些统一的基础是数学基础； （iii）通过在高质量会议和期刊上的介绍和出版来传播研究结果。