WDM骨干网和接入网中若干关键技术问题研究
|
摘要
随着信息技术的不断发展,基于WDM技术的光纤通信已经成为支撑通信传输网络的主流方式。在基于WDM技术的光骨干网络中,其单播路由机制是关键技术之一。目前,大部分算法都是将该问题分解为两个子问题分别求解的,但是,这样可能将最优解排除在外。另外,这些算法都是假设物理层是无损的,然而在实际情况中,物理损伤的累积对光信号的影响是不可忽略的。对于光骨干网络中的多播应用,利用生成树的方法已被广泛研究。但是由于这些算法都达不到多播容量,所以有必要使用新的方法来提高多播容量。而网络编码的提出正好满足了这一要求。由于光网络本身的特点使得我们不能够直接使用无线网络或铜线网络中现有的网络编码方法,所以必须探索适合光网络的网络编码方法。为了给终端用户提供可靠的服务,需要建立相应的接入网。目前,接入网使用最为广泛的是无线接入网和局域网接入。
本论文主要针对光骨干网络中单播路由、基于网络编码的多播通信以及接入网问题进行了研究,主要研究成果和创新点如下：
(1)研究了多路径路由算法。通过定义路径与路径之间的距离、链路与路径之间的距离等概念,提出了一种基于路径与路径之间距离的多路径路由算法,该算法为后面光网络中路由和波长分配问题奠定了良好的基础。
(2)研究了整数线性规划问题。利用随机取整算法处理整数线性规划松弛整数约束后得到分数解的情况,并从理论上证明了该算法能够以较高的概率提供接近最优解的次优解。
(3)结合基于路径之间距离多路径算法和随机取整算法,提出了新的路由和波长分配算法,而且间接的考虑了物理层损伤。通过实验仿真证明了该算法的性能要优于分两步解决该问题的方法。
(4)研究了基于网络编码的多播及其在光无线混合网络中的应用。在问题的描述中,综合考虑了光纤链路离散特点和无线用户的QoS要求,并使用了更一般化的凸目标函数,最后将该问题描述为混合整数非线性规划问题。
(5)设计了两阶段在线分布式优化算法来求解上述问题,该方法将原始问题分为两个子问题：光网络中网络编码子问题；网关选择、用户指派和带宽分配子问题。对于第一个子问题,我们提出了一种新颖的对偶分解方法,该算法可以动态调整信源速率。对于第二个子问题,我们利用一般化的bender分解方法求解,该算法具有更少的迭代次数。由于整个两阶段优化算法的复杂度是多项式时间的,所以其对实际的多播应用是可行的。
(6)提出了一种新颖的网桥转发协议,它以层次MAC地址为基础,能够使拥有不同优先权的帧使用不同的转发路径。该协议具有更低的转发复杂度和更少的存储开销。通过仿真表明该协议可以提高局域网的吞吐量,同时能够减小转发路径的长度。
With the rapid development of information technology, optical fiber communication based on WDM has become a mainstream way to support the communication transmission networks. The unicast routing scheme is one of the key technologies in optical backbone networks based on WDM technology. At present, this problem is devided into two sub-problems to be solved separately among most of the existing solutions, but it may exclude the optimal solution. In addition, these algorithms assume that the physical layer is lossless, but in reality, the accumulation of physical impairment on the optical signal can not be ignored. For multicast applications in optical networks, the algorithm based on spanning tree has been extensively studied. However, these algorithms can not reach the multicast capacity. Thus, it is necessary to explore new methods to improve the multicast capacity. The invention of network coding can just meet this requirement. As the characteristics of optical network itself, the existing network coding algorithms in the wireless network or copper network can not be used directly. It is very important to design the network coding algorithm that fits for optical networks. In order to provide reliable access service for terminal user, the corresponding access network needs to be built. Now, wireless access network (WAN) and local area network (LAN) are the most widely used.
This dissertation focuses on the study of unicast routing in optical backbone networks, multicast communication based network coding and access network problem.
The main research points and innovations are outlined as follows:
(1) The multi-path routing algorithm is investigated. By introducing the concepts of distance among paths and distance between link and path, a multi-path routing algorithm based on the distance among paths is proposed. This algorithm gives a good foundation for the routing and wavelength assignment problem in optical networks.
(2) The integer linear programming is investgated. In order to deal with the fractional solution of the relaxed integer linear programming, randomized rounding algorithm is used. We prove this algorithm can provide sub-optimal solution close to the optimum with high probability theoretically.
(3) A novel routing and wavelength assignment algorithm is proposed, and it depends on multi-path routing algorithm based on the distance among paths and randomized rounding algorithm. In addition, the physical impairment is considered indirectly. The simulation results prove that the performance of the proposed algorithm is superior to the decomposition method.
(4) The multicast application based on network coding in optical-wireless hybrid networks is investigated. The discrete characteristic of optical fiber and the QoS requirement of wireless users are considered together in the problem formulation, and the more generalized convex objective function is employed. Thus, the whole problem is formulated into a mixed integer non-linear programming (MINLP).
(5) A two-stage online distributed optimization algorithm is proposed to solve the above MINLP problem. It divides the original problem into two sub-problems:network coding in optical networks; gateway selection, wireless user assignment and bandwidth allocation. For the first sub-problme, a novel dual decomposition algorithm is proposed, and it can make source adjust its sending rate dynamically. For the second sub-problem, the generalized bender decomposition method is used, and this algorithm has less number of iterations. The complexity of the proposed two-stage optimization algorithm is polynomial, so it is feasible for the actual multicast application.
(6) A novel forwarding protocol for bridge is proposed. It can forward frames with different priorities using different paths based on hierarchical MAC address. This protocol can reduce complexity of forwarding process and storage overhead. The simulation results show that the proposed protocol can improve the throughput of LAN, and decrease the length of forwarding path at the same time.
本论文主要针对光骨干网络中单播路由、基于网络编码的多播通信以及接入网问题进行了研究,主要研究成果和创新点如下：
(1)研究了多路径路由算法。通过定义路径与路径之间的距离、链路与路径之间的距离等概念,提出了一种基于路径与路径之间距离的多路径路由算法,该算法为后面光网络中路由和波长分配问题奠定了良好的基础。
(2)研究了整数线性规划问题。利用随机取整算法处理整数线性规划松弛整数约束后得到分数解的情况,并从理论上证明了该算法能够以较高的概率提供接近最优解的次优解。
(3)结合基于路径之间距离多路径算法和随机取整算法,提出了新的路由和波长分配算法,而且间接的考虑了物理层损伤。通过实验仿真证明了该算法的性能要优于分两步解决该问题的方法。
(4)研究了基于网络编码的多播及其在光无线混合网络中的应用。在问题的描述中,综合考虑了光纤链路离散特点和无线用户的QoS要求,并使用了更一般化的凸目标函数,最后将该问题描述为混合整数非线性规划问题。
(5)设计了两阶段在线分布式优化算法来求解上述问题,该方法将原始问题分为两个子问题：光网络中网络编码子问题；网关选择、用户指派和带宽分配子问题。对于第一个子问题,我们提出了一种新颖的对偶分解方法,该算法可以动态调整信源速率。对于第二个子问题,我们利用一般化的bender分解方法求解,该算法具有更少的迭代次数。由于整个两阶段优化算法的复杂度是多项式时间的,所以其对实际的多播应用是可行的。
(6)提出了一种新颖的网桥转发协议,它以层次MAC地址为基础,能够使拥有不同优先权的帧使用不同的转发路径。该协议具有更低的转发复杂度和更少的存储开销。通过仿真表明该协议可以提高局域网的吞吐量,同时能够减小转发路径的长度。
With the rapid development of information technology, optical fiber communication based on WDM has become a mainstream way to support the communication transmission networks. The unicast routing scheme is one of the key technologies in optical backbone networks based on WDM technology. At present, this problem is devided into two sub-problems to be solved separately among most of the existing solutions, but it may exclude the optimal solution. In addition, these algorithms assume that the physical layer is lossless, but in reality, the accumulation of physical impairment on the optical signal can not be ignored. For multicast applications in optical networks, the algorithm based on spanning tree has been extensively studied. However, these algorithms can not reach the multicast capacity. Thus, it is necessary to explore new methods to improve the multicast capacity. The invention of network coding can just meet this requirement. As the characteristics of optical network itself, the existing network coding algorithms in the wireless network or copper network can not be used directly. It is very important to design the network coding algorithm that fits for optical networks. In order to provide reliable access service for terminal user, the corresponding access network needs to be built. Now, wireless access network (WAN) and local area network (LAN) are the most widely used.
This dissertation focuses on the study of unicast routing in optical backbone networks, multicast communication based network coding and access network problem.
The main research points and innovations are outlined as follows:
(1) The multi-path routing algorithm is investigated. By introducing the concepts of distance among paths and distance between link and path, a multi-path routing algorithm based on the distance among paths is proposed. This algorithm gives a good foundation for the routing and wavelength assignment problem in optical networks.
(2) The integer linear programming is investgated. In order to deal with the fractional solution of the relaxed integer linear programming, randomized rounding algorithm is used. We prove this algorithm can provide sub-optimal solution close to the optimum with high probability theoretically.
(3) A novel routing and wavelength assignment algorithm is proposed, and it depends on multi-path routing algorithm based on the distance among paths and randomized rounding algorithm. In addition, the physical impairment is considered indirectly. The simulation results prove that the performance of the proposed algorithm is superior to the decomposition method.
(4) The multicast application based on network coding in optical-wireless hybrid networks is investigated. The discrete characteristic of optical fiber and the QoS requirement of wireless users are considered together in the problem formulation, and the more generalized convex objective function is employed. Thus, the whole problem is formulated into a mixed integer non-linear programming (MINLP).
(5) A two-stage online distributed optimization algorithm is proposed to solve the above MINLP problem. It divides the original problem into two sub-problems:network coding in optical networks; gateway selection, wireless user assignment and bandwidth allocation. For the first sub-problme, a novel dual decomposition algorithm is proposed, and it can make source adjust its sending rate dynamically. For the second sub-problem, the generalized bender decomposition method is used, and this algorithm has less number of iterations. The complexity of the proposed two-stage optimization algorithm is polynomial, so it is feasible for the actual multicast application.
(6) A novel forwarding protocol for bridge is proposed. It can forward frames with different priorities using different paths based on hierarchical MAC address. This protocol can reduce complexity of forwarding process and storage overhead. The simulation results show that the proposed protocol can improve the throughput of LAN, and decrease the length of forwarding path at the same time.
引文
[1]刘凤洲.WDM光网络中路由和波长分配算法研究[硕士学位论文].成都.西南交通大学.2007.05.
[2]苏翼凯,冷鹿峰.高速光纤传输系统.第一版.上海.上海交通大学出版社.2009.02,pp.38-62.
[3]张劲松,陶智勇,韵湘.光波分复用技术.第一版.北京.北京邮电大学出版社.2002.06.
[4]董天临.光纤通信与光纤通信网.第一版.北京.清华大学出版社.2005.09.
[5]李跃辉,王缨,沈建华.光纤通信网.第一版.西安.西安电子科技大学出版社.2009.11.
[6]S. Paul. Multicasting on the Internet and Its Applications. Boston. MA:Kluwer Academic. 1998.
[7]L. Sahasrabuddhe, B. Mukherjee. Light Trees:Optical Multicasting for Improved Performance in Wavelength Routed Networks. IEEE Communications Magazine.1999.02. 37(2). pp.67-73.
[8]I. Chlamtac, A. Farago, T. Zhang. Lightpath (wavelength) Routing in Large WDM Networks. IEEE Journal on Selected Areas in Communications.1996.01.14(5). pp. 909-913.
[9]A. Ding, G. S. Poo. A Survey of Optical Multicast over WDM Networks. Computer Communications.2003.02.26(2). pp.193-200.
[10]M. Jeong, C. Qiao, Y. Xiong, H. C. Cankaya, M. Vandenhoute. Tree-shared Multicast in Optical Burst-switched WDM Networks. IEEE/OSA Journal of Lightwave Technology. 2003.01.21(1). pp.13-24.
[11]B. Chen, J. Wang. Efficient Routing and Wavelength Assignment for Multicast in WDM Networks. IEEE Journal on Selected Areas in Communications.2002.01.20(1). pp. 97-109.
[12]J. Wang, X. Qi, B. Chen. Wavelength Assignment for Multicast in All-Optical WDM Networks with Splitting Constraints. IEEE/ACM Transactions on Networking.2006.02. 14(1). pp.169-182.
[13]R. Ahlswede, N. Cai, S.-Y. Li, R. Yeung. Network Information Flow. IEEE Transaction on Information Theroy.2000.07.46(4). pp.1204-1216.
[14]P. A. Chou, Y. Wu, K. Jain. Practical Network Coding.51st Annual Allerton Conference on Communication, Control and Computing. Monticello.2003.10.
[15]Y. Wu, P. A. Chou, K. Jain. A Comarison of Network Coding and Tree Packing. Proceedings of 2004 International Symposium on Information Theory (ISIT 2004). Chicago.2004.06.
[16]K. Chi, C. Yang, X. Wang. Performance of Network Coding based Multicast. IEE Proceedings:Communications.2006.06.153(3). pp.399-404.
[17]Z. Li, B. Li. Network Coding in Undirected Networks. Proceedings of the 38th Annual Conference on Information Science and Systems (CISS 2004).2004.03. pp.257-262.
[18]W. Hu, M. Castro, J. Crowcroft, G. O Shea, A. Rowstron. Network Coding with Traffic Engineering. Proceedings of the 2006 ACM CoNEXT Conference. New York.2006.
[19]H. Tracey, M. Muriel, K. Ralf. An Information Theoretic View of Network Management. IEEE Transactions on Information Theory.2005.04.51(4). pp.1295-1312.
[20]T. Ho, B. Leong, Y. H. Chang, Y. Wen, R. Koetter. Network Monitoring in Multicast Networks using Network Coding. IEEE International Symposium on Information Theory (ISIT).2005. pp.1977-1981.
[21]Y. Wu, P. A. Chou, Q. Zhang, K. Jain, W. Zhu, S. Y. Kung. Network Planning in Wireless Ad Hoc Networks:A Cross-Layer Approach. IEEE Journal on Selected Areas in Communications.2005.23(1). pp.136-150.
[22]Y. Wu, S. Y. Kung. Reduced-Complexity Network Coding for Multicasting over Ad Hoc Networks. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP).2005. pp.18-23.
[23]C. Gkantsidis, P. R. Rodriguez. Networking Coding for Large Scale Content Distribution. Microsoft Research.2004.
[24]T. Small, B. Li, B. Liang. Topology Affects the Efficiency of Network Coding in Peer-to-Peer Networks. IEEE International Conference on Communications (ICC).2008. pp.5591-5597.
[25]R. Laroia. Designing a Mobile Broadband Wireless Access Network. IEEE Signal Processing Magazine.2004.09.21(5). pp.20-28.
[26]刘强.接入网规划与优化方法研究及应用.国防科学技术大学.2006.pp.45-53.
[27]李全.无线局域网服务质量的研究和实现.西安电子科技大学.2006.11(6).pp.53-58.
[28]M. Gagnaire, S. A. Zahr. Impairment-Aware Routing and Wavelength Assignment in Translucent Networks:State of the Art. IEEE Communications Magazine.2009.05.47(5). pp.55-61.
[29]C. V. Saradhi, S. Subramaniam. Physical Layer Impairment Aware Routing (PLIAR) in WDM Optical Networks:Issues and Challenges. IEEE Communications Survey & Tutorials.2009.11(4). pp.109-130.
[30]P. Pavon-Marino, S. Azodolmolky, R. Aparicio-Pardo, B. Garcia-Manrubia, Y. Pointurier, M. Angelou, J. Sole-Pareta, J. Garcia-Haro, I. Tomkos. Offline Impairment Aware RWA Algorithms for Cross-Layer Planning of Optical Networks. IEEE/OSA Journal of Lightwave Technology.2009.06.27(12). pp.1763-1775.
[31]S. Azodolmolky, M. Klinkowski, E. Marin, D. Gareglio, J. S. Pareta, I. Tomkos. A Survey on Physical Layer Impairments Aware Routing and Wavelength Assignment Algorithms in Optical Networks. Computer Networks.2009. pp.926-944.
[32]E. D. Manley, J. S. Deogun, L. Xu, D. R. Alexander. All-Optical Network Coding. IEEE/OSA Journal of Optical Communications and Networking.2010.2(4). pp.175-191.
[33]E. Ozdaglar, D. P. Bertsekas. Routing and Wavelength Assignment in Optical Networks. IEEE/ACM Transactions on Networking.2003.11(2). pp.259-272.
[34]R. Ramaswami, K. N. Sivarajan. Routing and Wavelength Assignment in All-Optical Networks. IEEE/ACM Transactions on Networking.1995.10.3(5). pp.489-500.
[35]M. Saad, Z. Luo. On the Routing and Wavelength Assignment in Multifiber WDM Networks. IEEE Journal on Selected Areas in Communications.2004.22(9). pp. 1708-1717.
[36]B. Jaumard, C. Meyer, B. Thiongane. Comparison of ILP Formulations for the RWA Problem. Optical Switching and Networking.2007. pp.157-172.
[37]DICONET Deliverable D4.1. Offline Impairment Aware RWA.2008.12.
[38]C. Papadimitriou, K. Steiglitz. Combinatorial Optimization:Algorithms and Complexity. Prentice Hall.1982.
[39]I. Chlamtac, A. Ganz, G. Karmi. Lightpath Communications:An Approach to High Bandwidth Optical WANs. IEEE Transactions on Communications.1992.07.40(7). pp. 1171-1182.
[40]D. Banerjee, B. Mukherjee. A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE Journal on Selected Areas in Communications.1996.14(5). pp.903-908.
[41]L. Li, A. K. Somani. Dynamic Wavelength Rouing using Congestion and Neighborhood Information. IEEE/ACM Transactions on Networking.1999.7(5). pp.779-786.
[42]S. Ramamurthy, B. Mukherjee. Fixed-Alternate Routing and Wavelength Conversion in Wavelength-Routed Optical Networks. IEEE/ACM Transactions on Networking.2002. 10(3). pp.351-367.
[43]Z. Zhang, A. S. Acampora. A Heuristic Wavelength Assignment Algorithm for Multihop WDM Networks with Wavelength Routing and Wavelength Reuse. IEEE/ACM Transactions on Networking.1995.3(3). pp.281-288.
[44]S. Subramaniam, R. A. Barry. Wavelength Assignment in Fixed-Routing WDM Networks. IEEE International Conference on Communications (ICC).1997.06. pp.406-410.
[45]C. Chen, S. Banerjee. Optical Switch Configuration and Lightpath Assignment in Wavelength Routing Multihop Lightwave Networks. IEEE International Conference on Computer Communications (INFOCOM).1995.04. vol.3. pp.1300-1307.
[46]P. Lee, Y. Gong, W. Gu. Adaptive Routing and Wavelength Assignment Algorithm for WDM Networks with Uniform and Non-uniform Traffic Model. IEEE Communications Letters.2004.8(6). pp.397-399.
[47]H. Zang, J.P. Jue, L. Sahasrabuddhe, R. Ramamurthy, B. Mukherjee,. Dynamic Lightpath Establishment in Wavelength Routed WDM Networks. IEEE Communications Magazine. 2001.39(9). pp.100-108.
[48]H. Zang, J.P. Jue, B. Mukherjee. A Review of Routing and Wavelength Assignment Approaches for Wavelength Routed Optical WDM Networks. Optical Networks Magazine. 2000.1(1). pp.47-60.
[49]M. Kovacevic, A. Acampora. On Wavelength Translation in All-Optical Networks. IEEE International Conference on Computer Communications (INFOCOM).1995.04. vol.2. pp. 413-422.
[50]L. Chlamtac, A. Ganz, R.X. Kanni. Purely Optical Networks for Terabit Communications. IEEE International Conference on Computer Communications (INFOCOM).1989.04. vol. 3. pp.887-896.
[51]Y. Zhu, GN. Rouskas, H.G. Perros. A Comparison of Allocation Policies in Wavelength Routing Networks. Photonic Networks Communication Journal.2000.08. vol.2. pp. 265-293.
[52]E. Karasan, E. Ayanoglu. Performance of WDM Transport Networks. IEEE Journal on Selected Areas in Communications.1998.16(7). pp.1081-1096.
[53]R. Barry, S. Subramaniam. The MAX SUM Wavelength Assignment Algorithm for WDM Ring Networks. Conference on Optical Fiber Communication (OFC).1997. pp.121-122.
[54]X. Zhang, C. Qiao. Wavelength Assignment for Dynamic Traffic in Multi-Fiber WDM Networks.7th International Conference on Computer Communications and Networks (ICCCN).1998. pp.479-485.
[55]J. Zheng, H.T. Mouftah. Routing and Wavelength Assignment for Advance Reservation in Wavelength-Routed WDM Optical Networks. IEEE International Conference on Communications (ICC).2002.05. vol.5. pp.2722-2726.
[56]S. Xu, L. Li, S. Wang. Wavelength Assignment for Dynamic Traffic in WDM Networks. 5th Asia-Pacific Conference on Communication and 4th Optoelectronics and Communications Conference (APCC/OECC).1999.10. vol.1. pp.7-10.
[57]S. Xu, L. Li, S. Wang. Wavelength Assignment for Dynamic Traffic in WDM Networks. IEEE International Conference on Networks (ICON).2000. pp.375-379.
[58]R. M. Krishnaswamy, K. N. Sivarajan. Algorithms for Routing and Wavelength Assignment based on Solutions of LP Relaxations. IEEE Communications Letters.2001. 5(10). pp.435-437.
[59]J. Zhang, M. Liang, Z. Wang. Efficient Algorithm for Finding Multi-Paths in Telecommunication Networks. Advanced Materials and Computer Science.2011.05. vol. 474-476. pp.2274-2278.
[60]P. Raghavan. Probabilistic Construction of Deterministic Algorithms:Approximating Packing Integer Programs. Journal of Computer and System Sciences.1988.10.37(2). pp. 130-143.
[61]D. M. Topkis. A K Shortest Path Algorithm for Adaptive Routing in Communications Networks. IEEE Transactions on Communications.1988.36(7). pp.855-859.
[62]K. Christodoulopoulos, K. Manousakis, E. Varvarigos. Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks. IEEE Global Telecommunications Conference (GLOBECOM).2008. pp.1-6.
[63]李峰.多路径QoS路由算法研究[硕士学位论文].武汉.武汉大学.2004.05.
[64]D. A. Dunn, W. D. Grover, M. H. MacGregor. Comparison of K-Shortest Paths and Maximum Flow Routing for Network Facility Restoration. IEEE Journal on Selected Areas in Communications.1994.12(1). pp.88-99.
[65]I. Cidon, R. Rom, Y. Shavitt. Analysis of Multi-Path Routing. IEEE/ACM Transaction on Networking.1999.12.7(6). pp.885-896.
[66]K. Weihe. Edge-Disjoint Routing in Plane Switch Graphs in Linear Time.40th Annual Symposium on Foundations of Computer Science.1999. pp.330-339.
[67]M. Saad, Z. Luo. Design of Edge-Disjoint Path Protected WDM Networks:Asymptotic Optimality of Shortest Path. IEEE Global Telecommunications Conference (GLOBECOM). 2004. pp.1000-1004.
[68]V. S. Shekhawat, D. K. Tyagi, V. K. Chaubey. Weight Based Edge Disjoint Path Routing and Wavelength Assignment (WEDP-RWA) Algorithm for WDM Networks. IEEE International Conference on Industrial and Information Systems.2008. pp.1-5.
[69]M. Barbehenn. A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices. IEEE Transactions on Computers.1999.47(2). pp.263.
[70]E. W. Dijkstra. A Note on Two Problems in Connection with Graphs. Numerische Mathematik.1959. pp.269-271.
[71]J. P. Rohrer, A. Jabbar, J. P. G. Sterbenz. Path Diversification:A Multipath Resilience Mechanism.7th International Workshop on Design of Reliable Communication Networks. 2009. pp.343-351.
[72]John A. Gubner. Probability and Random Processes for Electrical and Computer Engineers. Cambridge University Press.2006. pp.145-146.
[73]张皓.多径寻由及其在向量网中的应用[硕士学位论文].北京.北京交通大学.2009.05.
[74]D. Monoyios, K. Vlachos. On the Use of Genetic Algorithms for Solving the RWA Problem Employing the Maximum Quantity of Edge Disjoint Paths.10th Anniversary International Conference on Transparent Optical Networks.2008. pp.154-157.
[75]M. Andrews, L. Zhang. Complexity of Wavelength Assignment in Optical Network Optimization. IEEE/ACM Transactions on Networking.2009.04.17(2). pp.646-657.
[76]A. A. Bertossi, M. A. Bonuccelli. A VLSI Implementation of Simplex Algorithm. IEEE Transactions on Computers.1987. C-36(2). pp.241-247.
[77]X. Wang, V. P. Roychowdhury. Optimal Communication Algorithms for Heterogeneous Computing over ATM Networks. Journal of Parallel and Distributed Computing.1997.10. 46(1). pp.62-79.
[78]P. Raghavan, C. D. Thompson. Multiterminal Global Routing:A Deterministic Approximation. Algorithmica.1991.6(1). pp.73-82.
[79]C. Albrecht. Global Routing by New Approximation Algorithms for Multicommodity Flow. IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems.2001. 20(5). pp.622-632.
[80]E. Liberty, F. Woolfe, P. G. Martinsson, V. Rokhlin, M. Tygert. Randomized Algorithms for the Low-Rank Approximation of Matrices. Proceedings of the National Academy of Sciences.2007.12.104(51). pp.20167-20172.
[81]R. Ramaswami, K. N. Sivarajan. Optical Networks:A Practical Perspective.2nd edition. Morgan Kaufmann.2001.
[82]K. Christodoulopoulos, K. Manousakis, E. Varvarigos. Considering Physical Layer Impairments in Offline RWA. IEEE Network.2009.23(3). pp.26-33.
[83]DICONET Deliverable D3.1. Network Impairments in Transparent Networks and Definition of the Monitoring Strategy.2008.09.
[84]E. Salvadori, Y. Ye, A. Zanardi, H. Woesner, et al. A Study of Connection Management Approaches for an Impairment-Aware Optical Control Plane.11th International Conference on Optical Network Design and Modeling (ONDM).2007. pp.229-238.
[85]赵继军.王丽荣.王苏建.损伤感知的光网络连接指派的关键问题研究.光通信研究.2009.08.第4期.pp.14-17.
[86]K. Manousakis, K. Christodoulopoulos, E. Varvarigos. Impairment-Aware Offline RWA for Transparent Optical Networks. IEEE International Conference on Computer Communications (INFOCOM).2009. pp.1557-1565.
[87]Matlab R2010b. http://www.mathworks.com
[88]J. He, M. Brandt-Pearce, Y. Pointurier, S. Subramaniam. QoT-Aware Routing in Impairment-Constrainted Optical Network. IEEE Global Telecommunications Conference (GLOBECOM).2007. pp.2269-2274.
[89]D. Monoyios, K. Vlachos, M. Aggelou, I. Tomkos. On the Use of Multi-Objective Optimization Algorithms for Solving the Impairment Aware-RWA Problem. IEEE International Conference on Communications (ICC).2009. pp.1-6.
[90]P. Kulkarni, A. Tzanakaki, C. M. Machuka, I. Tomkos. Benefits of Q-Factor Based Routing in WDM Metro Networks.31st European Conference on Optical Communication (ECOC). 2005. pp.981-982.
[91]Y. Wu. Network Coding for Multicasting[博士学位论文]. USA. Princeton University. 2006.01.
[92]R. W. Yeung. A First Course in Information Theory. Kluwer Academic/Plenum Publisher. 2002.
[93]K. Menger. Zur Allgemeinen Kurventheorie. Fundamenta Mathematicae.1927. 10(95-115).
[94]P. Elias, A. Feinstein, C. Shannon. A Node on the Maximum Flow through a Network. IRE Transactions on Information Theory.1956.2(4). pp.117-119.
[95]L. R. Ford, D. R. Fulkerson. Flows in Networks. Princeton University Press.1962.
[96]A. V. Goldberg, R. E. Tarjan. A New Approach to the Maximum Flow Problem. Journal of ACM (JACM).1988.10.35(4). pp.921-940.
[97]D. S. Lun, M. Medard, T. Ho, R. Koetter. Network Coding with a Cost Criterion. International Symposium on Information Theory and its Applications (ISITA).2004.10.
[98]D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, E. Ahmed, H. Lee. Achieving Minimum-Cost Multicast:A Decentralized Approach Based on Network Coding. IEEE International Conference on Computer Communications (INFOCOM).2005. pp. 1607-1617.
[99]R. Gallager. A Minimum Delay Routing Algorithm using Distributed Computation. IEEE Transactions on Communications.1977.25(1). pp.73-85.
[100]D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, R. Karger, T. Ho, E. Ahmed, F. Zhao. Minimum-Cost Multicast over Coded Packet Networks. IEEE Transactions on Information Theory.2006.52(6). pp.2608-2623.
[101]S.-Y. R. Li, R. W. Yeung, N. Cai. Linear Network Coding. IEEE Transactions on Information Theory.2003.49(2). pp.371-381.
[102]T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, B. Leong. A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory.2004. 52(10). pp.4413-4430.
[103]Y. Xi, E. M. Yeh. Distributed Algorithms for Minimum Cost Multicast with Network Coding. IEEE/ACM Transactions on Networking.2010.18(2). pp.379-392.
[104]徐伟强.Ad Hoc网络的拥塞控制机制研究[博士学位论文].浙江.浙江大学.2006.04.
[105]S. Shenker. Fundamental Design Issues for the Future Internet. IEEE Journal on Selected Areas in Communications.1995.13(7). pp.1176-1188.
[106]J. Mo, J. Walrand. Fair End-to-End Window-Based Congestion Control. IEEE/ACM Transactions on Networking.2000.8(5). pp.556-567.
[107]L. Massoulie, J. Roberts. Bandwidth Sharing:Objectives and Algorithms. IEEE/ACM Transactions on Networking.2002.10(3). pp.320-328.
[108]FP Kelly, AK Maulloo, DKH Tan. Rate Control for Communication Networks:Shadow Prices, Proportional Fairness and Stability. Journal of Operations Research Society.1998. 49(3). pp.237-252.
[109]D. Rubenstein, J. Kurose, D. Towsley. The Impact of Multicast Layering on Network Fairness. IEEE/ACM Transactions on Networking.2002.10(2). pp.169-182.
[110]W. Yu. Sum-Capacity Computation for the Gaussian Vector Broadcast Channel via Dual Decomposition. IEEE Transactions on Information Theory.2006.52(2). pp.754-759.
[111]S. Boyd, L. Vandenderghe. Convex Optimization. Combridge University Press.2004.
[112]J. Wen, M. Arcak. A Unifying Passivity Framework for Network Flow Control. IEEE Transactions on Automatic Control.2004.49(2). pp.162-174.
[113]R. M. Murray, Z. Li, S. Sastry. A Mathematical Introduction to Robotic Manipulation. CRC Press (Boca Raton).1994.
[114]D. P. Palomar, M. Chiang. Alternative Distributed Algorithms for Network Utility Maximization:Framework and Applications. IEEE Transactions on Automatic Control. 2007.52(12). pp.2254-2269.
[115]W.-T. Shaw, S.-W. Wong, N. Cheng, K. Balasubramanian, X. Zhu, M. Maier, L. G. Kazovsky. Hybrid Architecture and Integrated Routing in a Highly Scalable Optical-Wireless Network. IEEE/OSA Journal of Lightwave Technology.2007.25(11). pp. 3343-3351.
[116]S. Sarkar, H.-H. Yen, S. Dixit, B. Mukherjee. Hybrid Wireless-Optical Broadband Access Network (WOBAN):Network Planning and Setup. IEEE Journal on Selected Areas in Communications.2008.26(6). pp.12-21.
[117]I. Filippini, M. Cesana. Topology Optimization for Hybrid Optical/Wireless Access Networks. Ad Hoc Networks.2010.8(6). pp.614-625.
[118]B. Mukherjee. WDM Optical Communication Networks:Progress and Challenges. IEEE Journal on Selected Areas in Communications.2000.18(10). pp.1810-1824.
[119]E. Amaldi, A. Capone, M. Cesana, I. Filippini, F. Malucelli. Optimization Models and Methods for Planning Wireless Mesh Networks. Computer Networks.2008.52(11). pp. 2159-2171.
[120]Y. Yu, S. Murphy, L. Murphy. Planning Base Station and Relay Station Locations in IEEE 802.16j Multi-Hop Relay Networks.5th IEEE Consumer Communications and Networking Conference (CCNC).2008. pp.922-926.
[121]K.Li,X.Wang.Cross-Layer Design of Wireless Mesh Networks with Network Coding. IEEE Transactions on Mobile Computing.2008.7(11).pp.1363-1373.
[122]R.Chandra,L.Qiu,K.Jain,M.Mahdian.Optimizing the Placement of Integration Points in Multi-Hop Wireless Networks.12th IEEE International Conference on Network Protocols(ICNP).2004.pp.271-282.
[123]B.Aoun,R.Boutaba Y. Iraqi,G. Kenward.Gateway Placement Optimization in Wireless Mesh Networks with QoS Constraints. IEEE Journal on Selected Ateas in Communications.2006.24(11).pp.2127-2136.
[124]Y. Drabu,H.Peyravi.Gateway Placement with QoS Constraints in Wireless Mesh Networks.7th International Conference on Networking(ICN).2008.pp.46-51.
[125]J.-W.Lee,M.Chiang,A.R.Calderbank.Utility-Optimal Random-Access Control.IEEE Transactions on Wireless Communications.2007.6(7).pp.2741-2751.
[126]M.M.Carvalho,J.J.Garcia-Luna-Aceves.Delay Analysis of the IEEE 802.11 in Single.Hop Networks.11th IEEE International Conference on Network Protocols(ICNP). 2003.pp.146-155.
[127]S.Sarkar,H.-H.Yen,S.Dixit,B.Mukherjee.Hybrid Wireless-optical Broadband Access Network (WOBAN):Networking Planning using Lagrangian Relaxation. IEEE Transactions on Networking.2009.17(4).pp.1094-1105.
[128]M.R.Garey,D.Johnson.Computers and Intractability:A Guide to the Theory of NP-Completeness.W.H.Freeman and Company.1979.pp.245-248.
[129]A.M.Geofirion.Generalized Benders Decomposition.Journal of Optimization Theory and Applications.1972.10(4).pp.237-260.
[130]J.Chen,L.Qian,Y Zhang.On Optimization of Joint Base Station Association and Power Control via Benders' Decomposition. IEEE Global Telecommunications Conference (GLOBECOM).2009.
[131]M.P.Mcgarry, M.Reisslein,M.Maier.Ethemet Passive Optical Network Architectures and Dynamic Bandwidth Allocation Algorithms.IEEE Communications Surveys & Tutorials.2008.10(3).pp.46-60.
[132]J. F. Benders. Partitioning Procedures fbr Solving Mixed-Variables Programming Problems.Numerische Mathematik.1962.4(1).pp.238-252.
[133]J.Lofberg.Yalmip:A Toolbox for Modeling and Optimization in Matlab.IEEE International Symposium on Computer Aided Control Systems Design.2004.pp.284-289.
[134]E.L.Lawler,D.E.Wood.Branch-and-Bound Methods:A Survey Operations Research. 1966.14(4).pp.699-719.
[135]R.Perlman.Interconnections-Bridges,Routers,Switches,and Internetworking Protocols.Addison-Wesley.Second Edition.1999.
[136]R.Perlman,A.Harvey, G. Varghese.Choosing the Appropriate ISO Layer for LAN Interconnection.IEEE Network.1988.2(1).pp.81-86.
[137]E.Benhamou.Integrating Bridges and Rourters in a Large Internetwork.IEEE Network. 1988.2(1).pp.65-71.
[138]D.Clark,J.Wroclawski.An Approach to Service Allocation in the Intemet.IETF Intemet Draft.1997.
[139]K. Nichols, V. Jacobson, L. Zhang. A Two-Bit Differentiated Services Architecture for the Internet. RFC 2638.1999.
[140]A. Parekh, R. Gallagher. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks:the Multiple Node Case. IEEE/ACM Transactions on Networking.1994.2(2). pp.137-150.
[141]E. Hahne. Round Robin Scheduling for Fair Flow Control. PhD Thesis. MIT.1986.
[142]J. Postel. Transmission Control Protocol. RFC 793.1981.
[143]S. Floyd, V. Jacobson. Random Early Detection for Congestion Avoidance. IEEE/ACM Transaction on Networking.1995.2(1). pp.365-386.
[144]R. Braden, L. Zhang, S. Berson, S. Herzog, S. Jamin. Resource ReSerVation Protocol (RSVP)-Version 1 Functional Specification. RFC 2205.1997.
[145]S. Chen, K. Nahrstedt. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks:Problems and Solutions. IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video.1998.12(6). pp.64-79.
[146]S. Chen. Routing Support for Providing Guaranteed End-to-End Quality-of-Service. PhD Thesis. University of Illinois. Urbana-Champaign.1999.
[147]J. Moy. OSPF Version 2. RFC 2328.1998.
[148]IEEE 802.1Q-2004 IEEE Standard for Local and Metropolitan Area Networks-Media Access Control (MAC) Bridges. Available:http://standards.ieee.org/getieee802/802.1.html
[149]G. Ibanez, A.G. Martinez, J.A. Carral, P.A. Gonzalez, A. Azcorra, J.M. Arco. Hierarchical Up/Down Routing Architecture for Ethernet Backbones and Campus Networks. IEEE International Conference on Computer Communications (INFOCOM).2008.
[150]G. Ibanez, A.G. Martibez, J.A. Carral, J.M. Arco, A. Azcorra. Evaluation of Tree-Based Routing Ethernet. IEEE Communications Letters.2009.13(6). pp.444-446.
[151]G. Ibanez, A.G. Martinez, J.A. Carral, P.A. Gonzalez, A. Azcorra, J.M. Arco. HURP/HUPBA:Zero-Congiguration Hierarchical Up/Down Routing and Bridging Architecture for Ethernet Backbones and Campus Networks. ELSEVIER Computer Networks.2010. vol.54. pp.41-56.
[152]IEEE 802.1 Working Group. http://www.ieee802.org/1.
[153]K.S. Lui, W.C. Lee. Link Layer Multi-Priority Frame Forwarding. IEEE International Conference on Communications (ICC).2003.
[154]M.D. Schroeder, A.D. Birrell, M. Burrows, H. Murray, R.M. Needham, T.L. Rodeheffer, E.H. Satterthwaite, C.P. Thacker. Autonet:A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links. IEEE Journal on Selected Areas in Communications. 1991.9(8). pp.1318-1335.
[155]Boston University Representative Topology Generator-BRITE. Available: http://www.cs.bu.edu/brite/.
[2]苏翼凯,冷鹿峰.高速光纤传输系统.第一版.上海.上海交通大学出版社.2009.02,pp.38-62.
[3]张劲松,陶智勇,韵湘.光波分复用技术.第一版.北京.北京邮电大学出版社.2002.06.
[4]董天临.光纤通信与光纤通信网.第一版.北京.清华大学出版社.2005.09.
[5]李跃辉,王缨,沈建华.光纤通信网.第一版.西安.西安电子科技大学出版社.2009.11.
[6]S. Paul. Multicasting on the Internet and Its Applications. Boston. MA:Kluwer Academic. 1998.
[7]L. Sahasrabuddhe, B. Mukherjee. Light Trees:Optical Multicasting for Improved Performance in Wavelength Routed Networks. IEEE Communications Magazine.1999.02. 37(2). pp.67-73.
[8]I. Chlamtac, A. Farago, T. Zhang. Lightpath (wavelength) Routing in Large WDM Networks. IEEE Journal on Selected Areas in Communications.1996.01.14(5). pp. 909-913.
[9]A. Ding, G. S. Poo. A Survey of Optical Multicast over WDM Networks. Computer Communications.2003.02.26(2). pp.193-200.
[10]M. Jeong, C. Qiao, Y. Xiong, H. C. Cankaya, M. Vandenhoute. Tree-shared Multicast in Optical Burst-switched WDM Networks. IEEE/OSA Journal of Lightwave Technology. 2003.01.21(1). pp.13-24.
[11]B. Chen, J. Wang. Efficient Routing and Wavelength Assignment for Multicast in WDM Networks. IEEE Journal on Selected Areas in Communications.2002.01.20(1). pp. 97-109.
[12]J. Wang, X. Qi, B. Chen. Wavelength Assignment for Multicast in All-Optical WDM Networks with Splitting Constraints. IEEE/ACM Transactions on Networking.2006.02. 14(1). pp.169-182.
[13]R. Ahlswede, N. Cai, S.-Y. Li, R. Yeung. Network Information Flow. IEEE Transaction on Information Theroy.2000.07.46(4). pp.1204-1216.
[14]P. A. Chou, Y. Wu, K. Jain. Practical Network Coding.51st Annual Allerton Conference on Communication, Control and Computing. Monticello.2003.10.
[15]Y. Wu, P. A. Chou, K. Jain. A Comarison of Network Coding and Tree Packing. Proceedings of 2004 International Symposium on Information Theory (ISIT 2004). Chicago.2004.06.
[16]K. Chi, C. Yang, X. Wang. Performance of Network Coding based Multicast. IEE Proceedings:Communications.2006.06.153(3). pp.399-404.
[17]Z. Li, B. Li. Network Coding in Undirected Networks. Proceedings of the 38th Annual Conference on Information Science and Systems (CISS 2004).2004.03. pp.257-262.
[18]W. Hu, M. Castro, J. Crowcroft, G. O Shea, A. Rowstron. Network Coding with Traffic Engineering. Proceedings of the 2006 ACM CoNEXT Conference. New York.2006.
[19]H. Tracey, M. Muriel, K. Ralf. An Information Theoretic View of Network Management. IEEE Transactions on Information Theory.2005.04.51(4). pp.1295-1312.
[20]T. Ho, B. Leong, Y. H. Chang, Y. Wen, R. Koetter. Network Monitoring in Multicast Networks using Network Coding. IEEE International Symposium on Information Theory (ISIT).2005. pp.1977-1981.
[21]Y. Wu, P. A. Chou, Q. Zhang, K. Jain, W. Zhu, S. Y. Kung. Network Planning in Wireless Ad Hoc Networks:A Cross-Layer Approach. IEEE Journal on Selected Areas in Communications.2005.23(1). pp.136-150.
[22]Y. Wu, S. Y. Kung. Reduced-Complexity Network Coding for Multicasting over Ad Hoc Networks. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP).2005. pp.18-23.
[23]C. Gkantsidis, P. R. Rodriguez. Networking Coding for Large Scale Content Distribution. Microsoft Research.2004.
[24]T. Small, B. Li, B. Liang. Topology Affects the Efficiency of Network Coding in Peer-to-Peer Networks. IEEE International Conference on Communications (ICC).2008. pp.5591-5597.
[25]R. Laroia. Designing a Mobile Broadband Wireless Access Network. IEEE Signal Processing Magazine.2004.09.21(5). pp.20-28.
[26]刘强.接入网规划与优化方法研究及应用.国防科学技术大学.2006.pp.45-53.
[27]李全.无线局域网服务质量的研究和实现.西安电子科技大学.2006.11(6).pp.53-58.
[28]M. Gagnaire, S. A. Zahr. Impairment-Aware Routing and Wavelength Assignment in Translucent Networks:State of the Art. IEEE Communications Magazine.2009.05.47(5). pp.55-61.
[29]C. V. Saradhi, S. Subramaniam. Physical Layer Impairment Aware Routing (PLIAR) in WDM Optical Networks:Issues and Challenges. IEEE Communications Survey & Tutorials.2009.11(4). pp.109-130.
[30]P. Pavon-Marino, S. Azodolmolky, R. Aparicio-Pardo, B. Garcia-Manrubia, Y. Pointurier, M. Angelou, J. Sole-Pareta, J. Garcia-Haro, I. Tomkos. Offline Impairment Aware RWA Algorithms for Cross-Layer Planning of Optical Networks. IEEE/OSA Journal of Lightwave Technology.2009.06.27(12). pp.1763-1775.
[31]S. Azodolmolky, M. Klinkowski, E. Marin, D. Gareglio, J. S. Pareta, I. Tomkos. A Survey on Physical Layer Impairments Aware Routing and Wavelength Assignment Algorithms in Optical Networks. Computer Networks.2009. pp.926-944.
[32]E. D. Manley, J. S. Deogun, L. Xu, D. R. Alexander. All-Optical Network Coding. IEEE/OSA Journal of Optical Communications and Networking.2010.2(4). pp.175-191.
[33]E. Ozdaglar, D. P. Bertsekas. Routing and Wavelength Assignment in Optical Networks. IEEE/ACM Transactions on Networking.2003.11(2). pp.259-272.
[34]R. Ramaswami, K. N. Sivarajan. Routing and Wavelength Assignment in All-Optical Networks. IEEE/ACM Transactions on Networking.1995.10.3(5). pp.489-500.
[35]M. Saad, Z. Luo. On the Routing and Wavelength Assignment in Multifiber WDM Networks. IEEE Journal on Selected Areas in Communications.2004.22(9). pp. 1708-1717.
[36]B. Jaumard, C. Meyer, B. Thiongane. Comparison of ILP Formulations for the RWA Problem. Optical Switching and Networking.2007. pp.157-172.
[37]DICONET Deliverable D4.1. Offline Impairment Aware RWA.2008.12.
[38]C. Papadimitriou, K. Steiglitz. Combinatorial Optimization:Algorithms and Complexity. Prentice Hall.1982.
[39]I. Chlamtac, A. Ganz, G. Karmi. Lightpath Communications:An Approach to High Bandwidth Optical WANs. IEEE Transactions on Communications.1992.07.40(7). pp. 1171-1182.
[40]D. Banerjee, B. Mukherjee. A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE Journal on Selected Areas in Communications.1996.14(5). pp.903-908.
[41]L. Li, A. K. Somani. Dynamic Wavelength Rouing using Congestion and Neighborhood Information. IEEE/ACM Transactions on Networking.1999.7(5). pp.779-786.
[42]S. Ramamurthy, B. Mukherjee. Fixed-Alternate Routing and Wavelength Conversion in Wavelength-Routed Optical Networks. IEEE/ACM Transactions on Networking.2002. 10(3). pp.351-367.
[43]Z. Zhang, A. S. Acampora. A Heuristic Wavelength Assignment Algorithm for Multihop WDM Networks with Wavelength Routing and Wavelength Reuse. IEEE/ACM Transactions on Networking.1995.3(3). pp.281-288.
[44]S. Subramaniam, R. A. Barry. Wavelength Assignment in Fixed-Routing WDM Networks. IEEE International Conference on Communications (ICC).1997.06. pp.406-410.
[45]C. Chen, S. Banerjee. Optical Switch Configuration and Lightpath Assignment in Wavelength Routing Multihop Lightwave Networks. IEEE International Conference on Computer Communications (INFOCOM).1995.04. vol.3. pp.1300-1307.
[46]P. Lee, Y. Gong, W. Gu. Adaptive Routing and Wavelength Assignment Algorithm for WDM Networks with Uniform and Non-uniform Traffic Model. IEEE Communications Letters.2004.8(6). pp.397-399.
[47]H. Zang, J.P. Jue, L. Sahasrabuddhe, R. Ramamurthy, B. Mukherjee,. Dynamic Lightpath Establishment in Wavelength Routed WDM Networks. IEEE Communications Magazine. 2001.39(9). pp.100-108.
[48]H. Zang, J.P. Jue, B. Mukherjee. A Review of Routing and Wavelength Assignment Approaches for Wavelength Routed Optical WDM Networks. Optical Networks Magazine. 2000.1(1). pp.47-60.
[49]M. Kovacevic, A. Acampora. On Wavelength Translation in All-Optical Networks. IEEE International Conference on Computer Communications (INFOCOM).1995.04. vol.2. pp. 413-422.
[50]L. Chlamtac, A. Ganz, R.X. Kanni. Purely Optical Networks for Terabit Communications. IEEE International Conference on Computer Communications (INFOCOM).1989.04. vol. 3. pp.887-896.
[51]Y. Zhu, GN. Rouskas, H.G. Perros. A Comparison of Allocation Policies in Wavelength Routing Networks. Photonic Networks Communication Journal.2000.08. vol.2. pp. 265-293.
[52]E. Karasan, E. Ayanoglu. Performance of WDM Transport Networks. IEEE Journal on Selected Areas in Communications.1998.16(7). pp.1081-1096.
[53]R. Barry, S. Subramaniam. The MAX SUM Wavelength Assignment Algorithm for WDM Ring Networks. Conference on Optical Fiber Communication (OFC).1997. pp.121-122.
[54]X. Zhang, C. Qiao. Wavelength Assignment for Dynamic Traffic in Multi-Fiber WDM Networks.7th International Conference on Computer Communications and Networks (ICCCN).1998. pp.479-485.
[55]J. Zheng, H.T. Mouftah. Routing and Wavelength Assignment for Advance Reservation in Wavelength-Routed WDM Optical Networks. IEEE International Conference on Communications (ICC).2002.05. vol.5. pp.2722-2726.
[56]S. Xu, L. Li, S. Wang. Wavelength Assignment for Dynamic Traffic in WDM Networks. 5th Asia-Pacific Conference on Communication and 4th Optoelectronics and Communications Conference (APCC/OECC).1999.10. vol.1. pp.7-10.
[57]S. Xu, L. Li, S. Wang. Wavelength Assignment for Dynamic Traffic in WDM Networks. IEEE International Conference on Networks (ICON).2000. pp.375-379.
[58]R. M. Krishnaswamy, K. N. Sivarajan. Algorithms for Routing and Wavelength Assignment based on Solutions of LP Relaxations. IEEE Communications Letters.2001. 5(10). pp.435-437.
[59]J. Zhang, M. Liang, Z. Wang. Efficient Algorithm for Finding Multi-Paths in Telecommunication Networks. Advanced Materials and Computer Science.2011.05. vol. 474-476. pp.2274-2278.
[60]P. Raghavan. Probabilistic Construction of Deterministic Algorithms:Approximating Packing Integer Programs. Journal of Computer and System Sciences.1988.10.37(2). pp. 130-143.
[61]D. M. Topkis. A K Shortest Path Algorithm for Adaptive Routing in Communications Networks. IEEE Transactions on Communications.1988.36(7). pp.855-859.
[62]K. Christodoulopoulos, K. Manousakis, E. Varvarigos. Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks. IEEE Global Telecommunications Conference (GLOBECOM).2008. pp.1-6.
[63]李峰.多路径QoS路由算法研究[硕士学位论文].武汉.武汉大学.2004.05.
[64]D. A. Dunn, W. D. Grover, M. H. MacGregor. Comparison of K-Shortest Paths and Maximum Flow Routing for Network Facility Restoration. IEEE Journal on Selected Areas in Communications.1994.12(1). pp.88-99.
[65]I. Cidon, R. Rom, Y. Shavitt. Analysis of Multi-Path Routing. IEEE/ACM Transaction on Networking.1999.12.7(6). pp.885-896.
[66]K. Weihe. Edge-Disjoint Routing in Plane Switch Graphs in Linear Time.40th Annual Symposium on Foundations of Computer Science.1999. pp.330-339.
[67]M. Saad, Z. Luo. Design of Edge-Disjoint Path Protected WDM Networks:Asymptotic Optimality of Shortest Path. IEEE Global Telecommunications Conference (GLOBECOM). 2004. pp.1000-1004.
[68]V. S. Shekhawat, D. K. Tyagi, V. K. Chaubey. Weight Based Edge Disjoint Path Routing and Wavelength Assignment (WEDP-RWA) Algorithm for WDM Networks. IEEE International Conference on Industrial and Information Systems.2008. pp.1-5.
[69]M. Barbehenn. A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices. IEEE Transactions on Computers.1999.47(2). pp.263.
[70]E. W. Dijkstra. A Note on Two Problems in Connection with Graphs. Numerische Mathematik.1959. pp.269-271.
[71]J. P. Rohrer, A. Jabbar, J. P. G. Sterbenz. Path Diversification:A Multipath Resilience Mechanism.7th International Workshop on Design of Reliable Communication Networks. 2009. pp.343-351.
[72]John A. Gubner. Probability and Random Processes for Electrical and Computer Engineers. Cambridge University Press.2006. pp.145-146.
[73]张皓.多径寻由及其在向量网中的应用[硕士学位论文].北京.北京交通大学.2009.05.
[74]D. Monoyios, K. Vlachos. On the Use of Genetic Algorithms for Solving the RWA Problem Employing the Maximum Quantity of Edge Disjoint Paths.10th Anniversary International Conference on Transparent Optical Networks.2008. pp.154-157.
[75]M. Andrews, L. Zhang. Complexity of Wavelength Assignment in Optical Network Optimization. IEEE/ACM Transactions on Networking.2009.04.17(2). pp.646-657.
[76]A. A. Bertossi, M. A. Bonuccelli. A VLSI Implementation of Simplex Algorithm. IEEE Transactions on Computers.1987. C-36(2). pp.241-247.
[77]X. Wang, V. P. Roychowdhury. Optimal Communication Algorithms for Heterogeneous Computing over ATM Networks. Journal of Parallel and Distributed Computing.1997.10. 46(1). pp.62-79.
[78]P. Raghavan, C. D. Thompson. Multiterminal Global Routing:A Deterministic Approximation. Algorithmica.1991.6(1). pp.73-82.
[79]C. Albrecht. Global Routing by New Approximation Algorithms for Multicommodity Flow. IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems.2001. 20(5). pp.622-632.
[80]E. Liberty, F. Woolfe, P. G. Martinsson, V. Rokhlin, M. Tygert. Randomized Algorithms for the Low-Rank Approximation of Matrices. Proceedings of the National Academy of Sciences.2007.12.104(51). pp.20167-20172.
[81]R. Ramaswami, K. N. Sivarajan. Optical Networks:A Practical Perspective.2nd edition. Morgan Kaufmann.2001.
[82]K. Christodoulopoulos, K. Manousakis, E. Varvarigos. Considering Physical Layer Impairments in Offline RWA. IEEE Network.2009.23(3). pp.26-33.
[83]DICONET Deliverable D3.1. Network Impairments in Transparent Networks and Definition of the Monitoring Strategy.2008.09.
[84]E. Salvadori, Y. Ye, A. Zanardi, H. Woesner, et al. A Study of Connection Management Approaches for an Impairment-Aware Optical Control Plane.11th International Conference on Optical Network Design and Modeling (ONDM).2007. pp.229-238.
[85]赵继军.王丽荣.王苏建.损伤感知的光网络连接指派的关键问题研究.光通信研究.2009.08.第4期.pp.14-17.
[86]K. Manousakis, K. Christodoulopoulos, E. Varvarigos. Impairment-Aware Offline RWA for Transparent Optical Networks. IEEE International Conference on Computer Communications (INFOCOM).2009. pp.1557-1565.
[87]Matlab R2010b. http://www.mathworks.com
[88]J. He, M. Brandt-Pearce, Y. Pointurier, S. Subramaniam. QoT-Aware Routing in Impairment-Constrainted Optical Network. IEEE Global Telecommunications Conference (GLOBECOM).2007. pp.2269-2274.
[89]D. Monoyios, K. Vlachos, M. Aggelou, I. Tomkos. On the Use of Multi-Objective Optimization Algorithms for Solving the Impairment Aware-RWA Problem. IEEE International Conference on Communications (ICC).2009. pp.1-6.
[90]P. Kulkarni, A. Tzanakaki, C. M. Machuka, I. Tomkos. Benefits of Q-Factor Based Routing in WDM Metro Networks.31st European Conference on Optical Communication (ECOC). 2005. pp.981-982.
[91]Y. Wu. Network Coding for Multicasting[博士学位论文]. USA. Princeton University. 2006.01.
[92]R. W. Yeung. A First Course in Information Theory. Kluwer Academic/Plenum Publisher. 2002.
[93]K. Menger. Zur Allgemeinen Kurventheorie. Fundamenta Mathematicae.1927. 10(95-115).
[94]P. Elias, A. Feinstein, C. Shannon. A Node on the Maximum Flow through a Network. IRE Transactions on Information Theory.1956.2(4). pp.117-119.
[95]L. R. Ford, D. R. Fulkerson. Flows in Networks. Princeton University Press.1962.
[96]A. V. Goldberg, R. E. Tarjan. A New Approach to the Maximum Flow Problem. Journal of ACM (JACM).1988.10.35(4). pp.921-940.
[97]D. S. Lun, M. Medard, T. Ho, R. Koetter. Network Coding with a Cost Criterion. International Symposium on Information Theory and its Applications (ISITA).2004.10.
[98]D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, E. Ahmed, H. Lee. Achieving Minimum-Cost Multicast:A Decentralized Approach Based on Network Coding. IEEE International Conference on Computer Communications (INFOCOM).2005. pp. 1607-1617.
[99]R. Gallager. A Minimum Delay Routing Algorithm using Distributed Computation. IEEE Transactions on Communications.1977.25(1). pp.73-85.
[100]D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, R. Karger, T. Ho, E. Ahmed, F. Zhao. Minimum-Cost Multicast over Coded Packet Networks. IEEE Transactions on Information Theory.2006.52(6). pp.2608-2623.
[101]S.-Y. R. Li, R. W. Yeung, N. Cai. Linear Network Coding. IEEE Transactions on Information Theory.2003.49(2). pp.371-381.
[102]T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, B. Leong. A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory.2004. 52(10). pp.4413-4430.
[103]Y. Xi, E. M. Yeh. Distributed Algorithms for Minimum Cost Multicast with Network Coding. IEEE/ACM Transactions on Networking.2010.18(2). pp.379-392.
[104]徐伟强.Ad Hoc网络的拥塞控制机制研究[博士学位论文].浙江.浙江大学.2006.04.
[105]S. Shenker. Fundamental Design Issues for the Future Internet. IEEE Journal on Selected Areas in Communications.1995.13(7). pp.1176-1188.
[106]J. Mo, J. Walrand. Fair End-to-End Window-Based Congestion Control. IEEE/ACM Transactions on Networking.2000.8(5). pp.556-567.
[107]L. Massoulie, J. Roberts. Bandwidth Sharing:Objectives and Algorithms. IEEE/ACM Transactions on Networking.2002.10(3). pp.320-328.
[108]FP Kelly, AK Maulloo, DKH Tan. Rate Control for Communication Networks:Shadow Prices, Proportional Fairness and Stability. Journal of Operations Research Society.1998. 49(3). pp.237-252.
[109]D. Rubenstein, J. Kurose, D. Towsley. The Impact of Multicast Layering on Network Fairness. IEEE/ACM Transactions on Networking.2002.10(2). pp.169-182.
[110]W. Yu. Sum-Capacity Computation for the Gaussian Vector Broadcast Channel via Dual Decomposition. IEEE Transactions on Information Theory.2006.52(2). pp.754-759.
[111]S. Boyd, L. Vandenderghe. Convex Optimization. Combridge University Press.2004.
[112]J. Wen, M. Arcak. A Unifying Passivity Framework for Network Flow Control. IEEE Transactions on Automatic Control.2004.49(2). pp.162-174.
[113]R. M. Murray, Z. Li, S. Sastry. A Mathematical Introduction to Robotic Manipulation. CRC Press (Boca Raton).1994.
[114]D. P. Palomar, M. Chiang. Alternative Distributed Algorithms for Network Utility Maximization:Framework and Applications. IEEE Transactions on Automatic Control. 2007.52(12). pp.2254-2269.
[115]W.-T. Shaw, S.-W. Wong, N. Cheng, K. Balasubramanian, X. Zhu, M. Maier, L. G. Kazovsky. Hybrid Architecture and Integrated Routing in a Highly Scalable Optical-Wireless Network. IEEE/OSA Journal of Lightwave Technology.2007.25(11). pp. 3343-3351.
[116]S. Sarkar, H.-H. Yen, S. Dixit, B. Mukherjee. Hybrid Wireless-Optical Broadband Access Network (WOBAN):Network Planning and Setup. IEEE Journal on Selected Areas in Communications.2008.26(6). pp.12-21.
[117]I. Filippini, M. Cesana. Topology Optimization for Hybrid Optical/Wireless Access Networks. Ad Hoc Networks.2010.8(6). pp.614-625.
[118]B. Mukherjee. WDM Optical Communication Networks:Progress and Challenges. IEEE Journal on Selected Areas in Communications.2000.18(10). pp.1810-1824.
[119]E. Amaldi, A. Capone, M. Cesana, I. Filippini, F. Malucelli. Optimization Models and Methods for Planning Wireless Mesh Networks. Computer Networks.2008.52(11). pp. 2159-2171.
[120]Y. Yu, S. Murphy, L. Murphy. Planning Base Station and Relay Station Locations in IEEE 802.16j Multi-Hop Relay Networks.5th IEEE Consumer Communications and Networking Conference (CCNC).2008. pp.922-926.
[121]K.Li,X.Wang.Cross-Layer Design of Wireless Mesh Networks with Network Coding. IEEE Transactions on Mobile Computing.2008.7(11).pp.1363-1373.
[122]R.Chandra,L.Qiu,K.Jain,M.Mahdian.Optimizing the Placement of Integration Points in Multi-Hop Wireless Networks.12th IEEE International Conference on Network Protocols(ICNP).2004.pp.271-282.
[123]B.Aoun,R.Boutaba Y. Iraqi,G. Kenward.Gateway Placement Optimization in Wireless Mesh Networks with QoS Constraints. IEEE Journal on Selected Ateas in Communications.2006.24(11).pp.2127-2136.
[124]Y. Drabu,H.Peyravi.Gateway Placement with QoS Constraints in Wireless Mesh Networks.7th International Conference on Networking(ICN).2008.pp.46-51.
[125]J.-W.Lee,M.Chiang,A.R.Calderbank.Utility-Optimal Random-Access Control.IEEE Transactions on Wireless Communications.2007.6(7).pp.2741-2751.
[126]M.M.Carvalho,J.J.Garcia-Luna-Aceves.Delay Analysis of the IEEE 802.11 in Single.Hop Networks.11th IEEE International Conference on Network Protocols(ICNP). 2003.pp.146-155.
[127]S.Sarkar,H.-H.Yen,S.Dixit,B.Mukherjee.Hybrid Wireless-optical Broadband Access Network (WOBAN):Networking Planning using Lagrangian Relaxation. IEEE Transactions on Networking.2009.17(4).pp.1094-1105.
[128]M.R.Garey,D.Johnson.Computers and Intractability:A Guide to the Theory of NP-Completeness.W.H.Freeman and Company.1979.pp.245-248.
[129]A.M.Geofirion.Generalized Benders Decomposition.Journal of Optimization Theory and Applications.1972.10(4).pp.237-260.
[130]J.Chen,L.Qian,Y Zhang.On Optimization of Joint Base Station Association and Power Control via Benders' Decomposition. IEEE Global Telecommunications Conference (GLOBECOM).2009.
[131]M.P.Mcgarry, M.Reisslein,M.Maier.Ethemet Passive Optical Network Architectures and Dynamic Bandwidth Allocation Algorithms.IEEE Communications Surveys & Tutorials.2008.10(3).pp.46-60.
[132]J. F. Benders. Partitioning Procedures fbr Solving Mixed-Variables Programming Problems.Numerische Mathematik.1962.4(1).pp.238-252.
[133]J.Lofberg.Yalmip:A Toolbox for Modeling and Optimization in Matlab.IEEE International Symposium on Computer Aided Control Systems Design.2004.pp.284-289.
[134]E.L.Lawler,D.E.Wood.Branch-and-Bound Methods:A Survey Operations Research. 1966.14(4).pp.699-719.
[135]R.Perlman.Interconnections-Bridges,Routers,Switches,and Internetworking Protocols.Addison-Wesley.Second Edition.1999.
[136]R.Perlman,A.Harvey, G. Varghese.Choosing the Appropriate ISO Layer for LAN Interconnection.IEEE Network.1988.2(1).pp.81-86.
[137]E.Benhamou.Integrating Bridges and Rourters in a Large Internetwork.IEEE Network. 1988.2(1).pp.65-71.
[138]D.Clark,J.Wroclawski.An Approach to Service Allocation in the Intemet.IETF Intemet Draft
[139]K. Nichols, V. Jacobson, L. Zhang. A Two-Bit Differentiated Services Architecture for the Internet. RFC 2638.1999.
[140]A. Parekh, R. Gallagher. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks:the Multiple Node Case. IEEE/ACM Transactions on Networking.1994.2(2). pp.137-150.
[141]E. Hahne. Round Robin Scheduling for Fair Flow Control. PhD Thesis. MIT.1986.
[142]J. Postel. Transmission Control Protocol. RFC 793.1981.
[143]S. Floyd, V. Jacobson. Random Early Detection for Congestion Avoidance. IEEE/ACM Transaction on Networking.1995.2(1). pp.365-386.
[144]R. Braden, L. Zhang, S. Berson, S. Herzog, S. Jamin. Resource ReSerVation Protocol (RSVP)-Version 1 Functional Specification. RFC 2205.1997.
[145]S. Chen, K. Nahrstedt. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks:Problems and Solutions. IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video.1998.12(6). pp.64-79.
[146]S. Chen. Routing Support for Providing Guaranteed End-to-End Quality-of-Service. PhD Thesis. University of Illinois. Urbana-Champaign.1999.
[147]J. Moy. OSPF Version 2. RFC 2328.1998.
[148]IEEE 802.1Q-2004 IEEE Standard for Local and Metropolitan Area Networks-Media Access Control (MAC) Bridges. Available:http://standards.ieee.org/getieee802/802.1.html
[149]G. Ibanez, A.G. Martinez, J.A. Carral, P.A. Gonzalez, A. Azcorra, J.M. Arco. Hierarchical Up/Down Routing Architecture for Ethernet Backbones and Campus Networks. IEEE International Conference on Computer Communications (INFOCOM).2008.
[150]G. Ibanez, A.G. Martibez, J.A. Carral, J.M. Arco, A. Azcorra. Evaluation of Tree-Based Routing Ethernet. IEEE Communications Letters.2009.13(6). pp.444-446.
[151]G. Ibanez, A.G. Martinez, J.A. Carral, P.A. Gonzalez, A. Azcorra, J.M. Arco. HURP/HUPBA:Zero-Congiguration Hierarchical Up/Down Routing and Bridging Architecture for Ethernet Backbones and Campus Networks. ELSEVIER Computer Networks.2010. vol.54. pp.41-56.
[152]IEEE 802.1 Working Group. http://www.ieee802.org/1.
[153]K.S. Lui, W.C. Lee. Link Layer Multi-Priority Frame Forwarding. IEEE International Conference on Communications (ICC).2003.
[154]M.D. Schroeder, A.D. Birrell, M. Burrows, H. Murray, R.M. Needham, T.L. Rodeheffer, E.H. Satterthwaite, C.P. Thacker. Autonet:A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links. IEEE Journal on Selected Areas in Communications. 1991.9(8). pp.1318-1335.
[155]Boston University Representative Topology Generator-BRITE. Available: http://www.cs.bu.edu/brite/.