优化波分复用光网络系统设计的方法研究
|
摘要
随着光通信技术的快速发展,光纤通信已从单纯的传输技术逐步演化为重要的组网手段。以波长路由为基础的光网络设计,对于提高设备利用率,降低网络建设成本有着至关重要的意义。本文研究了优化光网络系统设计的方法,主要有以下贡献:
1).在分路由和单一路由策略下的流量路由优化问题利用势函数将网络拥塞优化目标转换为连续可微的数学表达式,使得目标函数能够反映整个网络中各链路负载状况。讨论了如何调整势函数构造参数,控制不同负载链路在目标函数中的权重表达,缩短算法的收敛时间。
根据一定的数学分析,利用微分方法设计了以当前解为基础的最佳优化操作。提出了虚拟链路利用率λe’的概念,用来松弛可行解的限制条件,动态调节λe’可以灵活适配流量需求矩阵和链路带宽设定之间的差异,并使得搜索算法可以在更大的广度上选择初始方案。
2).光通道路由优化问题
对光通道路由优化进行了详细的数学分析,将其分解为特定边权值下的最短路径问题和可控规模的线性规划模型,在此基础上,设计了一个基于当前解邻域变换的快速搜索算法。
考虑波长一致性限制条件,将RWA问题转换为更大规模拓扑上的单纯的通道路由问题,使得以降低网络拥塞为目标的光通道优化路由算法可以很好的应用于RWA问题的求解。
3).在逻辑拓扑设计方面
设计了一个遗传算法来优化设计,同其他此类方法相比,该算法不同之处在于以高质量的初始解群为基础,通过在遗传操作中引入较多的启发规则,加快“劣质”基因的淘汰,提高算法的收敛速度。
为了在逻辑网络设计中体现物理光网络的影响,提出了源宿节点对之间光通道友好度ξij的概念,并利用公式“rs′d =rsd+β?ξsd”生成加权后的流量矩阵R,有效避免了在优化算法中引入新的独立参数。
4).在物理光网络设计中,以前述高效的路由方案求解算法为基础,根据对网络拓扑的快速评估,提出了一个由高连接度的基准拓扑逐步进化为目的拓扑的物理光网络设计方法。通过基准拓扑确定、冗余链路删除等规则的设置,可以在求解过程中方便的引入工程设计经验,引导算法进行高效搜索,避免考察工程上“无效(或低效)”的解空间。
The rapid development in WDM is making the transformation of fiber communication from a transmission method to the networking technology. The optimal design of optical networks, which are based on lightpaths routing, is becoming a very important issue to Internet Service Providers. In this paper, the methods for optical network designing are researched, the main contributions are listed below:
1). The problems of traffic optimal bifurcated and non-bifurcated routing
Through potential function, the objective - minimization of network congestion - is converted to a continue, differential expression in which loads of all links in the network are considered. We also present the way to tune potential construction arguments to control different loaded links’“voice”in the objective function and accelerate the convergence process. Based on the flow deviation method, optimal operations, which are the main part of the optimal processes, are designed for the two traffic routing problems.
The virtual bandwidth usage is presented to loose the constraints for valid solutions and smooth the difference between requirement matrix and link bandwidth.
2). The problem of lightpaths optimal routing
Lightpaths optimal routing is analyzed mathematically and divided into two sub-problems, shortest path problem and small-scale linear programming model. A bifurcated routing algorithm is developed and the sub-problems are solved to find an optimal solution in minute-scale running time.
Considering the wavelength continuity constraint, the RWA (Routing and Wavelength Assignment) problem is transformed into lightpaths routing problem over a larger-scale network that consist of many copies of the original network. So, it is natural and reasonable to apply lightpaths optimal routing algorithm to RWA problem.
3). Logical topology design
We present a genetic algorithm to realize the optimization. The algorithm, different from other similar methods, gets excellent convergence characteristic from high-quality initial population, and more heuristic genetic operators that quicken the elimination of“bad”genes. To make the logical topology design to take the consideration of physical network, we present lightpath liabilityξij, which is incorporated into requirement matrix using equation“rs′d =rsd+β?ξsd”.
1).在分路由和单一路由策略下的流量路由优化问题利用势函数将网络拥塞优化目标转换为连续可微的数学表达式,使得目标函数能够反映整个网络中各链路负载状况。讨论了如何调整势函数构造参数,控制不同负载链路在目标函数中的权重表达,缩短算法的收敛时间。
根据一定的数学分析,利用微分方法设计了以当前解为基础的最佳优化操作。提出了虚拟链路利用率λe’的概念,用来松弛可行解的限制条件,动态调节λe’可以灵活适配流量需求矩阵和链路带宽设定之间的差异,并使得搜索算法可以在更大的广度上选择初始方案。
2).光通道路由优化问题
对光通道路由优化进行了详细的数学分析,将其分解为特定边权值下的最短路径问题和可控规模的线性规划模型,在此基础上,设计了一个基于当前解邻域变换的快速搜索算法。
考虑波长一致性限制条件,将RWA问题转换为更大规模拓扑上的单纯的通道路由问题,使得以降低网络拥塞为目标的光通道优化路由算法可以很好的应用于RWA问题的求解。
3).在逻辑拓扑设计方面
设计了一个遗传算法来优化设计,同其他此类方法相比,该算法不同之处在于以高质量的初始解群为基础,通过在遗传操作中引入较多的启发规则,加快“劣质”基因的淘汰,提高算法的收敛速度。
为了在逻辑网络设计中体现物理光网络的影响,提出了源宿节点对之间光通道友好度ξij的概念,并利用公式“rs′d =rsd+β?ξsd”生成加权后的流量矩阵R,有效避免了在优化算法中引入新的独立参数。
4).在物理光网络设计中,以前述高效的路由方案求解算法为基础,根据对网络拓扑的快速评估,提出了一个由高连接度的基准拓扑逐步进化为目的拓扑的物理光网络设计方法。通过基准拓扑确定、冗余链路删除等规则的设置,可以在求解过程中方便的引入工程设计经验,引导算法进行高效搜索,避免考察工程上“无效(或低效)”的解空间。
The rapid development in WDM is making the transformation of fiber communication from a transmission method to the networking technology. The optimal design of optical networks, which are based on lightpaths routing, is becoming a very important issue to Internet Service Providers. In this paper, the methods for optical network designing are researched, the main contributions are listed below:
1). The problems of traffic optimal bifurcated and non-bifurcated routing
Through potential function, the objective - minimization of network congestion - is converted to a continue, differential expression in which loads of all links in the network are considered. We also present the way to tune potential construction arguments to control different loaded links’“voice”in the objective function and accelerate the convergence process. Based on the flow deviation method, optimal operations, which are the main part of the optimal processes, are designed for the two traffic routing problems.
The virtual bandwidth usage is presented to loose the constraints for valid solutions and smooth the difference between requirement matrix and link bandwidth.
2). The problem of lightpaths optimal routing
Lightpaths optimal routing is analyzed mathematically and divided into two sub-problems, shortest path problem and small-scale linear programming model. A bifurcated routing algorithm is developed and the sub-problems are solved to find an optimal solution in minute-scale running time.
Considering the wavelength continuity constraint, the RWA (Routing and Wavelength Assignment) problem is transformed into lightpaths routing problem over a larger-scale network that consist of many copies of the original network. So, it is natural and reasonable to apply lightpaths optimal routing algorithm to RWA problem.
3). Logical topology design
We present a genetic algorithm to realize the optimization. The algorithm, different from other similar methods, gets excellent convergence characteristic from high-quality initial population, and more heuristic genetic operators that quicken the elimination of“bad”genes. To make the logical topology design to take the consideration of physical network, we present lightpath liabilityξij, which is incorporated into requirement matrix using equation“rs′d =rsd+β?ξsd”.
引文
[陈 96] 陈国良, 王熙法, 庄镇泉等. 遗传算法及其应用. 人民邮电出版社, 1996.
[龚 02] 龚倩, 徐荣, 张民等. 光网络的组网与优化设计. 北京邮电大学出版社, 2002.
[潘 98] 潘正君, 康立山, 陈毓屏. 演化计算. 清华大学出版社, 1998.
[张 99] 张成良, 韦乐平. 光通信技术发展的新趋势. 电信科学, 1999, No.6:1-4.
[张 03a] 张颢, 王行刚. 基于快速路由优化的光网络物理拓扑设计, 中科院计算所研究报告, 2003
[张 03b] 张颢, 王行刚. 微分方法在路由优化中的应用研究. 中国科学院计算所, 2002. 【3.4】 大部分主干网的网络密度为 0.3
[Ahu97] Ahuja, R. K., Orlin, J.B. Developing fitter genetic algorithms. INFORMS Journal of Computing, 1997, Vol. 9, No.5:251-253.
[AM98] A. Mokhtar, M. Azizoglu. Adaptive wavelength routing in all optical netowrks. IEEE/ACM Transactions on Networking, April 1998, 6(2):197-206.
[BD01] B. Doshi, O. Hauser, M .Kodialam, et al. Ultra-longreach Systems, Optical Transparency and Networks. Optical Fiber Commun. Conf. (OFC. ‘01) Tech. Digest, Anaheim, Calif., Mar. 2001:17-21.
[BD99] B. Doshi, S. Dravida, P. Harshavardhana, O. Hauser, Y. Wang. Optical Network Design and Restoration. Bell Labs Technical Journal, Jan-March, 1999.
[BER87] BERTSEKAS D.P., GALLAGER R.G. Data Networks. Prentice-Hall, 1987.
[BR00] B. Rajagopalan et al. IP over Optical Networks: A Framework. IETF Internet draft, June 2000; work in progress.
[BR98] B. Ramamurty, B. Mukherjee. Wavelength conversion in WDM networking. IEEE Journal Selected Areas in Communications, September 1998, 16(7):1061-1073.
[BT95] B. T. Doshi, S. Dravida, P. Harshavardhana. Overview of INDT: A New Tool for Next-Generation Network Design. Proc. IEEE Global Telecommun. Conf. (GLOBECOM ’95), Nov. 1995, Vol.3:1942–1946.
[CA01] C. Assi, M. Ali, R. Kurtz, et al. Optical networking and realtime provisioning: An integrated vision for the next generation internet. IEEE Networks, July/August 2001, 15(4):36–45.
[CB01] C.Bungarzeanu, J.Ehrensberger, D.Tarongi. Planning Tool for Wave-length Assignment in Static WDM Transport Networks. Proc. of IEEE International Conference on Telecom-munications (ICT2001), Romania, Bucharest, June 2001:4-7.
[CHC00] CH Chu, G. Premkumar, H. Chou. Digital data networks design using genetic algorithms. European Journal of Operational Research, 2000, 127:140–158.
[CHI94] CHIFFLET J., MAHEY P., REYNIER V. Proximal decomposition for multicommodity flow problems with convex costs. Telecommunication System3, 1994.
[CNC] 中国网通公司主页,http://www.cnc.net.cn
[DA99] D. Awduche et al. Multi-Protocol Lambda Switching: Combining MPLS Traffic Engineering Control With Optical Crossconnects. IETF Internet draft, Nov. 1999; work in progress.
[DB96] D. Banerjee, B. Mukherjee. A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal Selected Areas in Communications, 1996, 14(5): 903-908.
[DB98] Doshi B., P. Harshavardhana. Broadband Network Infrastructure of the Future: Roles of Network Design Tools in Technology Deployment Strategies. IEEE Communications Magazine, 1998:60–71.
[DF00] D. Freeland et al. Considerations on the development of an Optical Control Plane. Internet Draft, draft-freelandoctrl-cons-01.txt, February 2000
[DP00a] D. Pendarakis, B. Rajagopalan, D. Saha, R. Ramamoorthy. IP over Optical Networks: Architectural Aspects. IEEE Communications Magazine, September 2000:94-102.
[DP00b] D. Pendarakis, B. Rajagopalan, D. Saha. Routing Information Exchange in Optical Networks. Internet Draft, draft-prs-optical-routing-01.txt, November 2000.
[DR00] DIESTEL R. Graph Theory, E. Edition 2000. Springer-Verlag New York 1997,2000.
[DUT00] DUTTA R. and ROUSKAS G.N. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, Jan 2000,1(1):73-89.
[EK98] E. Karasan, E. Ayanoglu. Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks. IEEE/ACM Transactions on Networking, April 1998, 6(2):186-196.
[EL00] E.Leonardi, et al. Algorithms for the Logical Topology Design in WDM All-Optical Networks. Optical Networks Magazine, January 2000:35-46.
[EM99] E. Modiano. WDM-Based Packet Networks. IEEE Communications Magazine, March 1999:130-135.
[Evr02] Evripidis Bampis, George N. Rouskas. The Scheduling and Wavelength Assignment Problem in Optical WDM Networks, IEEE JOURNAL OF LIGHTWAVE TECHNOLOGY, MAY 2002, VOL.20, NO.5.
[FC99] F. Callegati, H. C. Cankaya, Y. Xiong, M. Vandenhoute. Design issues of optical IP routers for Internet backbone applications. IEEE Comm. Magazine, December 1999:124-128.
[FLE00] FLEISCHER L. Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Disc. Math. 3(2000) 505-520.
[For03] Fortz B., Soriano P., Wynants C., A Tabu Search Algorithm for Self-Healing Ring Network Design European Journal of Operational Research, 2003,151(2):280-295.
[FRA71] FRATTA L., GERLA M., KLEINROCK L. The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks 3(1971),97-133.
[GKC00] G.K. Chung, K.I. Sato, D. K. Hunter (Eds.). Special issue on optical networks. Journal of Lightwave Technology, December 2000, 18(12).
[GL01] G. Liu, K. G. Ramakrishnan. A Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints. Proc. IEEE Conf. On Computer Commun. (INFOCOM ’01), Anchorage, Alas., Apr. 2001:22-26.
[GOF97] GOFFIN J.L., GONDZIO J., SARKISSIAN R. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Mathematical Programming, 1997
[HZ00] H. Zang, J. P. Jue, B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength routed optical WDM networks. Optical Networks, January 2000, 1(1):47-60.
[IS01] I. Saniee, D. Davis, K. Kumaran, et al. SPIDER: A Simple and Flexible Tool for Design and Provisioning of Protected Lightpaths in Optical Networks. Bell Labs Tech. J., Jan.-June. 2001, Vol.6, No.1:82-97.
[JA99] J. Anderson et al. Protocols and architectures for IP optical networking. Bell Labs Technical Journal, January-March 1999:105-124.
[JS01] J. Strand, A. L. Chiu, R. Tkach. Issues for routing in the optical layer. IEEE Communications, February 2001:81-96.
[JY99] J.Yates, J.Lacey, M.Rumsewicz. Wavelength Converters in Dynamically Reconfigurable WDM Networks. IEEE Communications Surveys, 2nd quarter issue,1999
[Ker97] Kershenbaum A. When Genetic Algorithms Work Best. INFORMS Journal of Computing, 1997, Vol.9, No.3:254-255.
[Kot96] Kotelly G. Worldwide fiber-optic markets to expand unabated. IEEE/OSA J 一 LT, Dec. 1996,13: 6-8.
[Lee94] Lee Y., Lu L., Qiu Y., F. Glover. Strong formulations and cutting planes for designing digital data networks. Telecommunication Systems, 1994, Vol.2:261-274.
[Lee96] Lee Y., Chiu S. Y., Ryan J. A branch and cut algorithm for Steiner tree-star problem. INFORMS Journal on Computing, 1996, Vol.8, No.3:100-120.
[MP97] M. Pioró. Simulation Approach to the Optimisation of Integral Flow Networks. International Conference on Optimization and Simulation, Singapore, September 1997.
[MUK96] MUKHERJEE B., RAMAMURTHY S., BANERJEE D. Some principles for designing a wide-area optical network. IEEE/ACM Trans. Networking, Oct 1996,4(5):684-696.
[MY01] M. Yagiura, T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan, 2001, 32(3):33-55.
[NG00] N. Ghani. Lambda labeling: A framework for IPoverWDM using MPLS. Optical Networks, April 2000, 1(2):45–58.
[OG00] O. Gerstel, B. Li, A. McGuire, etc. Special issue on protocols and architectures for next generation optical WDM networks. IEEE Journal Selected Areas in Communications, 2000, 18(10).
[OG98] O. Gerstel, P. Lin, G. Sasaki. “Wavelength assignment in WDM rings to minimize system cost instead of number of wavelengths,” in Proceedings, INFOCOM, 1998.
[Poo95] Poon P. W., Carter J. N. Genetic algorithm crossover operators for ordering applications. Computers and Operations Research, 1995, Vol.22, No.1:135-147.
[Rav02] Ravindra K. Ahuja, ?zlem Ergun, James B. Orlin, etc. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 2002, 123(1-3): 75-102.
[RD00] R. Dutta, G.N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, 2000, 1(1): 73-89.
[RMK98] R.M.Krishnaswamy, K.N.Sivarajan. Design of Logical Topologies: a Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers. IEEE INFOCOM, 1998.
[SC00] S. Chaudhuri, G. Hjalmtysson, J. Yates. Control of Lightpaths in an Optical Network. Internet Draft, draftchaudhuri-ip-olxc-control-00.txt, February 2000.
[SCH97] SCHRAGE L. Optimization Modeling with LINDO, 5th. ed. Belmont, CA: Duxbury Press, 1997.
[SS01] S. Sengupta, R. Ramamurthy. From network design to dynamic provisioning and restoration in optical crossconnect mesh networks: An architectural and algorithmic overview. IEEE Networks, July/August 2001, 15(4):46-54.
[SU03] S. Uhlig. Conservative Cascades: an Invariant of Internet Traffic. In Proc. of the 2003 IEEE International Symposium on Signal Processing and Information Technology, Darmstadt, Germany, December 2003.
[Tan95] Tan T. K., Pollard J. K. Determination of minimum number of wavelength required for alloptical WDM networks using graph coloring. Electronic Letters, 1995:1895-1897.
[TAN96] TANENBAUM Andrew S. Computer Networks, 3rd. ed. Prentice Hall, 1996.
[THO02] THOMADSEN T., CLAUSEN J. Hierarchical Network Design Using Simulated Annealing. Technical report, IMM-2002-14 Informatics and Mathematical Modelling, September 2002.
[TR01] Thomas Reiter, Philipp Bertschi. A planning tool for PLC networks. Proc. of Networks and Optical Communications (NOC2001), Ipswich (UK), June 2001:26-29.
[TT02] T. Thomadsen, J. Clausen, Hierarchical Network Design Using Simulated Annealing, Informatics and Mathematical Modelling, Technical University of Denmark, DTU, 2002.
[Wei99] Wei L, Chen Y and Wong G G. The evolution of China's optical fiber networks.Bell Labs Technical Journal, Jan-Mar. 1999, pp: 125-143.
[WDM01] WDMNetDesign - A Tool to Design and Evaluate WDM Networks. White Paper, http://www.comsof.com, Comsof, 2001.
[Yuf02] Yufeng Xin. Topology Design of Large-Scale Optical Networks. PhD thesis, NCSU, Raleigh, NC, 2002.
[YZ00] Y. Zhu, G. N. Rouskas, H. G. Perros. A comparison of allocation policies in wavelength routing networks. Photonic Network Communications, August 2000, 2(3):265-293.
[ZZ01] Z. Zhang, J. Fu, D. Guo, et al. Lightpath routing for intelligent optical networks. IEEE Networks, July/August 2001, 15(4):28–35.
[ZZ95] Z. Zhang, A. Acampora. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse. IEEE/ACM Transactions on Networking, June 1995, 3(3):281-288.
[龚 02] 龚倩, 徐荣, 张民等. 光网络的组网与优化设计. 北京邮电大学出版社, 2002.
[潘 98] 潘正君, 康立山, 陈毓屏. 演化计算. 清华大学出版社, 1998.
[张 99] 张成良, 韦乐平. 光通信技术发展的新趋势. 电信科学, 1999, No.6:1-4.
[张 03a] 张颢, 王行刚. 基于快速路由优化的光网络物理拓扑设计, 中科院计算所研究报告, 2003
[张 03b] 张颢, 王行刚. 微分方法在路由优化中的应用研究. 中国科学院计算所, 2002. 【3.4】 大部分主干网的网络密度为 0.3
[Ahu97] Ahuja, R. K., Orlin, J.B. Developing fitter genetic algorithms. INFORMS Journal of Computing, 1997, Vol. 9, No.5:251-253.
[AM98] A. Mokhtar, M. Azizoglu. Adaptive wavelength routing in all optical netowrks. IEEE/ACM Transactions on Networking, April 1998, 6(2):197-206.
[BD01] B. Doshi, O. Hauser, M .Kodialam, et al. Ultra-longreach Systems, Optical Transparency and Networks. Optical Fiber Commun. Conf. (OFC. ‘01) Tech. Digest, Anaheim, Calif., Mar. 2001:17-21.
[BD99] B. Doshi, S. Dravida, P. Harshavardhana, O. Hauser, Y. Wang. Optical Network Design and Restoration. Bell Labs Technical Journal, Jan-March, 1999.
[BER87] BERTSEKAS D.P., GALLAGER R.G. Data Networks. Prentice-Hall, 1987.
[BR00] B. Rajagopalan et al. IP over Optical Networks: A Framework. IETF Internet draft, June 2000; work in progress.
[BR98] B. Ramamurty, B. Mukherjee. Wavelength conversion in WDM networking. IEEE Journal Selected Areas in Communications, September 1998, 16(7):1061-1073.
[BT95] B. T. Doshi, S. Dravida, P. Harshavardhana. Overview of INDT: A New Tool for Next-Generation Network Design. Proc. IEEE Global Telecommun. Conf. (GLOBECOM ’95), Nov. 1995, Vol.3:1942–1946.
[CA01] C. Assi, M. Ali, R. Kurtz, et al. Optical networking and realtime provisioning: An integrated vision for the next generation internet. IEEE Networks, July/August 2001, 15(4):36–45.
[CB01] C.Bungarzeanu, J.Ehrensberger, D.Tarongi. Planning Tool for Wave-length Assignment in Static WDM Transport Networks. Proc. of IEEE International Conference on Telecom-munications (ICT2001), Romania, Bucharest, June 2001:4-7.
[CHC00] CH Chu, G. Premkumar, H. Chou. Digital data networks design using genetic algorithms. European Journal of Operational Research, 2000, 127:140–158.
[CHI94] CHIFFLET J., MAHEY P., REYNIER V. Proximal decomposition for multicommodity flow problems with convex costs. Telecommunication System3, 1994.
[CNC] 中国网通公司主页,http://www.cnc.net.cn
[DA99] D. Awduche et al. Multi-Protocol Lambda Switching: Combining MPLS Traffic Engineering Control With Optical Crossconnects. IETF Internet draft, Nov. 1999; work in progress.
[DB96] D. Banerjee, B. Mukherjee. A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal Selected Areas in Communications, 1996, 14(5): 903-908.
[DB98] Doshi B., P. Harshavardhana. Broadband Network Infrastructure of the Future: Roles of Network Design Tools in Technology Deployment Strategies. IEEE Communications Magazine, 1998:60–71.
[DF00] D. Freeland et al. Considerations on the development of an Optical Control Plane. Internet Draft, draft-freelandoctrl-cons-01.txt, February 2000
[DP00a] D. Pendarakis, B. Rajagopalan, D. Saha, R. Ramamoorthy. IP over Optical Networks: Architectural Aspects. IEEE Communications Magazine, September 2000:94-102.
[DP00b] D. Pendarakis, B. Rajagopalan, D. Saha. Routing Information Exchange in Optical Networks. Internet Draft, draft-prs-optical-routing-01.txt, November 2000.
[DR00] DIESTEL R. Graph Theory, E. Edition 2000. Springer-Verlag New York 1997,2000.
[DUT00] DUTTA R. and ROUSKAS G.N. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, Jan 2000,1(1):73-89.
[EK98] E. Karasan, E. Ayanoglu. Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks. IEEE/ACM Transactions on Networking, April 1998, 6(2):186-196.
[EL00] E.Leonardi, et al. Algorithms for the Logical Topology Design in WDM All-Optical Networks. Optical Networks Magazine, January 2000:35-46.
[EM99] E. Modiano. WDM-Based Packet Networks. IEEE Communications Magazine, March 1999:130-135.
[Evr02] Evripidis Bampis, George N. Rouskas. The Scheduling and Wavelength Assignment Problem in Optical WDM Networks, IEEE JOURNAL OF LIGHTWAVE TECHNOLOGY, MAY 2002, VOL.20, NO.5.
[FC99] F. Callegati, H. C. Cankaya, Y. Xiong, M. Vandenhoute. Design issues of optical IP routers for Internet backbone applications. IEEE Comm. Magazine, December 1999:124-128.
[FLE00] FLEISCHER L. Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Disc. Math. 3(2000) 505-520.
[For03] Fortz B., Soriano P., Wynants C., A Tabu Search Algorithm for Self-Healing Ring Network Design European Journal of Operational Research, 2003,151(2):280-295.
[FRA71] FRATTA L., GERLA M., KLEINROCK L. The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks 3(1971),97-133.
[GKC00] G.K. Chung, K.I. Sato, D. K. Hunter (Eds.). Special issue on optical networks. Journal of Lightwave Technology, December 2000, 18(12).
[GL01] G. Liu, K. G. Ramakrishnan. A Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints. Proc. IEEE Conf. On Computer Commun. (INFOCOM ’01), Anchorage, Alas., Apr. 2001:22-26.
[GOF97] GOFFIN J.L., GONDZIO J., SARKISSIAN R. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Mathematical Programming, 1997
[HZ00] H. Zang, J. P. Jue, B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength routed optical WDM networks. Optical Networks, January 2000, 1(1):47-60.
[IS01] I. Saniee, D. Davis, K. Kumaran, et al. SPIDER: A Simple and Flexible Tool for Design and Provisioning of Protected Lightpaths in Optical Networks. Bell Labs Tech. J., Jan.-June. 2001, Vol.6, No.1:82-97.
[JA99] J. Anderson et al. Protocols and architectures for IP optical networking. Bell Labs Technical Journal, January-March 1999:105-124.
[JS01] J. Strand, A. L. Chiu, R. Tkach. Issues for routing in the optical layer. IEEE Communications, February 2001:81-96.
[JY99] J.Yates, J.Lacey, M.Rumsewicz. Wavelength Converters in Dynamically Reconfigurable WDM Networks. IEEE Communications Surveys, 2nd quarter issue,1999
[Ker97] Kershenbaum A. When Genetic Algorithms Work Best. INFORMS Journal of Computing, 1997, Vol.9, No.3:254-255.
[Kot96] Kotelly G. Worldwide fiber-optic markets to expand unabated. IEEE/OSA J 一 LT, Dec. 1996,13: 6-8.
[Lee94] Lee Y., Lu L., Qiu Y., F. Glover. Strong formulations and cutting planes for designing digital data networks. Telecommunication Systems, 1994, Vol.2:261-274.
[Lee96] Lee Y., Chiu S. Y., Ryan J. A branch and cut algorithm for Steiner tree-star problem. INFORMS Journal on Computing, 1996, Vol.8, No.3:100-120.
[MP97] M. Pioró. Simulation Approach to the Optimisation of Integral Flow Networks. International Conference on Optimization and Simulation, Singapore, September 1997.
[MUK96] MUKHERJEE B., RAMAMURTHY S., BANERJEE D. Some principles for designing a wide-area optical network. IEEE/ACM Trans. Networking, Oct 1996,4(5):684-696.
[MY01] M. Yagiura, T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan, 2001, 32(3):33-55.
[NG00] N. Ghani. Lambda labeling: A framework for IPoverWDM using MPLS. Optical Networks, April 2000, 1(2):45–58.
[OG00] O. Gerstel, B. Li, A. McGuire, etc. Special issue on protocols and architectures for next generation optical WDM networks. IEEE Journal Selected Areas in Communications, 2000, 18(10).
[OG98] O. Gerstel, P. Lin, G. Sasaki. “Wavelength assignment in WDM rings to minimize system cost instead of number of wavelengths,” in Proceedings, INFOCOM, 1998.
[Poo95] Poon P. W., Carter J. N. Genetic algorithm crossover operators for ordering applications. Computers and Operations Research, 1995, Vol.22, No.1:135-147.
[Rav02] Ravindra K. Ahuja, ?zlem Ergun, James B. Orlin, etc. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 2002, 123(1-3): 75-102.
[RD00] R. Dutta, G.N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, 2000, 1(1): 73-89.
[RMK98] R.M.Krishnaswamy, K.N.Sivarajan. Design of Logical Topologies: a Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers. IEEE INFOCOM, 1998.
[SC00] S. Chaudhuri, G. Hjalmtysson, J. Yates. Control of Lightpaths in an Optical Network. Internet Draft, draftchaudhuri-ip-olxc-control-00.txt, February 2000.
[SCH97] SCHRAGE L. Optimization Modeling with LINDO, 5th. ed. Belmont, CA: Duxbury Press, 1997.
[SS01] S. Sengupta, R. Ramamurthy. From network design to dynamic provisioning and restoration in optical crossconnect mesh networks: An architectural and algorithmic overview. IEEE Networks, July/August 2001, 15(4):46-54.
[SU03] S. Uhlig. Conservative Cascades: an Invariant of Internet Traffic. In Proc. of the 2003 IEEE International Symposium on Signal Processing and Information Technology, Darmstadt, Germany, December 2003.
[Tan95] Tan T. K., Pollard J. K. Determination of minimum number of wavelength required for alloptical WDM networks using graph coloring. Electronic Letters, 1995:1895-1897.
[TAN96] TANENBAUM Andrew S. Computer Networks, 3rd. ed. Prentice Hall, 1996.
[THO02] THOMADSEN T., CLAUSEN J. Hierarchical Network Design Using Simulated Annealing. Technical report, IMM-2002-14 Informatics and Mathematical Modelling, September 2002.
[TR01] Thomas Reiter, Philipp Bertschi. A planning tool for PLC networks. Proc. of Networks and Optical Communications (NOC2001), Ipswich (UK), June 2001:26-29.
[TT02] T. Thomadsen, J. Clausen, Hierarchical Network Design Using Simulated Annealing, Informatics and Mathematical Modelling, Technical University of Denmark, DTU, 2002.
[Wei99] Wei L, Chen Y and Wong G G. The evolution of China's optical fiber networks.Bell Labs Technical Journal, Jan-Mar. 1999, pp: 125-143.
[WDM01] WDMNetDesign - A Tool to Design and Evaluate WDM Networks. White Paper, http://www.comsof.com, Comsof, 2001.
[Yuf02] Yufeng Xin. Topology Design of Large-Scale Optical Networks. PhD thesis, NCSU, Raleigh, NC, 2002.
[YZ00] Y. Zhu, G. N. Rouskas, H. G. Perros. A comparison of allocation policies in wavelength routing networks. Photonic Network Communications, August 2000, 2(3):265-293.
[ZZ01] Z. Zhang, J. Fu, D. Guo, et al. Lightpath routing for intelligent optical networks. IEEE Networks, July/August 2001, 15(4):28–35.
[ZZ95] Z. Zhang, A. Acampora. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse. IEEE/ACM Transactions on Networking, June 1995, 3(3):281-288.