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）光网络提供了有前途的基础架构来满足信息网络需求，并已被广泛用作Internet，Metropolitan Area Networks和高容量的地方网络中的骨干网络。 WDM网络的方法和技术已成为学术界和行业的关键研究领域。为了实现WDM网络上的通信应用程序，需要算法来确定路由的光路和多重速率低率流量需求，以共享光路。 WDM网络研究的一般目标是确定获得给定连接性的资源，这是网络节点的网络大小和功能的函数。该目标的基本优化问题是最大程度地减少实现给定通信应用程序的资源，并最大程度地提高以给定资源为生的网络性能。通常是为这些优化问题找到最佳解决方案。大多数有关问题的算法都是基于整数线性编程或临时启发式方法，并且不能保证解决方案的质量。设计算法非常重要，但具有挑战性，这些算法可以为这些问题提供保证的质量解决方案。在这个提出的项目中，我们使用新方法来开发具有保证性能的有效算法，以解决优化问题。要探索的一种新颖的方法是基于树/分支分解的算法。我们希望开发有效的算法，为目标优化问题提供更好的保证质量，并为解决网络中的硬优化问题建立新的一般方法。预计该研究的结果将显着改善性能，并为WDM网络的未来设计和运行奠定坚实的基础。这项研究还预计将为加拿大学术界和工业培训和生产许多高素质的人员。