Optimization algorythms for WDM optical networks

WDM光网络的优化算法

• 批准号: 250304-2007
• 负责人: Gu, Qianping
• 金额: $ 1.75万
• 依托单位: Simon Fraser University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2008
• 资助国家: 加拿大
• 起止时间: 2008-01-01 至 2009-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=394746
• 关键词: Optimization; algorythms; WDM; optical; networks

With the tremendous growth of bandwidth-intensive networking applications, the demand for bandwidth over data networks is increasing rapidly. Wavelength division multiplexing (WDM) optical networks provide promising infrastructures to meet the information networking demand and have been widely used as backbone networks in the Internet, metropolitan area networks, and high-capacity local area networks. Methodologies and technologies for WDM networks have been becoming key research areas for both academia and industry. To realize communication applications on WDM networks, algorithms are needed to decide light paths for routing and to multiplex low-rate traffic demands in the applications to share the light paths. A general goal in the study of WDM networks is to determine the resources required to achieve a given connectivity as a function of network size and functionality of network nodes. Fundamental optimization problems for this goal are to minimize the resources for realizing a given communication application and to maximize the performance of a network subject to the given resources. It is usually NP-hard to find optimal solutions for those optimization problems. Most previous algorithms for the problems are based on the integer linear programming or ad hoc heuristics and the quality of solutions is not guaranteed. It is extreme importance but challenging to design algorithms which proive solutions with guaranteed quality for those problems. With this proposed project, we use new approaches to develop efficient algorithms with guaranteed performances for the optimization problems. One novel approach to be explored is the tree/branch-decompositions based algorithms. We expect to develop efficient algorithms which provide solutions with much better guaranteed quality for the targeted optimization problems and establish new general approaches for tackling hard optimization problems in networking. The outcome of the research is expected to significantly improve the performances and provide solid foundation for the future design and operation of WDM networks. The research is also expected to train and produce a number of high qualifiied personnel for Canadian academia and industry.

随着带宽密集型网络应用的巨大增长，对数据网络带宽的需求正在迅速增长。波分复用（WDM）光网络为满足信息网络需求提供了有前途的基础设施，并已广泛用作互联网、城域网和大容量局域网的骨干网络。 WDM 网络的方法和技术已成为学术界和工业界的重点研究领域。为了在WDM网络上实现通信应用，需要算法来决定路由的光路，并复用应用中的低速率流量需求以共享光路。 WDM 网络研究的总体目标是确定实现给定连接所需的资源，作为网络规模和网络节点功能的函数。此目标的基本优化问题是最小化用于实现给定通信应用的资源并最大化受给定资源影响的网络性能。为这些优化问题找到最优解通常是 NP 困难的。以前的大多数问题算法都是基于整数线性规划或临时启发式算法，并且解决方案的质量无法保证。设计能够为这些问题提供有保证质量的解决方案的算法极其重要，但也具有挑战性。通过这个拟议的项目，我们使用新的方法来开发有效的算法，并保证优化问题的性能。一种有待探索的新颖方法是基于树/分支分解的算法。我们期望开发有效的算法，为目标优化问题提供质量更好的解决方案，并建立新的通用方法来解决网络中的硬优化问题。研究成果有望显着提高WDM网络的性能，为未来的设计和运营提供坚实的基础。该研究预计还将为加拿大学术界和工业界培训和培养一批高素质人才。