基于网络生存性可重构服务承载网构建算法研究
|
摘要
由于网络业务的规模化、差异化趋势,采用单一网络体系结构或者服务模式支撑多样化的网络业务运营显得非常困难。为此,可重构柔性网络技术体系通过构建可重构服务承载网(Reconfigurable Service Carrying Network,RSCN)的方式,能够共享不同底层物理资源,支持多个异质网络体系结构并存,从而为用户提供多样化的网络服务。由于网络的不稳定性,如何构建具有强网络生存性的RSCN是可重构柔性网络研究的关键问题之一,其过程涉及如下关键环节:
首先,对网络资源状况和故障信息的掌握是构网和故障发现的前提,面对可重构柔性网络中数量庞大的资源以及资源状态的动态性,必须建立有效的资源信息管理机制。其次,构建策略的制定决定了RSCN对网络资源利用的有效性,对网络资源的均衡利用可以减少瓶颈资源,提高资源利用率,必须设计满足构网需求且均衡配置利用网络资源的RSCN构建算法。
再次,由于管理域的划分,通过集中式的服务器下发全网范围的RSCN构建策略和故障处理策略并进行命令下发不利于工程实现,为解决跨域构建问题,必须设计跨域的分布式协同的RSCN构建命令管理机制。
最后,在网络出现故障或发生重大意外时,为提高RSCN的生存性,必须设计RSCN的故障恢复和故障保护机制。
结合863项目可重构路由器构件组研制和可重构柔性试验网组网设备工程化实施子课题,本文基于可重构柔性网络技术体系在RSCN资源管理方法、RSCN构建管理机制以及RSCN容错构建技术等方面进行了较为系统的研究。本文的创新点和主要贡献包括以下几个方面:
1.针对RSCN资源管理的可扩展性和高效性,设计了可重构柔性网络的分布式分层管理体系和资源管理协议运行机制,分别提出了域内和域间资源管理机制,建立了RSCN的资源管理模型,分析了高频属性子集和推送门限对系统管理代价的作用,通过自适应地调节资源信息结构和管理模式,以系统管理代价最小为目标,设计了资源管理优化算法(Resouce Management Optimization Algorithm,RMOA)。仿真结果表明,RMOA能够根据请求和系统状态自适应设置高频属性集和推送门限,具有比单一推送或查询模式更小的系统代价。
2.针对RSCN构建管理技术,设计了RSCN分布式协同构建机制,基于令牌传递的方式设计了分布式域间RSCN构建管理方法,有效解决了大范围跨域的RSCN构建问题。为解决管理服务器单点失效问题,设计了令牌发放系统容错选举算法(Token Providing Server Resilient Election Algorithm,TREA)。理论分析和仿真结果表明,令牌传递算法ImprovedSA既能够高效地求解出令牌传递回路,又能够保证求解结果的优越性;TREA能够保证整个管理平面的有序运行,提高可重构柔性网络管理系统的容错性。
3.针对RSCN构建过程的不均衡性和动态性,在构网时充分考虑底层物理网络的负载均衡,以网络构建代价最小为原则进行优化,分别提出基于链路负载均衡和节点负载均衡的构建机制,设计了负载均衡的自适应可重构服务承载网构建算法(Balanced Adaptive RSCN Construction Algorithm,BACA)。仿真结果表明,与传统构建算法相比,BACA能够较好的提高RSCN构建请求的接收率,并且对网络链路均衡度和节点均衡度都有很高的保证。为解决由于网络动态性而造成部分资源拥塞的问题,提出了基于拥塞避免的RSCN构建算法,在链路资源不能满足用户构建请求时,按照迁移策略调整部分RSCN占用的网络资源,消除瓶颈链路,均衡物理网络,从而能进一步提高RSCN构建请求接收率,为更多的用户请求提供服务。
4.针对故障发生后的RSCN恢复机制,设计了资源紧迫度感知的RSCN构建算法(RSF-aware Construction Algorithm, RSF-awareCA),该算法以资源的重要程度为衡量指标,通过在构建过程中避让紧迫程度较高的资源,最小化了重要资源发生故障给网络带来的影响。为提高RSCN的运行成功率,设计了发生网络故障时的RSCN恢复算法(RSCN Single Link Failure Recovery Algorithm, RSLFRA)。仿真结果表明,RSLFRA算法在构建RSCN时充分考虑了资源的紧迫程度,在故障发生时能够恢复部分RSCN的故障链路,RSCN成功运行率和物理链路利用率明显优于其他构建方法,且长期运行后瓶颈资源产生的几率有所降低。
5.针对RSCN故障保护机制,为了提高RSCN的运行成功率并降低网络链路故障损失,设计了RSCN主动保护构建算法(RSCN Active Protection Algorithm, RAPA),该算法在构建RSCN的同时备份保护路径,采用资源紧迫度感知的主路径构建子算法(RSF-aware Main Link Construction Algorithm, RSF-awareMLCA)进行主路径构建,采用RSCN保护链路构建子算法(RSCN Protection Link Construction Algorithm, RPLCA)进行备份路径构建。仿真结果表明,RAPA在构建RSCN主路径时充分考虑了资源的紧迫程度,并且为RSCN主路径映射了相应的保护路径;在故障发生时RAPA能够将RSCN故障链路快速切换到保护路径,其RSCN成功运行率、主链路利用率和平均网络链路故障损失明显优于其他构建算法。
As the diversification and discrepancy trend of network traffic, network technology has faced to flinty challenges. One size fit all is impossible. Through sharing different substrate re-sources many heterogeneous networks can coexist on the same Reconfigurable Flexible Network (ReFlexNet) by constructing Reconfigurable Service Carrying Network (RSCN). This can pro-vide various network services. How to construct high network survivability RSCN is one of key issues in the research of ReFlexNet. There are some pivotal issues in construction processes.
Firstly, in control of status and failure information of network resources is the precondition of constructing RSCN and failure discovery. In the face of huge number of resources and the dynamic of these resources, how to manage these resources efficiently is a challenge problem. Secondly, the efficiency of network resource utilization rests with construction policy. Bal-anced use of network resources can reduce the number of bottleneck resources and improve re-source utilization. How to construct RSCN which satisfies user s demand efficiently under the situation of limited resources is a key issue.
Thirdly, as the partition of management domains, to calculate construction policy and dis-tribute construction and failure process commands by centralized server is unpractical. The in-ter-domain RSCN construction issues must be discussed, and distributed cooperative manage-ment system and resource management mechanism must be proposed.
The last but not least, as the instability of network, how to improve the survivability of RSCN under condition of network failure or fatal accidents is a key issue. Mechanisms of net-work failure recovery and protection must be discussed.
Combined with the research and development of the sub-project Research and Develop-ment of Reconfigurable Router Components and Engineering Implementation of Reconfigura-ble Flexible Testbed Equipments , which are supported by the National High-Tech Research and Development Program of China (863 Program). This thesis focuses on the research of resourse management methords and construction mechanism and policies of RSCN and resilient con-struction technology of RSCN in ReFlexNet. In short, its main work and contributions are out-lined as follows:
1. Aiming at improving the extensibility and efficiency of resource management of RSCN, distributed layered management system and runtime mechanisms of resource management pro-tocols are designed. Both intra-domain and inter-domain resource management principles are proposed. Resource management model of ReFlexNet is established. The impact of High Fre-quency Attributes Subset and Push Threshold on the system management cost is analyzed. To reduce system cost, Resource Management Optimized Algorithm which is called RMOA via ad-justing resource information structure and management mode adaptively is proposed. The ad-vantage of RMOA is proved via experiments in several scenarios.
2. Aiming at sloving construction technology of RSCN, distributed cooperative construc-tion mechanism is proposed, which can resolve large-scale inter-domain construction problem efficiently based on the manner of token passing. To solve single node failure problem of Recon-figurable Management Systems (RMS), Token Providing Server (TPS) Resilient Election Algo-rithms (TREA) are designed. The theoretical analysis and simulation results show that token passing algorithm (ImprovedSA) can find a better circle rapidly and effectively via ameliorating the result gained by traditional algorithm, and TREA can assure regular function of management plane and improve the survivalbility of management sysetm of ReFlexNet.
3. To solve the asymmetry and dynamicness of RSCN construction process, under some important principles of RSCN construction,balanced link load RSCN construction algorithm and balanced node load RSCN construction algorithm are given. Based on these two algorithms Balanced Adaptive RSCN Construction Algorithm (BACA) is proposed. The efficiency of BACA is evaluated by simulation experiment according to construction requirements acceptance ratio and link and node load balance ratio of the whole substrate network. To solve resource congestion issues due to network dynamicness, a congestion avoidance RSCN construction algo-rithm is proposed. Part of RSCN can be migrated according to migration principles when link resources cannot satisfy user s RSCN request. It can eliminate some bottleneck link and poise substrate network, and can improve RSCN construction requirement acceptance and provide ser-vice for more users requests.
4. To Solve resilient construction problems of RSCN in the precondition of physical link prone to failure, mathematics model of RSCN resilient construction issues is established. To avoid enormous influence because of important resource failure, a Resource Stress Factor (RSF) awareness RSCN construction algorithm named RSF-awareCA is proposed. To improve success running ratio of RSCN, RSCN link failure recovery algorithm named RSLFRA is implemented when single link failure takes place. The efficiency of algorithms is evaluated by simulation ex-periments according to RSCN success running ratio and different RSF resource distribution and physical link utilization under several scenarios.
5. Because of the blight of network failure, active protection problem of RSCN is dis-cussed. Mathematics model of RSCN active protection issues is established. To avoid enormous influence, Resource Stress Factor (RSF) awareness Main Link Construction Algorithm named RSF-awareMLCA is proposed. To improve success running ratio and reduce network link failure loss of RSCN, RSCN Protection Link Construction Algorithm named RPLCA is implemented. Considering of the two sub-algorithms, RSCN Active Protection Algorithm named RAPA is de-signed. The efficiency of algorithms is evaluated by emulation experiments according to RSCN success running ratio and main link utilization ratio and average network link failure loss under several scenarios.
首先,对网络资源状况和故障信息的掌握是构网和故障发现的前提,面对可重构柔性网络中数量庞大的资源以及资源状态的动态性,必须建立有效的资源信息管理机制。其次,构建策略的制定决定了RSCN对网络资源利用的有效性,对网络资源的均衡利用可以减少瓶颈资源,提高资源利用率,必须设计满足构网需求且均衡配置利用网络资源的RSCN构建算法。
再次,由于管理域的划分,通过集中式的服务器下发全网范围的RSCN构建策略和故障处理策略并进行命令下发不利于工程实现,为解决跨域构建问题,必须设计跨域的分布式协同的RSCN构建命令管理机制。
最后,在网络出现故障或发生重大意外时,为提高RSCN的生存性,必须设计RSCN的故障恢复和故障保护机制。
结合863项目可重构路由器构件组研制和可重构柔性试验网组网设备工程化实施子课题,本文基于可重构柔性网络技术体系在RSCN资源管理方法、RSCN构建管理机制以及RSCN容错构建技术等方面进行了较为系统的研究。本文的创新点和主要贡献包括以下几个方面:
1.针对RSCN资源管理的可扩展性和高效性,设计了可重构柔性网络的分布式分层管理体系和资源管理协议运行机制,分别提出了域内和域间资源管理机制,建立了RSCN的资源管理模型,分析了高频属性子集和推送门限对系统管理代价的作用,通过自适应地调节资源信息结构和管理模式,以系统管理代价最小为目标,设计了资源管理优化算法(Resouce Management Optimization Algorithm,RMOA)。仿真结果表明,RMOA能够根据请求和系统状态自适应设置高频属性集和推送门限,具有比单一推送或查询模式更小的系统代价。
2.针对RSCN构建管理技术,设计了RSCN分布式协同构建机制,基于令牌传递的方式设计了分布式域间RSCN构建管理方法,有效解决了大范围跨域的RSCN构建问题。为解决管理服务器单点失效问题,设计了令牌发放系统容错选举算法(Token Providing Server Resilient Election Algorithm,TREA)。理论分析和仿真结果表明,令牌传递算法ImprovedSA既能够高效地求解出令牌传递回路,又能够保证求解结果的优越性;TREA能够保证整个管理平面的有序运行,提高可重构柔性网络管理系统的容错性。
3.针对RSCN构建过程的不均衡性和动态性,在构网时充分考虑底层物理网络的负载均衡,以网络构建代价最小为原则进行优化,分别提出基于链路负载均衡和节点负载均衡的构建机制,设计了负载均衡的自适应可重构服务承载网构建算法(Balanced Adaptive RSCN Construction Algorithm,BACA)。仿真结果表明,与传统构建算法相比,BACA能够较好的提高RSCN构建请求的接收率,并且对网络链路均衡度和节点均衡度都有很高的保证。为解决由于网络动态性而造成部分资源拥塞的问题,提出了基于拥塞避免的RSCN构建算法,在链路资源不能满足用户构建请求时,按照迁移策略调整部分RSCN占用的网络资源,消除瓶颈链路,均衡物理网络,从而能进一步提高RSCN构建请求接收率,为更多的用户请求提供服务。
4.针对故障发生后的RSCN恢复机制,设计了资源紧迫度感知的RSCN构建算法(RSF-aware Construction Algorithm, RSF-awareCA),该算法以资源的重要程度为衡量指标,通过在构建过程中避让紧迫程度较高的资源,最小化了重要资源发生故障给网络带来的影响。为提高RSCN的运行成功率,设计了发生网络故障时的RSCN恢复算法(RSCN Single Link Failure Recovery Algorithm, RSLFRA)。仿真结果表明,RSLFRA算法在构建RSCN时充分考虑了资源的紧迫程度,在故障发生时能够恢复部分RSCN的故障链路,RSCN成功运行率和物理链路利用率明显优于其他构建方法,且长期运行后瓶颈资源产生的几率有所降低。
5.针对RSCN故障保护机制,为了提高RSCN的运行成功率并降低网络链路故障损失,设计了RSCN主动保护构建算法(RSCN Active Protection Algorithm, RAPA),该算法在构建RSCN的同时备份保护路径,采用资源紧迫度感知的主路径构建子算法(RSF-aware Main Link Construction Algorithm, RSF-awareMLCA)进行主路径构建,采用RSCN保护链路构建子算法(RSCN Protection Link Construction Algorithm, RPLCA)进行备份路径构建。仿真结果表明,RAPA在构建RSCN主路径时充分考虑了资源的紧迫程度,并且为RSCN主路径映射了相应的保护路径;在故障发生时RAPA能够将RSCN故障链路快速切换到保护路径,其RSCN成功运行率、主链路利用率和平均网络链路故障损失明显优于其他构建算法。
As the diversification and discrepancy trend of network traffic, network technology has faced to flinty challenges. One size fit all is impossible. Through sharing different substrate re-sources many heterogeneous networks can coexist on the same Reconfigurable Flexible Network (ReFlexNet) by constructing Reconfigurable Service Carrying Network (RSCN). This can pro-vide various network services. How to construct high network survivability RSCN is one of key issues in the research of ReFlexNet. There are some pivotal issues in construction processes.
Firstly, in control of status and failure information of network resources is the precondition of constructing RSCN and failure discovery. In the face of huge number of resources and the dynamic of these resources, how to manage these resources efficiently is a challenge problem. Secondly, the efficiency of network resource utilization rests with construction policy. Bal-anced use of network resources can reduce the number of bottleneck resources and improve re-source utilization. How to construct RSCN which satisfies user s demand efficiently under the situation of limited resources is a key issue.
Thirdly, as the partition of management domains, to calculate construction policy and dis-tribute construction and failure process commands by centralized server is unpractical. The in-ter-domain RSCN construction issues must be discussed, and distributed cooperative manage-ment system and resource management mechanism must be proposed.
The last but not least, as the instability of network, how to improve the survivability of RSCN under condition of network failure or fatal accidents is a key issue. Mechanisms of net-work failure recovery and protection must be discussed.
Combined with the research and development of the sub-project Research and Develop-ment of Reconfigurable Router Components and Engineering Implementation of Reconfigura-ble Flexible Testbed Equipments , which are supported by the National High-Tech Research and Development Program of China (863 Program). This thesis focuses on the research of resourse management methords and construction mechanism and policies of RSCN and resilient con-struction technology of RSCN in ReFlexNet. In short, its main work and contributions are out-lined as follows:
1. Aiming at improving the extensibility and efficiency of resource management of RSCN, distributed layered management system and runtime mechanisms of resource management pro-tocols are designed. Both intra-domain and inter-domain resource management principles are proposed. Resource management model of ReFlexNet is established. The impact of High Fre-quency Attributes Subset and Push Threshold on the system management cost is analyzed. To reduce system cost, Resource Management Optimized Algorithm which is called RMOA via ad-justing resource information structure and management mode adaptively is proposed. The ad-vantage of RMOA is proved via experiments in several scenarios.
2. Aiming at sloving construction technology of RSCN, distributed cooperative construc-tion mechanism is proposed, which can resolve large-scale inter-domain construction problem efficiently based on the manner of token passing. To solve single node failure problem of Recon-figurable Management Systems (RMS), Token Providing Server (TPS) Resilient Election Algo-rithms (TREA) are designed. The theoretical analysis and simulation results show that token passing algorithm (ImprovedSA) can find a better circle rapidly and effectively via ameliorating the result gained by traditional algorithm, and TREA can assure regular function of management plane and improve the survivalbility of management sysetm of ReFlexNet.
3. To solve the asymmetry and dynamicness of RSCN construction process, under some important principles of RSCN construction,balanced link load RSCN construction algorithm and balanced node load RSCN construction algorithm are given. Based on these two algorithms Balanced Adaptive RSCN Construction Algorithm (BACA) is proposed. The efficiency of BACA is evaluated by simulation experiment according to construction requirements acceptance ratio and link and node load balance ratio of the whole substrate network. To solve resource congestion issues due to network dynamicness, a congestion avoidance RSCN construction algo-rithm is proposed. Part of RSCN can be migrated according to migration principles when link resources cannot satisfy user s RSCN request. It can eliminate some bottleneck link and poise substrate network, and can improve RSCN construction requirement acceptance and provide ser-vice for more users requests.
4. To Solve resilient construction problems of RSCN in the precondition of physical link prone to failure, mathematics model of RSCN resilient construction issues is established. To avoid enormous influence because of important resource failure, a Resource Stress Factor (RSF) awareness RSCN construction algorithm named RSF-awareCA is proposed. To improve success running ratio of RSCN, RSCN link failure recovery algorithm named RSLFRA is implemented when single link failure takes place. The efficiency of algorithms is evaluated by simulation ex-periments according to RSCN success running ratio and different RSF resource distribution and physical link utilization under several scenarios.
5. Because of the blight of network failure, active protection problem of RSCN is dis-cussed. Mathematics model of RSCN active protection issues is established. To avoid enormous influence, Resource Stress Factor (RSF) awareness Main Link Construction Algorithm named RSF-awareMLCA is proposed. To improve success running ratio and reduce network link failure loss of RSCN, RSCN Protection Link Construction Algorithm named RPLCA is implemented. Considering of the two sub-algorithms, RSCN Active Protection Algorithm named RAPA is de-signed. The efficiency of algorithms is evaluated by emulation experiments according to RSCN success running ratio and main link utilization ratio and average network link failure loss under several scenarios.
引文
[1] ISC, Internet Systems Consortium[EB/OL]. http://www.isc.org.
[2] CNNIC,中国互联网络信息中心[EB/OL]. http://www.cnnic.net.cn.
[3]韦乐平.下一代网的发展思路与实践[J].华为技术, 2005, 5:4-9.
[4]中华人民共和国国务院.推进三网融合总体方案[EB/OL]:国务院关于印发推进三网融合总体方案的通知(国发[2010]5号文), 2010-01.
[5]徐恪,吴建平,徐明伟.高等计算机网络[M],机械工业出版社,2009: 190-194.
[6] Iannaccone G, et al. Analysis of Link Failures in an IP Backbone[C]. In Proc. of ACM Sigcomm Internet Measurement Workshop IMW , Marseille, France, 2002: 237-242.
[7] Markopoulou A, Iannaccone G, Bhattacharyya S, et al. Characterization of Failures in an IP Backbone[C]. In Proc. of IEEE INFOCOMM 04. Hong Kong, 2004: 2307-2317.
[8] Dan Pei, Lixia Zhang. A Framework for Resilient Internet Routing Protocols[J]. Network IEEE, 2004, Vol.18:2-5.
[9] NewArch Project: Future-Generation Internet Architecture[EB/OL]. http://www.isi.edu/newarch/.
[10] NSF NeTS FIND Initiative. Future Internet Design[EB/OL]. http://www.nets-find.net/.
[11] Global Environment for Network Innovations[EB/OL]. http://www.geni.net.
[12] The European Community's Seventh Programme[EB/OL]. The FP7 Autonomic Internet Project, http://ist-autoi.eu/autoi/.
[13] National Institute Of Information (NICT). AKARI Project[EB/OL]. http://akari-project.nict.go.jp.
[14] The European Community's Seventh Programme. The FP7 4WARD Project[EB/OL]. http://www.4ward-project.eu/.
[15] The European Community's Seventh Programme. The FP7 Autonomic Internet Pro-ject[EB/OL]. http://ist-autoi.eu/autoi/.
[16]张宏科等.新网络体系基础研究一体化网络与普适服务[J],电子学报, 2007, 35(4): 593-598.
[17] Hongbin Luo, Yajuan Qin, Hongke Zhang. A DHT-Based Identifier-to-Locator Mapping Approach for a Scalable Internet[J]. IEEE Trans. Parallel Distrib. Syst. 2009, 20(12): 1790-1802.
[18]吴建平等,下一代互联网体系结构基础研究及探索[J],计算机学报, 2008, 31(9): 1536-1548.
[19]科技部863计划联合办公室.新一代高可信网络重大项目指南[EB/OL]. http://www.most.gov.cn/tztg/200711/t20071107_57004.html.
[20]汪斌强,兰巨龙等. 863重大专项新一代高可信网络重大课题可重构路由器构件组研制项目申请书[M].项目号:2008AA01A323. 2008.
[21]刘勤让,王保进等. 863重大专项新一代高可信网络重大课题可重构柔性试验网组网设备工程化实施项目申请书[M].项目号:2009AA01A334. 2009.
[22]王浩学,汪斌强,于婧,姜明.一体化承载网络体系架构研究[J].计算机学报,2009, 32 (3):371-376.
[23]齐宁,汪斌强,郭佳.可重构服务承载网构建方法的研究[J].计算机学报,2010, 33 (9):1533-1540.
[24] C. Diot, B.N. Levine, B. Lyles, H. Kassan, D. Balensiefen, Deployment Issues for the IP Multicast Service and Architecture[J], IEEE Networks Spec. Issue Multicasting 14 (1) , 2000: 78-88.
[25] Deep Medhi, Dijiang Huang. Secure and Resilient Routing: A Framework for Resilient Network Architectures[J], Dependability and Security in Networked Systems, 2007:417-457.
[26] RFC 2460 - Internet Protocol, Version 6 (IPv6) Specification[S]. http://www.faqs.org/rfcs/rfc2460.html
[27] Thomas Anderson, Larry Peterson, etc. Overcoming the Internet Impasse through Virtual-ization [J]. IEEE Computer Magazine, 2005, 38(4): 34-41.
[28] An Architecture for a Diversified Internet[EB/OL]. http://www.nets-find.net/Funded/DiversifiedInternet.php .
[29] CABO: concurrent architecutures are better than one[EB/OL]. http://www.nets-find.net/Funded/Cabo.php.
[30] N. Feamster, L. Gao, J. Rexford. How to Lease the Internet in Your Spare Time [J]. ACM SIGCOMM Computer Communications Review, January 2007, 37(1):61-64.
[31] David Taylor, Jonathan Turner. Towards a Diversified Internet [EB/OL]. http://www.arl.wustl.edu/netv/contrib/. 2004.
[32] N.M. Mosharaf Kabir Chowdhury and Raouf Boutaba. A Survey of Network Virtualiza-tion[R]. 2008
[33] P.Ferguson and G. Huston, What is a VPN? Cisco Systems[R], Tech.Rep, 1998.
[34] E. Rosen and Y. Rekhter, BGP/MPLS IP Virtual Private Networks (VPNs)[S], RFC 4364, Feb 2006.
[35] Q. Fang, J. Cobb, and E. Leiss. A Pre-selection Routing Scheme for Virtual Circuit Net-works[C]. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), 2000.
[36] Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener. Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow[C]. In Proc. of ACM STOC, 2001: 389-398.
[37] A. Alt?n, E. Amaldi, P. Belotti, M. Pinar. Provisioning Virtual Private Networks under Traf-fic Uncertainty[J]. Networks. Vol.49, no. 1, 2007: 100-115.
[38] A. T. Campbell, H.G.D. Meer, M.E. Kounavis, K.Miki. A Survey of Programmable Net-works[C]. In Proc. of SIGCOMM Computer Communication Review. Vol. 29, no. 2, 1999:7-23.
[39] D.L. Tennenhouse, D.J. Wetherall. Towards an Active Network Architecture[J]. ACMComputer Communication Review. Vol.37, no. 5, 2007:81-94.
[40] D.L. Tennenhouse, J.M.Smith, W.D.sincoskie. A Survey of Active Network Research[J]. IEEE Communications Magazine. Vol.35, no. 1, Jan 1997:80-86.
[41] M. Sayal, Y. Breitbart, P. Scheuermann, and R. Vingralek. Selection Algorithms for Repli-cated Web Servers[C]. In Proc. of SIGMETRICS Perform. Eval. Rev, 199826, (3):44-50.
[42] S. Shi and J. Turner. Placing Servers in Overlay Networks[C]. In Proc. of International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPETS), 2002.
[43] Lua EK, Crowcroft J, Pias M, Sharma R, Lim S. A Survey and Comparison of peer-to-peer Overlay Network Schemes[J]. Journal of IEEE Communications Survey and Tutorial, 2005.7:1-2.
[44] Z. Duan, Z.-L. Zhang, and Y. T. Hou.Service Overlay Networks: SLAs, QoS, and band-width provisioning[J]. IEEE/ACM Transactions on Networking, 2003, 11(6):870-883.
[45] Antonio Capone, Jocelyne Elias, Fabio Martignon. Optimal Design of Service Overlay Networks[C]. In Proc. of the Fourth International Telecommunication Networking Work-shop on QoS in Multiservice IP Networks,Venice, 2008: 46-52.
[46] Capone A, Elias J, Martignon F. Routing and Resource Optimization in Service Overlay Networks[J]. Elsevier Computer Networks, 2009, 53(2):180-190.
[47] Sibelius Lellis Vieira, Jorg Liebeherr. Topology Design for Service Overlay Networks with Bandwidth Guarantees[C]. In Proc. of the twelfth IEEE International Workshop on Quality of Service, 2004:211-220.
[48] Ling Zhou, Arunabha Sen. Topology Design of Service Overlay Network with a General-ized Cost Model[C]. In Proc. of IEEE GLOBECOM, Washington, DC, USA, 2007: 75-80.
[49] S.Savage, T.Anderson, A.Aggarwal. Detour: a Case for Informed Internet Routing and Transport[J]. IEEE Internet Computing, vol.19, no.1, Jan 1999:50-59.
[50] D.Andersen, H.Balakrishnan, F.Kaashoek, R. Morris. Resilient Overlay Networks[J]. SI-GOPS Operating Systems Review, vol.35, no.5, 2001:131-145.
[51] Y.Chu, S.Rao, S.Seshan, H.Zhang. Enabling Conferencing Applications on the Internet Using an Overlay Muliticast Architecture[C]. In Proc. of SIGCOMM Computer Commu-nication Review. Vol.34, no.4, 2001:55-67.
[52] L.Subramanian, I. Stoica, H. Balakrishnan, R.Katz. OverQoS:An Overlay based Architec-ture for Enhancing Internet QoS[C]. In Proc. of the 1st Symposium on Networked Systems Design and Implementation (NSDI), Mar 2004:71-84.
[53] E.K.lua, J.Crowcroft, M.Pias, R.Sharma, S.Lim. A survey and Comparison of Peer-to-Peer Overlay Network Schemes[J]. IEEE Communications Sruveys &Tutorials. Vol.7, no.2, 2005:72-93.
[54] F.Dabek, M.F.Kaashoek, D.Karger. Wide-area Cooperative Storage with CFS[C]. In Proc. of the eighteenth ACM sysposium on Operating systems principles(SOSP 01). NewYork,USA, 2001:202-215.
[55] T.Anderson, L.Peterson, S.Shenker, J.Turner. Overcoming the Internet impasse throughVirtualization[J]. Computer, vol.38, no.4, 2005:34-41
[56] J. Lu and J. Turner. Effcient Mapping of Virtual Networks onto a Shared Substrate[R]. Technical Report WUCSE-2006-35, Washington University, 2006.
[57] Zhu Y, Ammar M. Algorithms for Assigning Substrate Network Resources to Virtual Net-work Components[C]. In Proc. of IEEE INFOCOM, Barcelona, Catalunya, Spain, 2006: 1-12.
[58] Yu Minlan. Yi Yung. Rexford J. Chiang M. Rethinking Virtual Network Embedding: Sub-strate Support for Path Splitting and Migration[C]. In Proc. of ACM SIGCOMM on Com-puter Communication, Seattle, WA, USA, 2008: 17-29.
[59] D. Eppstein. Finding the k Shortest Paths[C]. In Proc. of the 35th Symp. Foundations of Computer Science, IEEE, November 1994:154-165.
[60] D. Eppstein. Finding the k Shortest Paths[J]. Computing, 1998, 28(2):652-673.
[61] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Ap-plications[M]. Prentice Hall, February 19 93:43-45.
[62] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by Simulated Annealing[J]. Science, Number 4598, 13 May 1983:671-680.
[63] J. Fan and M. Ammar. Dynamic topology Con?guration in Service Overlay Networks: A study of recon?guration policies[C]. In Proc. of IEEE INFOCOM, 2006:1-12.
[64] Mosharaf N M, Rahman Muntasir Raihan, Boutaba R. Virtual Network Embedding with Coordinated Node and Link Mapping[C]. In Proc. of the 28th Conference on Computer Communications, Rio de Janeiro, USA, IEEE, 2009: 783-791.
[65] J. Lischka and H. Karl. A Virtual Network Mapping Algorithm based on Subgraph Iso-morphism Detection[C]. In Proc. of ACM SIGCOMM VISA Workshop, 2009: 81-88.
[66] L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An Improved Algorithm for Matching Large Graphs[C]. In Proc. of the 3rd IAPR-TC15 Workshop on Graph-based Representa-tions in Pattern Recognition, Cuen, 2001: 149-159.
[67] I. Houidi, W. Louati, and D. Zeghlache. A Distributed Virtual Network Mapping Algo-rithm[C]. In Proc. of IEEE ICC, 2008: 5634-5640.
[68] Gerald Tesauro, David M. Chess, William E. Walsh, Rajarshi Das, Alla Segal, Ian Whalley, Jeffrey O. Kephart, and Steve R. White. A Multi-Agent Systems Approach to Autonomic Computing[C]. In Proc. of Autonomous Agents and Multiagent Systems, International Joint Conference, 2004: 464-471.
[69] R. Ricci, C. Alfeld, and J. Lepreau. A Solver for the Network Testbed Mapping Problem[C]. In Proc. of ACM SIGCOMM CCR, 33(2), 2003:65-81.
[70] W. Szeto, Y. Iraqi, and R. Boutaba. A Multi-commodity Flow based Approach to Virtual Network Resource Allocation[C]. In Proc. of IEEE GLOBECOM, 2003: 3004-3008.
[71] E.W.M. Wong, A.K.M. Chan, and T.-S.P. Yum. A Taxonomy of Rerouting in Cir-cuit-switched Networks[J]. Communications Magazine, IEEE, 37(11), 1999:116-122.
[72] Nabeel B, Chowdhury N M, Boutaba R. Topology-Awareness and Reoptimization Mecha-nism for Virtual Network Embedding[C]. In Proc. of the 9th International NetworkingConference. Chennai, India, 2010:27-39.
[73] Feather,M.S.,A Risk-Centric Decision Process[C]. In Proc. of Software Engineering for High Assurance Sytems (SEHAS'2003).2003: Portland, OR.
[74] R.J. Ellision, D.A. Fisher, R.C. Linger, etc. Survivable Network Systems: An Emerging Discipline[R]. Technical Report CMU/SEI-97-TR-013, Carnegie Mellon University, May 1999.
[75]网络生存性[EB/OL]. http://baike.baidu.com/view/2140360.htm.
[76] P. Francois, C. Filsfils, J. Evans, et al.Achieving Sub-second IGP Convergence in Large IP Networks[C]. In Proc. of ACM SIGCOMM Computer Communication Review, July 2005, 35(2): 35-44.
[77] RFC 2328 - OSPF Version 2[S]. http://www.faqs.org/rfcs/rfc2328.html
[78] RFC 1142 - OSI IS-IS Intra-domain Routing Protocol[S]. http://www.faqs.org/rfcs/rfc1142.html.
[79] Goyal, M. Ramakrishnan, K.K. Wu-chi Feng. Achieving Faster Failure Detection in OSPF Networks[C]. In Proc. of the International Conference on Communications (ICC) 2003, Volume 1, 296-300.
[80] Bidirectional Forwarding Detection (BFD) for IPv4 and IPv6[S]. http://www.faqs.org/rfcs/rfc5881.html.
[81] D. Andersen, H. Balakrishnan, F. Kaashoek, etc. Resilient Overlay Networks[C]. In Proc. of 18th ACM SOSP, Banff, Canada, 2001: 131-145.
[82]余智华,林思明,陈海强.网络安全-可生存性研究及网络建模[J].信息技术快报, 2005: 11-23.
[83] Zhi Li, Lihua Yuan, Prasant Mohapatra, etc. On the Analysis of Overlay Failure Detection and Recovery[J]. Computer Networks Journal, 2007. 51(13): 3838-3843.
[84] Zhuang S.Q, Geels D, Stoica I. On Failure Detection Algorithms in Overlay Networks[C]. In Proc. of IEEE INFOCOM 2005. 2005: 2112-2123.
[85] Srinivasan Seetharaman, Mostafa Ammar. On the Interaction between Dynamic Routing in the Native and Overlay Layers[C]. In Proc. of IEEE INFOCOM 2006. 2006: 1-12.
[86] Raihan M, Issam A, Boutaba R. Survivable Virtual Network Embedding[C]. In Proc. of the 9th International Networking Conference. Chennai, India, 2010:40-52.
[87] Maciej K, Patrick T. Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction[J]. IEEE Journal on Selected Areas in Communications, 25(5), 2007:922-933.
[88] Lee K, Modiano E. Cross-layer Survivability in Wdm-based Networks[C]. In Proc. of IEEE INFOCOM 2009. Rio de Janeiro, Brazil. 2009:1017-1025.
[89] Krishnaiyan T, Muhamad S, Larry X. Circuits/cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in Ip-over-wdm Optical Networks[C]. In Proc. of IEEE INFOCOM 2009. Rio de Janeiro, Brazil. 2009: 1026-1034.
[90] GENI PlanetLab[EB/OL]. http://www.planet-lab.org/.
[91] CoMon [EB/OL]. http://comon.cs.princeton.edu.
[92] Slicestat[EB/OL]. http://codeen.cs.princeton.edu/slicestat.
[93] K. Czajkowski, S. Fitzgerald, I. Foster, C. Kesselman. Grid Information Services for Dis-tributed Resource Sharing[C]. In Proc. of HPDC-10, 2001: 181-194.
[94] R. van Renesse, K. Birman, W. Bogels. Astrolabe: A Robust and Scalabel Techonlogy for Distributed System Monitoring, Management, and Data Mining[J]. ACM Transactions on Computer Systems, 2003, 21(2):164-206.
[95] P. Yalagandula, M. Dahlin. A Scalable Distributed Information Management System[C]. In Proc. of SIGCOMM 2004, Aug. 2004: 379-390.
[96] Adriano Fiorese, Paulo Sim?es, Fernando Boavida: OMAN - A Management Architecture for P2P Service Overlay Networks[C]. In Proc. of AIMS 2010: 14-25.
[97] J. Liang, X. Gu, K. Nahrstedt. Self-Cofiguring Information Management for Large-Scale Service Overlays[C]. In Proc. of INFOCOM, 2007:472-480.
[98] N. Jain, D. Kit, P. Mahajan, P. Yalagandula, M. Dahlin, Y. Zhang. Star: Self-tuning Aggre-gation for Scalable Monitoring[C]. In Proc. of VLDB, 2007: 23-27.
[99] L. Huang, M. Garofalakis, A.D. Joseph, N. Taft. Communication-efficient Tracking of Dis-tributed Cumulative Triggers[C]. In Proc. of ICDCS, 2007: 54.
[100] A. Jain, J.M. Hellerstein, S. Ratnasamy, D. Wetherall. A wakeup Call for Internet Monitor-ing Systems: The Case for Distributed Triggers[C]. In Proc. of HotNets, San Diego, CA, USA, 2004: 311-316.
[101] R. Keralapura, G. Cormode, J. Ramamirtham. Communication-efficient Distributed Moni-touring of Thresholded Counts[C]. In Proc. of SIGMOD, 2006: 27-29.
[102] R. Bharambe, M. Agrawal. S. Seshan. Mercury: Supproting Scalable Multi-attribute Range Queries[C]. In Proc. of SIGCOMM 2004, August 2004.
[103] D. Oppenheimer, J. Albrecht, D. Patterson, A. Vahdat. Design and Implementation Tradeoffs for Wide-area Resource Discovery[C]. In Proc. of HPDC-14, July 2005: 113-124.
[104] S. Basu, S. Banerjce, P. Sharma, S. Lee. NodeWiz: Peer-to-Peer Resource Discovery for Grids[C]. In Proc. of IEEE/ACM GP2PC, 2005: 213-220.
[105] M. Wawrzoniak, L. Peterson, T. Roscoe Sophia: An Information Plane for Networked Sys-tem[C]. In Proc. of HotNets-II, 2003.
[106] R. Huebsch, J. M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, I. Stoica. Querying the Internet with PIER[C]. In Proc. of 29th VLDB Conference, 2003.
[107] Chowdhury M, Samuel F, Boutaba R. PolyViNE: Policy-based Virtual Network Embed-ding across Multiple Domains[C]. In Proc. of Sigcomm 2010, New Delhi, In-dia.2010:49-56.
[108] Zaheer F, et al. Multi-provider Service Negotiation and Contracting in Network Virtualiza-tion[C]. In Proc. of IEEE/IFIP Network Operations and Management Symposium 2010, Osaka, Japan, 2010: 471-478.
[109] Yahaya A, et al. iREX: Effcient Automation Architecture for the Deployment of In-ter-domain QoS Policy[J]. IEEE Transactions on Network and Service Management, 2008,5(1):50-64.
[110] D. Hausheer, B. Stiller. Auctions for Virtual Network Environments[C]. In Proc. of Work-shop on Management of Network Virtualisation, 2007.
[111] Q. Liu et al. Distributed Inter-domain Lightpath Provisioning in The Presence of Wave-length Conversion[J]. Computer Communications, 2007, 30(18): 3662-3675.
[112] J. Xiao, R. Boutaba. QoS-aware Service Compsition and Adaptation in Automomic Com-munication[J]. IEEE JSAC, 2005, 23(12):2344-2360.
[113]赵致琢,黄小玮,吴文鑫.一种分布式计算中的容错选举算法[J].计算机研究与发展, 2008: 93-98.
[114]卢开澄,卢华明.图论及其应用(第二版)[M].北京:清华大学出版社, 1998: 19-20.
[115]王海英,黄强,李传涛,褚宝增.图论算法及其MATLAB实现[M].北京:北京航空航天大学出版社,2010: 21-24.
[116] Braden R, Clark D, and Shenker S. Integrated Services in the Internet Architecture: an Overview[S]. June 1994, RFC 1633.
[117] Blake S, et al. An Architecture for Diferentiated Service[S], Dec 1998, RFC 2475.
[118] Rosen E, Viswanathan A, and Callon A. Multi Protocol Label Switching Architecture[S]. Jan.2001, RFC3031.
[119] Awduche D, Elwalidn A, Widjaja I. A Framework for Internet Traffic Engineering[S]. 2000. IETF Draft: draft-ietf-tewg-framework-01.txt.
[120] Turner J, Taylor D. Diversifying the Internet[C]. In Proc. of the IEEE Conference on Glob-al Telecommunications, St. Louis, USA, 2005: 755 -760.
[121] Lu J, Turner J. Efficient Mapping of Virtual Networks onto a Shared Substrate[R]. Wash-ington University, Technical Report WUCSE-2006-35, 2006.
[122] Hyman J., Lazar A., Pacifici G. A Methodology for Virtual Path and Virtual Netwok Band-width Assignment in Broadband Networks with QoS Guarantees[C]. In Proc. of IEEE ICC, 1994: 165-169.
[123] Zhu Y., Ammar M. Overlay Network Assignment on PlanetLab with Netfinder[R]. Tech-nical Report. Georgia Tech 2006.
[124] Liu Y. et al. Mapping Resources for Network Emulation with Heuristic and Genetic Algo-rithms[C]. In Proc. of PDCAT 2005: 670-674.
[125] Ricci R., Alfeld A., Lepreau J. A Solver for the Network Testbed Mapping Platform[J]. ACM Computer Communication Review, 2003: 1-18.
[126] BFD技术白皮书[EB/OL],华为技术有限公司,2007.
[127] C Boutremans, G Iannaccone, C Diot. Impact of Link Failures on VoIP Performance[C]. In Proc. of the 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video, Florida, USA, 2002: 63-71.
[128] AP Markopoulou, FA Tobagi, MJ Karam. Assessing the Quality of Voice Communications over Internet Backbones[J]. IEEE/ACM Transactions on Networking, 2003: 747-760.
[129] W. D. Grover. Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, and ATM Networking[M]. Prentice Hall PTR, 2003.
[130] Y. Liu, D. Tipper, P. Siripongwutikom. Approximationg Optimal Spare Capacity Allocaton by Successive Survivable Routing[J]. IEEE/ACM Transactions on Networking, 2005, 13(1): 198-211.
[131] R. Banner, A. Orda. Designing Low-capacity Backup Networks for Fast Restoration[C]. In Proc. of IEEE INFOCOM 10, 2010: 1-9.
[132] Yang Chen, Jianxin Li, Tianyu Wo, Chunming Hu, Wantao Liu. Resilient Virtual Network Service Provision in Network Virtualization Environments[C]. In Proc. of 2010 IEEE 16th International Conference on Parallel and Distributed Systems. 2010: 51-58.
[133] Hongfang Yu, Vishal Anand, Chunming Qiao, Gang Sun. Enhancing Virtual Infrastructure to Survive Facility Node Failures[C]. In Proc. of Optical Fiber Communication Conference (OFC), Los Angeles, California, USA. 2011: 1-3.
[134] Hongfang Yu, Chunming Qiao, Vishal Anand, Xin Liu, Hao Di, Gang Sun. Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Single Regional Failures[C]. In Proc. of IEEE Globecom, 2010: 1-6.
[135] Hongfang Yu, et al. On the Survivable Virtual Infrastructure Mapping Problem[C]. In Proc. of IEEE ICCCN, 2010.
[136] X. Yu, et al. Survivable Logical Topology Design for Distributed Computing in WDM Networks[C]. In Proc. of OFC, 2009: 1-3.
[137] X. Liu, et al. Robust Application Specific and Agile Private (ASAP) Networks Withstand-ing Multi-layer Failures[C]. In Proc. of OFC/NFOEC, 2009: 1-3.
[2] CNNIC,中国互联网络信息中心[EB/OL]. http://www.cnnic.net.cn.
[3]韦乐平.下一代网的发展思路与实践[J].华为技术, 2005, 5:4-9.
[4]中华人民共和国国务院.推进三网融合总体方案[EB/OL]:国务院关于印发推进三网融合总体方案的通知(国发[2010]5号文), 2010-01.
[5]徐恪,吴建平,徐明伟.高等计算机网络[M],机械工业出版社,2009: 190-194.
[6] Iannaccone G, et al. Analysis of Link Failures in an IP Backbone[C]. In Proc. of ACM Sigcomm Internet Measurement Workshop IMW , Marseille, France, 2002: 237-242.
[7] Markopoulou A, Iannaccone G, Bhattacharyya S, et al. Characterization of Failures in an IP Backbone[C]. In Proc. of IEEE INFOCOMM 04. Hong Kong, 2004: 2307-2317.
[8] Dan Pei, Lixia Zhang. A Framework for Resilient Internet Routing Protocols[J]. Network IEEE, 2004, Vol.18:2-5.
[9] NewArch Project: Future-Generation Internet Architecture[EB/OL]. http://www.isi.edu/newarch/.
[10] NSF NeTS FIND Initiative. Future Internet Design[EB/OL]. http://www.nets-find.net/.
[11] Global Environment for Network Innovations[EB/OL]. http://www.geni.net.
[12] The European Community's Seventh Programme[EB/OL]. The FP7 Autonomic Internet Project, http://ist-autoi.eu/autoi/.
[13] National Institute Of Information (NICT). AKARI Project[EB/OL]. http://akari-project.nict.go.jp.
[14] The European Community's Seventh Programme. The FP7 4WARD Project[EB/OL]. http://www.4ward-project.eu/.
[15] The European Community's Seventh Programme. The FP7 Autonomic Internet Pro-ject[EB/OL]. http://ist-autoi.eu/autoi/.
[16]张宏科等.新网络体系基础研究一体化网络与普适服务[J],电子学报, 2007, 35(4): 593-598.
[17] Hongbin Luo, Yajuan Qin, Hongke Zhang. A DHT-Based Identifier-to-Locator Mapping Approach for a Scalable Internet[J]. IEEE Trans. Parallel Distrib. Syst. 2009, 20(12): 1790-1802.
[18]吴建平等,下一代互联网体系结构基础研究及探索[J],计算机学报, 2008, 31(9): 1536-1548.
[19]科技部863计划联合办公室.新一代高可信网络重大项目指南[EB/OL]. http://www.most.gov.cn/tztg/200711/t20071107_57004.html.
[20]汪斌强,兰巨龙等. 863重大专项新一代高可信网络重大课题可重构路由器构件组研制项目申请书[M].项目号:2008AA01A323. 2008.
[21]刘勤让,王保进等. 863重大专项新一代高可信网络重大课题可重构柔性试验网组网设备工程化实施项目申请书[M].项目号:2009AA01A334. 2009.
[22]王浩学,汪斌强,于婧,姜明.一体化承载网络体系架构研究[J].计算机学报,2009, 32 (3):371-376.
[23]齐宁,汪斌强,郭佳.可重构服务承载网构建方法的研究[J].计算机学报,2010, 33 (9):1533-1540.
[24] C. Diot, B.N. Levine, B. Lyles, H. Kassan, D. Balensiefen, Deployment Issues for the IP Multicast Service and Architecture[J], IEEE Networks Spec. Issue Multicasting 14 (1) , 2000: 78-88.
[25] Deep Medhi, Dijiang Huang. Secure and Resilient Routing: A Framework for Resilient Network Architectures[J], Dependability and Security in Networked Systems, 2007:417-457.
[26] RFC 2460 - Internet Protocol, Version 6 (IPv6) Specification[S]. http://www.faqs.org/rfcs/rfc2460.html
[27] Thomas Anderson, Larry Peterson, etc. Overcoming the Internet Impasse through Virtual-ization [J]. IEEE Computer Magazine, 2005, 38(4): 34-41.
[28] An Architecture for a Diversified Internet[EB/OL]. http://www.nets-find.net/Funded/DiversifiedInternet.php .
[29] CABO: concurrent architecutures are better than one[EB/OL]. http://www.nets-find.net/Funded/Cabo.php.
[30] N. Feamster, L. Gao, J. Rexford. How to Lease the Internet in Your Spare Time [J]. ACM SIGCOMM Computer Communications Review, January 2007, 37(1):61-64.
[31] David Taylor, Jonathan Turner. Towards a Diversified Internet [EB/OL]. http://www.arl.wustl.edu/netv/contrib/. 2004.
[32] N.M. Mosharaf Kabir Chowdhury and Raouf Boutaba. A Survey of Network Virtualiza-tion[R]. 2008
[33] P.Ferguson and G. Huston, What is a VPN? Cisco Systems[R], Tech.Rep, 1998.
[34] E. Rosen and Y. Rekhter, BGP/MPLS IP Virtual Private Networks (VPNs)[S], RFC 4364, Feb 2006.
[35] Q. Fang, J. Cobb, and E. Leiss. A Pre-selection Routing Scheme for Virtual Circuit Net-works[C]. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), 2000.
[36] Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener. Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow[C]. In Proc. of ACM STOC, 2001: 389-398.
[37] A. Alt?n, E. Amaldi, P. Belotti, M. Pinar. Provisioning Virtual Private Networks under Traf-fic Uncertainty[J]. Networks. Vol.49, no. 1, 2007: 100-115.
[38] A. T. Campbell, H.G.D. Meer, M.E. Kounavis, K.Miki. A Survey of Programmable Net-works[C]. In Proc. of SIGCOMM Computer Communication Review. Vol. 29, no. 2, 1999:7-23.
[39] D.L. Tennenhouse, D.J. Wetherall. Towards an Active Network Architecture[J]. ACMComputer Communication Review. Vol.37, no. 5, 2007:81-94.
[40] D.L. Tennenhouse, J.M.Smith, W.D.sincoskie. A Survey of Active Network Research[J]. IEEE Communications Magazine. Vol.35, no. 1, Jan 1997:80-86.
[41] M. Sayal, Y. Breitbart, P. Scheuermann, and R. Vingralek. Selection Algorithms for Repli-cated Web Servers[C]. In Proc. of SIGMETRICS Perform. Eval. Rev, 199826, (3):44-50.
[42] S. Shi and J. Turner. Placing Servers in Overlay Networks[C]. In Proc. of International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPETS), 2002.
[43] Lua EK, Crowcroft J, Pias M, Sharma R, Lim S. A Survey and Comparison of peer-to-peer Overlay Network Schemes[J]. Journal of IEEE Communications Survey and Tutorial, 2005.7:1-2.
[44] Z. Duan, Z.-L. Zhang, and Y. T. Hou.Service Overlay Networks: SLAs, QoS, and band-width provisioning[J]. IEEE/ACM Transactions on Networking, 2003, 11(6):870-883.
[45] Antonio Capone, Jocelyne Elias, Fabio Martignon. Optimal Design of Service Overlay Networks[C]. In Proc. of the Fourth International Telecommunication Networking Work-shop on QoS in Multiservice IP Networks,Venice, 2008: 46-52.
[46] Capone A, Elias J, Martignon F. Routing and Resource Optimization in Service Overlay Networks[J]. Elsevier Computer Networks, 2009, 53(2):180-190.
[47] Sibelius Lellis Vieira, Jorg Liebeherr. Topology Design for Service Overlay Networks with Bandwidth Guarantees[C]. In Proc. of the twelfth IEEE International Workshop on Quality of Service, 2004:211-220.
[48] Ling Zhou, Arunabha Sen. Topology Design of Service Overlay Network with a General-ized Cost Model[C]. In Proc. of IEEE GLOBECOM, Washington, DC, USA, 2007: 75-80.
[49] S.Savage, T.Anderson, A.Aggarwal. Detour: a Case for Informed Internet Routing and Transport[J]. IEEE Internet Computing, vol.19, no.1, Jan 1999:50-59.
[50] D.Andersen, H.Balakrishnan, F.Kaashoek, R. Morris. Resilient Overlay Networks[J]. SI-GOPS Operating Systems Review, vol.35, no.5, 2001:131-145.
[51] Y.Chu, S.Rao, S.Seshan, H.Zhang. Enabling Conferencing Applications on the Internet Using an Overlay Muliticast Architecture[C]. In Proc. of SIGCOMM Computer Commu-nication Review. Vol.34, no.4, 2001:55-67.
[52] L.Subramanian, I. Stoica, H. Balakrishnan, R.Katz. OverQoS:An Overlay based Architec-ture for Enhancing Internet QoS[C]. In Proc. of the 1st Symposium on Networked Systems Design and Implementation (NSDI), Mar 2004:71-84.
[53] E.K.lua, J.Crowcroft, M.Pias, R.Sharma, S.Lim. A survey and Comparison of Peer-to-Peer Overlay Network Schemes[J]. IEEE Communications Sruveys &Tutorials. Vol.7, no.2, 2005:72-93.
[54] F.Dabek, M.F.Kaashoek, D.Karger. Wide-area Cooperative Storage with CFS[C]. In Proc. of the eighteenth ACM sysposium on Operating systems principles(SOSP 01). NewYork,USA, 2001:202-215.
[55] T.Anderson, L.Peterson, S.Shenker, J.Turner. Overcoming the Internet impasse throughVirtualization[J]. Computer, vol.38, no.4, 2005:34-41
[56] J. Lu and J. Turner. Effcient Mapping of Virtual Networks onto a Shared Substrate[R]. Technical Report WUCSE-2006-35, Washington University, 2006.
[57] Zhu Y, Ammar M. Algorithms for Assigning Substrate Network Resources to Virtual Net-work Components[C]. In Proc. of IEEE INFOCOM, Barcelona, Catalunya, Spain, 2006: 1-12.
[58] Yu Minlan. Yi Yung. Rexford J. Chiang M. Rethinking Virtual Network Embedding: Sub-strate Support for Path Splitting and Migration[C]. In Proc. of ACM SIGCOMM on Com-puter Communication, Seattle, WA, USA, 2008: 17-29.
[59] D. Eppstein. Finding the k Shortest Paths[C]. In Proc. of the 35th Symp. Foundations of Computer Science, IEEE, November 1994:154-165.
[60] D. Eppstein. Finding the k Shortest Paths[J]. Computing, 1998, 28(2):652-673.
[61] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Ap-plications[M]. Prentice Hall, February 19 93:43-45.
[62] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by Simulated Annealing[J]. Science, Number 4598, 13 May 1983:671-680.
[63] J. Fan and M. Ammar. Dynamic topology Con?guration in Service Overlay Networks: A study of recon?guration policies[C]. In Proc. of IEEE INFOCOM, 2006:1-12.
[64] Mosharaf N M, Rahman Muntasir Raihan, Boutaba R. Virtual Network Embedding with Coordinated Node and Link Mapping[C]. In Proc. of the 28th Conference on Computer Communications, Rio de Janeiro, USA, IEEE, 2009: 783-791.
[65] J. Lischka and H. Karl. A Virtual Network Mapping Algorithm based on Subgraph Iso-morphism Detection[C]. In Proc. of ACM SIGCOMM VISA Workshop, 2009: 81-88.
[66] L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An Improved Algorithm for Matching Large Graphs[C]. In Proc. of the 3rd IAPR-TC15 Workshop on Graph-based Representa-tions in Pattern Recognition, Cuen, 2001: 149-159.
[67] I. Houidi, W. Louati, and D. Zeghlache. A Distributed Virtual Network Mapping Algo-rithm[C]. In Proc. of IEEE ICC, 2008: 5634-5640.
[68] Gerald Tesauro, David M. Chess, William E. Walsh, Rajarshi Das, Alla Segal, Ian Whalley, Jeffrey O. Kephart, and Steve R. White. A Multi-Agent Systems Approach to Autonomic Computing[C]. In Proc. of Autonomous Agents and Multiagent Systems, International Joint Conference, 2004: 464-471.
[69] R. Ricci, C. Alfeld, and J. Lepreau. A Solver for the Network Testbed Mapping Problem[C]. In Proc. of ACM SIGCOMM CCR, 33(2), 2003:65-81.
[70] W. Szeto, Y. Iraqi, and R. Boutaba. A Multi-commodity Flow based Approach to Virtual Network Resource Allocation[C]. In Proc. of IEEE GLOBECOM, 2003: 3004-3008.
[71] E.W.M. Wong, A.K.M. Chan, and T.-S.P. Yum. A Taxonomy of Rerouting in Cir-cuit-switched Networks[J]. Communications Magazine, IEEE, 37(11), 1999:116-122.
[72] Nabeel B, Chowdhury N M, Boutaba R. Topology-Awareness and Reoptimization Mecha-nism for Virtual Network Embedding[C]. In Proc. of the 9th International NetworkingConference. Chennai, India, 2010:27-39.
[73] Feather,M.S.,A Risk-Centric Decision Process[C]. In Proc. of Software Engineering for High Assurance Sytems (SEHAS'2003).2003: Portland, OR.
[74] R.J. Ellision, D.A. Fisher, R.C. Linger, etc. Survivable Network Systems: An Emerging Discipline[R]. Technical Report CMU/SEI-97-TR-013, Carnegie Mellon University, May 1999.
[75]网络生存性[EB/OL]. http://baike.baidu.com/view/2140360.htm.
[76] P. Francois, C. Filsfils, J. Evans, et al.Achieving Sub-second IGP Convergence in Large IP Networks[C]. In Proc. of ACM SIGCOMM Computer Communication Review, July 2005, 35(2): 35-44.
[77] RFC 2328 - OSPF Version 2[S]. http://www.faqs.org/rfcs/rfc2328.html
[78] RFC 1142 - OSI IS-IS Intra-domain Routing Protocol[S]. http://www.faqs.org/rfcs/rfc1142.html.
[79] Goyal, M. Ramakrishnan, K.K. Wu-chi Feng. Achieving Faster Failure Detection in OSPF Networks[C]. In Proc. of the International Conference on Communications (ICC) 2003, Volume 1, 296-300.
[80] Bidirectional Forwarding Detection (BFD) for IPv4 and IPv6[S]. http://www.faqs.org/rfcs/rfc5881.html.
[81] D. Andersen, H. Balakrishnan, F. Kaashoek, etc. Resilient Overlay Networks[C]. In Proc. of 18th ACM SOSP, Banff, Canada, 2001: 131-145.
[82]余智华,林思明,陈海强.网络安全-可生存性研究及网络建模[J].信息技术快报, 2005: 11-23.
[83] Zhi Li, Lihua Yuan, Prasant Mohapatra, etc. On the Analysis of Overlay Failure Detection and Recovery[J]. Computer Networks Journal, 2007. 51(13): 3838-3843.
[84] Zhuang S.Q, Geels D, Stoica I. On Failure Detection Algorithms in Overlay Networks[C]. In Proc. of IEEE INFOCOM 2005. 2005: 2112-2123.
[85] Srinivasan Seetharaman, Mostafa Ammar. On the Interaction between Dynamic Routing in the Native and Overlay Layers[C]. In Proc. of IEEE INFOCOM 2006. 2006: 1-12.
[86] Raihan M, Issam A, Boutaba R. Survivable Virtual Network Embedding[C]. In Proc. of the 9th International Networking Conference. Chennai, India, 2010:40-52.
[87] Maciej K, Patrick T. Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction[J]. IEEE Journal on Selected Areas in Communications, 25(5), 2007:922-933.
[88] Lee K, Modiano E. Cross-layer Survivability in Wdm-based Networks[C]. In Proc. of IEEE INFOCOM 2009. Rio de Janeiro, Brazil. 2009:1017-1025.
[89] Krishnaiyan T, Muhamad S, Larry X. Circuits/cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in Ip-over-wdm Optical Networks[C]. In Proc. of IEEE INFOCOM 2009. Rio de Janeiro, Brazil. 2009: 1026-1034.
[90] GENI PlanetLab[EB/OL]. http://www.planet-lab.org/.
[91] CoMon [EB/OL]. http://comon.cs.princeton.edu.
[92] Slicestat[EB/OL]. http://codeen.cs.princeton.edu/slicestat.
[93] K. Czajkowski, S. Fitzgerald, I. Foster, C. Kesselman. Grid Information Services for Dis-tributed Resource Sharing[C]. In Proc. of HPDC-10, 2001: 181-194.
[94] R. van Renesse, K. Birman, W. Bogels. Astrolabe: A Robust and Scalabel Techonlogy for Distributed System Monitoring, Management, and Data Mining[J]. ACM Transactions on Computer Systems, 2003, 21(2):164-206.
[95] P. Yalagandula, M. Dahlin. A Scalable Distributed Information Management System[C]. In Proc. of SIGCOMM 2004, Aug. 2004: 379-390.
[96] Adriano Fiorese, Paulo Sim?es, Fernando Boavida: OMAN - A Management Architecture for P2P Service Overlay Networks[C]. In Proc. of AIMS 2010: 14-25.
[97] J. Liang, X. Gu, K. Nahrstedt. Self-Cofiguring Information Management for Large-Scale Service Overlays[C]. In Proc. of INFOCOM, 2007:472-480.
[98] N. Jain, D. Kit, P. Mahajan, P. Yalagandula, M. Dahlin, Y. Zhang. Star: Self-tuning Aggre-gation for Scalable Monitoring[C]. In Proc. of VLDB, 2007: 23-27.
[99] L. Huang, M. Garofalakis, A.D. Joseph, N. Taft. Communication-efficient Tracking of Dis-tributed Cumulative Triggers[C]. In Proc. of ICDCS, 2007: 54.
[100] A. Jain, J.M. Hellerstein, S. Ratnasamy, D. Wetherall. A wakeup Call for Internet Monitor-ing Systems: The Case for Distributed Triggers[C]. In Proc. of HotNets, San Diego, CA, USA, 2004: 311-316.
[101] R. Keralapura, G. Cormode, J. Ramamirtham. Communication-efficient Distributed Moni-touring of Thresholded Counts[C]. In Proc. of SIGMOD, 2006: 27-29.
[102] R. Bharambe, M. Agrawal. S. Seshan. Mercury: Supproting Scalable Multi-attribute Range Queries[C]. In Proc. of SIGCOMM 2004, August 2004.
[103] D. Oppenheimer, J. Albrecht, D. Patterson, A. Vahdat. Design and Implementation Tradeoffs for Wide-area Resource Discovery[C]. In Proc. of HPDC-14, July 2005: 113-124.
[104] S. Basu, S. Banerjce, P. Sharma, S. Lee. NodeWiz: Peer-to-Peer Resource Discovery for Grids[C]. In Proc. of IEEE/ACM GP2PC, 2005: 213-220.
[105] M. Wawrzoniak, L. Peterson, T. Roscoe Sophia: An Information Plane for Networked Sys-tem[C]. In Proc. of HotNets-II, 2003.
[106] R. Huebsch, J. M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, I. Stoica. Querying the Internet with PIER[C]. In Proc. of 29th VLDB Conference, 2003.
[107] Chowdhury M, Samuel F, Boutaba R. PolyViNE: Policy-based Virtual Network Embed-ding across Multiple Domains[C]. In Proc. of Sigcomm 2010, New Delhi, In-dia.2010:49-56.
[108] Zaheer F, et al. Multi-provider Service Negotiation and Contracting in Network Virtualiza-tion[C]. In Proc. of IEEE/IFIP Network Operations and Management Symposium 2010, Osaka, Japan, 2010: 471-478.
[109] Yahaya A, et al. iREX: Effcient Automation Architecture for the Deployment of In-ter-domain QoS Policy[J]. IEEE Transactions on Network and Service Management, 2008,5(1):50-64.
[110] D. Hausheer, B. Stiller. Auctions for Virtual Network Environments[C]. In Proc. of Work-shop on Management of Network Virtualisation, 2007.
[111] Q. Liu et al. Distributed Inter-domain Lightpath Provisioning in The Presence of Wave-length Conversion[J]. Computer Communications, 2007, 30(18): 3662-3675.
[112] J. Xiao, R. Boutaba. QoS-aware Service Compsition and Adaptation in Automomic Com-munication[J]. IEEE JSAC, 2005, 23(12):2344-2360.
[113]赵致琢,黄小玮,吴文鑫.一种分布式计算中的容错选举算法[J].计算机研究与发展, 2008: 93-98.
[114]卢开澄,卢华明.图论及其应用(第二版)[M].北京:清华大学出版社, 1998: 19-20.
[115]王海英,黄强,李传涛,褚宝增.图论算法及其MATLAB实现[M].北京:北京航空航天大学出版社,2010: 21-24.
[116] Braden R, Clark D, and Shenker S. Integrated Services in the Internet Architecture: an Overview[S]. June 1994, RFC 1633.
[117] Blake S, et al. An Architecture for Diferentiated Service[S], Dec 1998, RFC 2475.
[118] Rosen E, Viswanathan A, and Callon A. Multi Protocol Label Switching Architecture[S]. Jan.2001, RFC3031.
[119] Awduche D, Elwalidn A, Widjaja I. A Framework for Internet Traffic Engineering[S]. 2000. IETF Draft: draft-ietf-tewg-framework-01.txt.
[120] Turner J, Taylor D. Diversifying the Internet[C]. In Proc. of the IEEE Conference on Glob-al Telecommunications, St. Louis, USA, 2005: 755 -760.
[121] Lu J, Turner J. Efficient Mapping of Virtual Networks onto a Shared Substrate[R]. Wash-ington University, Technical Report WUCSE-2006-35, 2006.
[122] Hyman J., Lazar A., Pacifici G. A Methodology for Virtual Path and Virtual Netwok Band-width Assignment in Broadband Networks with QoS Guarantees[C]. In Proc. of IEEE ICC, 1994: 165-169.
[123] Zhu Y., Ammar M. Overlay Network Assignment on PlanetLab with Netfinder[R]. Tech-nical Report. Georgia Tech 2006.
[124] Liu Y. et al. Mapping Resources for Network Emulation with Heuristic and Genetic Algo-rithms[C]. In Proc. of PDCAT 2005: 670-674.
[125] Ricci R., Alfeld A., Lepreau J. A Solver for the Network Testbed Mapping Platform[J]. ACM Computer Communication Review, 2003: 1-18.
[126] BFD技术白皮书[EB/OL],华为技术有限公司,2007.
[127] C Boutremans, G Iannaccone, C Diot. Impact of Link Failures on VoIP Performance[C]. In Proc. of the 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video, Florida, USA, 2002: 63-71.
[128] AP Markopoulou, FA Tobagi, MJ Karam. Assessing the Quality of Voice Communications over Internet Backbones[J]. IEEE/ACM Transactions on Networking, 2003: 747-760.
[129] W. D. Grover. Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, and ATM Networking[M]. Prentice Hall PTR, 2003.
[130] Y. Liu, D. Tipper, P. Siripongwutikom. Approximationg Optimal Spare Capacity Allocaton by Successive Survivable Routing[J]. IEEE/ACM Transactions on Networking, 2005, 13(1): 198-211.
[131] R. Banner, A. Orda. Designing Low-capacity Backup Networks for Fast Restoration[C]. In Proc. of IEEE INFOCOM 10, 2010: 1-9.
[132] Yang Chen, Jianxin Li, Tianyu Wo, Chunming Hu, Wantao Liu. Resilient Virtual Network Service Provision in Network Virtualization Environments[C]. In Proc. of 2010 IEEE 16th International Conference on Parallel and Distributed Systems. 2010: 51-58.
[133] Hongfang Yu, Vishal Anand, Chunming Qiao, Gang Sun. Enhancing Virtual Infrastructure to Survive Facility Node Failures[C]. In Proc. of Optical Fiber Communication Conference (OFC), Los Angeles, California, USA. 2011: 1-3.
[134] Hongfang Yu, Chunming Qiao, Vishal Anand, Xin Liu, Hao Di, Gang Sun. Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Single Regional Failures[C]. In Proc. of IEEE Globecom, 2010: 1-6.
[135] Hongfang Yu, et al. On the Survivable Virtual Infrastructure Mapping Problem[C]. In Proc. of IEEE ICCCN, 2010.
[136] X. Yu, et al. Survivable Logical Topology Design for Distributed Computing in WDM Networks[C]. In Proc. of OFC, 2009: 1-3.
[137] X. Liu, et al. Robust Application Specific and Agile Private (ASAP) Networks Withstand-ing Multi-layer Failures[C]. In Proc. of OFC/NFOEC, 2009: 1-3.