网络虚拟化环境下资源管理关键技术研究
|
摘要
经过四十多年的发展,互联网已经深深扎根到人们生产生活的各个领域,在充分展示其强大生命力和广阔发展前景的同时极大地促进了经济发展、社会进步和科技创新。随着用户数量的急剧上升和信息内容的爆炸式增长以及用户对网络的需求的重大转变,各种新兴网络技术与网络业务的不断涌现,网络规模迅速扩张,传统的互联网模式与架构难以适应未来网络发展的需求,其在可扩展性、移动性、服务质量保证、安全性、可控可管、绿色节能等方面正面临着一系列挑战。
本论文首先基于虚拟化管理层的虚拟网络管理代理和虚拟资源代理提出网络虚拟化环境下资源管理的集中式分层树状架构,然后从构建虚拟网络时映射问题和运行中虚拟网络间动态资源分配两个方面对虚拟网络资源管理进行研究,最后在网络实验平台(TUNIE)上设计并实现了构建虚拟实验网的映射算法。具体内容包括以下四个方面：
1、针对网络虚拟化环境下网络体系结构的新特征和资源供需关系变化,基于虚拟化管理层提出了集中式分层树状资源管理架构。它上承虚拟网络的管理,下接虚拟化资源的管理,给出了未来网络虚拟化环境下资源管理的一种模式。通过对架构的层次结构与功能原理进行了介绍,讨论了架构在资源方面集中管理、分布控制,在决策方面统一规划、分头部署的特点。分析表明该架构能在虚拟化资源与虚拟网络之间建立良好的沟通与协调机制,能充分保证下层虚拟化资源的合理利用与上层虚拟网络高效构建与运营。
2、针对网络虚拟化环境下的构建虚拟网络的需求对虚拟网络映射进行深入研究,提出了基于最小成本多商品流模型的映射算法。基于物理网络与虚拟网络构造的扩展网络图,在建模过程中把节点映射成本转化为链路映射成本,使虚拟网络映射问题完全转变为多商品流(MCF)模型中流映射的问题。解决了先节点映射后链路映射、而仅链路映射依赖节点映射结果、节点映射不能协同链路映射的两阶段问题,实现节点映射与链路映射协调统一起来进行全局优化的映射方案。在映射建模中通过定义资源的使用单价与剩余资源成反比关系来构建映射的成本函数,实现了映射虚拟网络构建过程中对资源的均衡利用,同时算法支持路径分割来有效利用分片资源。仿真结果表明,该算法可以提高虚拟网络接入的成功率,降低映射的成本。
3、针对虚拟网络运行过程中业务的资源需求会随着业务的动态变化而变化,提出在网络虚拟化环境下虚拟网络间动态资源分配方案。通过分析带宽资源在虚拟网络间分配的特性,建立了各虚拟网络基于所分配带宽资源进行优化的多目标线性规划(MOLP)方案。然后从基底物理网络资源的宏观调度层面,根据效用最优化模型和业务QoS优先级等特性对各个虚拟网络的目标函数进行加权来化多目标优化为单目标优化。利用感知技术实时监测的资源状态和虚拟网络运行情况,调整算法输入参数和加权系数,实现带宽的分配朝着决策者偏好的方向优化。仿真结果表明,该动态带宽分配方案有效提高了带宽资源的利用效率和业务的满足度。
4、为虚拟网络实验平台(TUNIE)设计并实现了虚拟网络实例化的映射方案。通过对平台特性和构建虚拟实验网需求的分析,设计了基于蛙跳算法的虚拟实验网映射方案。通过对算法的仿真分析可以看出算法的收敛性能好,收敛速度快。最后用JAVA语言实现算法并集成到平台管理系统用于虚拟实验网的构建,从应用情况来看,算法表现良好,完全胜任平台构建虚拟实验网的需求。
After40years of development, the Internet has been deeply rooted in the people's production and living in various fields. As fully demonstrating its strong vitality and broad prospects for development, the Internet at the same time greatly promoted the economic development, social progress, scientific and technological innovation. With the soaring of user number and the explosive growth of information, as well as the user's demand on the network shifting, these introduce variety of new network technologies and network services constantly emerging and the scale of network rapidly expanding. The traditional model and architecture of Internet is difficult to adapt to the needs of the future network development, for it is facing a series of challenges in its scalability, mobility, quality of service, security, controllable and manageable, and green energy-saving aspects.
Based on the VN management agent and virtual resource agent in virtualization management layer, this paper first studied the resource management architecture in network virtualization environment; And then researched the virtualized resource management and allocation problem from two aspects of virtual network mapping in virtual network instantiation stage and dynamic resource allocation among the running virtual networks; Finally, the thesis designed and the realized the mapping algorithm of the virtual experimental network instantiation for Tsinghua University Network Innovation Environment. Specifically, it mainly includes the following several aspects:
(1) In view of the new features of network architecture and the change of relationship between resource supply and demand in the network virtualization environment, this thesis proposed a centralized hierarchical tree-like resource management framework based on the virtualization management layer. It roles as a connecting link between virtual networks and substrate networks, manages virtual network's resource demand and substrate network's resource supply, and coordinate the balance of relationship between resource supply and demand. This framework gives a resource management model in the future network virtualization environment. After the introduction of the framework's hierarchical structure and functional module, the thesis discusses the architecture characteristics in terms of resources'centralized management, distributed control', in the aspect of decision-making'unified programming, separated deployment'. The analysis shows that the framework can establish good communication and coordination mechanism between substrate virtualized resources and virtual networks to guarantee the substrate resource reasonable utilization and the virtual network efficient construction and operation.
(2) In view of the in-depth research of virtual network construction as the first thing in network virtualization environment, the thesis proposed a novel virtual network embedding algorithm based on the minimum cost multi-commodity flow (MCF) model. In the modeling process, the thesis transform the virtual network embedding as a complete flow mapping problem in the MCF model by transferring the node mapping cost into the link mapping cost based on the augmented network graph, which constructed by the physical network and virtual network together. This changed the two-phase situation of first node mapping and then link mapping and only link mapping dependency on node mapping result while node mapping not cooperated with link mapping, achieving unified coordination of node mapping and link mapping for global virtual network embedding optimization. In the modeling process, by definition the embedding cost function with the resource unit price inversely proportional to the remaining resources, the embedding algorithm realizes the load balance of substrate network in virtual network construction process, at the same time by supporting path splitting, the algorithm can effectively use the patch bandwidth resources. The simulation results show that the algorithm can improve the successful virtual network access rate, reduce the cost of virtual network embedding.
(3) In view of the resource demands of virtual networks will be dynamic changes with the change of services running on the virtual networks, the thesis proposed dynamic resource allocation scheme among virtual networks in the network virtual environment. By analyzing the features of bandwidth allocation among virtual networks, the scheme establish the bandwidth allocation optimization model based on the multi-objective linear programming (MOLP). Then from the macro adjust and control level of substrate network resource, the scheme transformed multi-objective programming in single objective programming according to the utility optimization model and Quality of Service priority in each virtual network by weighted summarizing objective functions of corresponding virtual networks. Using perception technology for real-time monitoring the resource utilization and virtual network operation state, the scheme adjusted the algorithm's input parameters and weighting coefficients, and made the bandwidth allocation optimization towards the decision maker's preferring direction. The simulation results show that, the dynamic bandwidth allocation scheme effectively improves the bandwidth resource utilization efficiency and service satisfaction.
(4) The thesis design and implementation embedding scheme in virtual network instantiation stage for the virtual network experiment platform (TUNIE). With analysis of the characteristics and the requirement of virtual network construction in virtual experiment platform, the thesis proposed virtual experiment network embedding scheme based on shuffled frog leaping algorithm (SFLA). Through the simulation analysis shows that the convergence of the algorithm, convergence speed. Finally the scheme is realized in JAVA language and integrated it into the platform management system for virtual experimental network construction. In the platform, the embedding scheme is fully competent the platform's demand of virtual experiment network instantiation and achieved good performance.
本论文首先基于虚拟化管理层的虚拟网络管理代理和虚拟资源代理提出网络虚拟化环境下资源管理的集中式分层树状架构,然后从构建虚拟网络时映射问题和运行中虚拟网络间动态资源分配两个方面对虚拟网络资源管理进行研究,最后在网络实验平台(TUNIE)上设计并实现了构建虚拟实验网的映射算法。具体内容包括以下四个方面：
1、针对网络虚拟化环境下网络体系结构的新特征和资源供需关系变化,基于虚拟化管理层提出了集中式分层树状资源管理架构。它上承虚拟网络的管理,下接虚拟化资源的管理,给出了未来网络虚拟化环境下资源管理的一种模式。通过对架构的层次结构与功能原理进行了介绍,讨论了架构在资源方面集中管理、分布控制,在决策方面统一规划、分头部署的特点。分析表明该架构能在虚拟化资源与虚拟网络之间建立良好的沟通与协调机制,能充分保证下层虚拟化资源的合理利用与上层虚拟网络高效构建与运营。
2、针对网络虚拟化环境下的构建虚拟网络的需求对虚拟网络映射进行深入研究,提出了基于最小成本多商品流模型的映射算法。基于物理网络与虚拟网络构造的扩展网络图,在建模过程中把节点映射成本转化为链路映射成本,使虚拟网络映射问题完全转变为多商品流(MCF)模型中流映射的问题。解决了先节点映射后链路映射、而仅链路映射依赖节点映射结果、节点映射不能协同链路映射的两阶段问题,实现节点映射与链路映射协调统一起来进行全局优化的映射方案。在映射建模中通过定义资源的使用单价与剩余资源成反比关系来构建映射的成本函数,实现了映射虚拟网络构建过程中对资源的均衡利用,同时算法支持路径分割来有效利用分片资源。仿真结果表明,该算法可以提高虚拟网络接入的成功率,降低映射的成本。
3、针对虚拟网络运行过程中业务的资源需求会随着业务的动态变化而变化,提出在网络虚拟化环境下虚拟网络间动态资源分配方案。通过分析带宽资源在虚拟网络间分配的特性,建立了各虚拟网络基于所分配带宽资源进行优化的多目标线性规划(MOLP)方案。然后从基底物理网络资源的宏观调度层面,根据效用最优化模型和业务QoS优先级等特性对各个虚拟网络的目标函数进行加权来化多目标优化为单目标优化。利用感知技术实时监测的资源状态和虚拟网络运行情况,调整算法输入参数和加权系数,实现带宽的分配朝着决策者偏好的方向优化。仿真结果表明,该动态带宽分配方案有效提高了带宽资源的利用效率和业务的满足度。
4、为虚拟网络实验平台(TUNIE)设计并实现了虚拟网络实例化的映射方案。通过对平台特性和构建虚拟实验网需求的分析,设计了基于蛙跳算法的虚拟实验网映射方案。通过对算法的仿真分析可以看出算法的收敛性能好,收敛速度快。最后用JAVA语言实现算法并集成到平台管理系统用于虚拟实验网的构建,从应用情况来看,算法表现良好,完全胜任平台构建虚拟实验网的需求。
After40years of development, the Internet has been deeply rooted in the people's production and living in various fields. As fully demonstrating its strong vitality and broad prospects for development, the Internet at the same time greatly promoted the economic development, social progress, scientific and technological innovation. With the soaring of user number and the explosive growth of information, as well as the user's demand on the network shifting, these introduce variety of new network technologies and network services constantly emerging and the scale of network rapidly expanding. The traditional model and architecture of Internet is difficult to adapt to the needs of the future network development, for it is facing a series of challenges in its scalability, mobility, quality of service, security, controllable and manageable, and green energy-saving aspects.
Based on the VN management agent and virtual resource agent in virtualization management layer, this paper first studied the resource management architecture in network virtualization environment; And then researched the virtualized resource management and allocation problem from two aspects of virtual network mapping in virtual network instantiation stage and dynamic resource allocation among the running virtual networks; Finally, the thesis designed and the realized the mapping algorithm of the virtual experimental network instantiation for Tsinghua University Network Innovation Environment. Specifically, it mainly includes the following several aspects:
(1) In view of the new features of network architecture and the change of relationship between resource supply and demand in the network virtualization environment, this thesis proposed a centralized hierarchical tree-like resource management framework based on the virtualization management layer. It roles as a connecting link between virtual networks and substrate networks, manages virtual network's resource demand and substrate network's resource supply, and coordinate the balance of relationship between resource supply and demand. This framework gives a resource management model in the future network virtualization environment. After the introduction of the framework's hierarchical structure and functional module, the thesis discusses the architecture characteristics in terms of resources'centralized management, distributed control', in the aspect of decision-making'unified programming, separated deployment'. The analysis shows that the framework can establish good communication and coordination mechanism between substrate virtualized resources and virtual networks to guarantee the substrate resource reasonable utilization and the virtual network efficient construction and operation.
(2) In view of the in-depth research of virtual network construction as the first thing in network virtualization environment, the thesis proposed a novel virtual network embedding algorithm based on the minimum cost multi-commodity flow (MCF) model. In the modeling process, the thesis transform the virtual network embedding as a complete flow mapping problem in the MCF model by transferring the node mapping cost into the link mapping cost based on the augmented network graph, which constructed by the physical network and virtual network together. This changed the two-phase situation of first node mapping and then link mapping and only link mapping dependency on node mapping result while node mapping not cooperated with link mapping, achieving unified coordination of node mapping and link mapping for global virtual network embedding optimization. In the modeling process, by definition the embedding cost function with the resource unit price inversely proportional to the remaining resources, the embedding algorithm realizes the load balance of substrate network in virtual network construction process, at the same time by supporting path splitting, the algorithm can effectively use the patch bandwidth resources. The simulation results show that the algorithm can improve the successful virtual network access rate, reduce the cost of virtual network embedding.
(3) In view of the resource demands of virtual networks will be dynamic changes with the change of services running on the virtual networks, the thesis proposed dynamic resource allocation scheme among virtual networks in the network virtual environment. By analyzing the features of bandwidth allocation among virtual networks, the scheme establish the bandwidth allocation optimization model based on the multi-objective linear programming (MOLP). Then from the macro adjust and control level of substrate network resource, the scheme transformed multi-objective programming in single objective programming according to the utility optimization model and Quality of Service priority in each virtual network by weighted summarizing objective functions of corresponding virtual networks. Using perception technology for real-time monitoring the resource utilization and virtual network operation state, the scheme adjusted the algorithm's input parameters and weighting coefficients, and made the bandwidth allocation optimization towards the decision maker's preferring direction. The simulation results show that, the dynamic bandwidth allocation scheme effectively improves the bandwidth resource utilization efficiency and service satisfaction.
(4) The thesis design and implementation embedding scheme in virtual network instantiation stage for the virtual network experiment platform (TUNIE). With analysis of the characteristics and the requirement of virtual network construction in virtual experiment platform, the thesis proposed virtual experiment network embedding scheme based on shuffled frog leaping algorithm (SFLA). Through the simulation analysis shows that the convergence of the algorithm, convergence speed. Finally the scheme is realized in JAVA language and integrated it into the platform management system for virtual experimental network construction. In the platform, the embedding scheme is fully competent the platform's demand of virtual experiment network instantiation and achieved good performance.
引文
[1]Peter H. Salus, G. Vinton, Casting the Net:From ARPANET to Internet and Beyand. Addison-Wesley Longman Publishing Co. Inc,1995.
[2]Haring, Bruce. "Who Really Invented the Net?" [J]. USA Today, September 2, 1999.
[3]Rogers, J.D.Internetworking and the politics of science:NSFNET in Internet history[J].The Information Society. vol.14(3), p213-228.1998.
[4]ANSNET. [EB/OL]. http://www.cs.sfu.ca/-tamaras/theInternetP2/ANSNET.html
[5]中国第一封电子邮件.[EB/OL]. http://www.cnnic.cn/html/Dir/2003/11/28/1539.htm
[6]中国互联网络信息中心(CNNIC)《第29次中国互联网络发展状况调查统计报告》[EB/OL]. [2012.1.16] http://www.cnnic.cn/dtygg/dtgg/201201/t20120116_23667.html
[7]刘韵洁.三网融合与电信企业创新[J].中兴通讯技术,2007,13(1)：1-4.
[8]刘韵洁.三网融合与未来网络的发展[J].重庆邮电大学学报(自然科学版).2010(06).
[9]高巍,何宝宏,李洁.全球云计算发展状况与分析[J].电信网技术.2012,(02).
[10]蒋林涛.互联网与物联网[J].电信工程技术与标准化.2010,(02).
[11]L. A. Adamic and B. A. Huberman. Zipfs law and the Internet[J]. Glottometrics, 3:143-150,2002.
[12]Guo, L. and Tan, E. and Chen, S. and Xiao, Z. and Zhang, X. Does Internet Media Traffic Really Follow Zipf-like Distrubution?[J]. PERFORMANCE EVALUATION REVIEW. Vol.35(1), p359,2007.
[13]Morgan Stanley Technology Research reports, The Mobile Internet Report [EB/OL]. www.ms.com/techresearch.
[14]Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, Jonathan Turner, OpenFlow: enabling innovation in campus networks, ACM SIGCOMM Computer Communication Review, v.38 n.2, April 2008.
[15]A. Adelin, P. Owezarski, T. Gayraud, On the impact of monitoring router energy consumption for greening the internet [C]. in:201011th IEEE/ACM International Conference on Grid Computing (GRID),2010, pp.298-304.
[16]Maruti Gupta, Suresh Singh, Greening of the internet [C]. Proceedings of the 2003 Conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29,2003, Karlsruhe, Germany.
[17]Davie, B., Lawrence, J., McCloghrie, K., Rekhter, Y., Rosen, E., Swallow, G. and P. Doolan, "MPLS using LDP and ATM VC Switching" [R]. RFC 3035, January 2001.
[18]李晓辉,顾华玺,党岚君,移动IP技术与网络移动性,国防工业出版社,2009-05-01.
[19]王三海,杨放春.下一代网络端到端QoS体系的研究[J].北京邮电大学学报,2004,(S1).
[20]IP Security Protocol (ipsec). [EB/OL]. http://datatracker.ietf.org/wg/ipsec/
[21]NSF 100*100 Clean Slate Program [EB/OL]. http://100x100network.org.
[22]FIND, SING, NGNI. [EB/OL]. http://www.nsf. go v/cise/funding/2007_12_net__sci_eng.jsp
[23]Future Internet Design (FIND) project[EB/OL]. http://www.nets-find.net/index.php
[24]An Arehitecture for a Diversified Internet [EB/OL]. http://www.nets-find.net/Funded/Diversifiedlnternet.php.
[25]CABO:Concurrent Architectures are Better than One [OL]. http://www.nets-find.net/Funded/Cabo.Php.
[26]GENI at a Glance PDF with GENI FAQs[EB/OL]. http://www.geni.net/wp-content/uploads/2011/06/GENI-at-a-Glance-1 Jun2011.pd f
[27]About GENI, [EB/OL]. http://www.geni.net/?page_id=2
[28]Research-Clean Slate Design for the Internet[EB/OL]. http://cleanslate.stanford.edu/research_projects.php
[29]McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow:enabling innovation in campus networks [J]. ACM SIGCOMM Computer Communication Review, 2008,38(2):69-74
[30]Future Internet Research and Experimentation (FIRE) Project. [EB/OL]. http://cordis.europa.eu/fp7/ict/fire/home_en.html
[31]Anastasius Gavras, Arto Karila, Serge Fdida, Martin May, Martin Potts, Future internet research and experimentation:the FIRE initiative. [J], ACM SIGCOMM Computer Communication Review, v.37 n.3, July 2007.
[32]The FP74WARD Project:Overview. [EB/OL]. http://www.4ward-project.eu/index.php?s=overview.
[33]AKARI Architecture Conceputual Design Documents. [EB/OL]. http://akari-project.nict.go.jp/eng/concept-design/AKARI_fulltext_e_preliminary_ver2.pdf.
[34]唐晖,林涛,范典,侯自强.开展后IP技术研究发展互联网下一代[J],中国科学院院刊,2010-01-15
[35]Network Science and Engineering (NetSE) Project. [EB/OL]. http://www.cra.org/ccc/netse.php.
[36]Focus Group on Future Networks (FGFN). [EB/OL]. http://www.itu.int/dms_pub/itu-t/oth/3A/05/T3A050000170002MSWE.doc.
[37]L. Peterson, S. Shenker, J. Turner. Overcoming the Internet impasse through virtualization [J]. IEEE Computer Magazine,2005,38(4):34-1.
[38]吕博,网络虚拟化资源管理架构与映射算法研究,[学位论文],北京邮电大学,2011.
[39]Ananthl, Sundararaj, AshishGuPta, etal. Dynamic Topology adaptation of virtual networks of virtual machines [C]. ACM International Conference Proceeding Series,2004:1-8.
[40]Pan, J., Paul, S., Jain, R. A Survey of the Research on Future Internet Architectures [J]. IEEE Comm. Magazine,49 (7):26-36. July 2011.
[1]Thomas Anderson, Larry Peterson, etc. Overcoming the Internet Impasse through Virtualization[J]. IEEE Computer Magazine,2005,38(4):34-41.
[2]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.
[3]David Taylor, Jonathan Turner. Towards a Diversified Internet [EB/OL]. http://www.arl.wustl.edu/netv/contrib/.2004.
[4]CABO:Concurrent Architectures are Better than One [OL]. http://www.nets-find.net/Funded/Cabo.Php.
[5]GENI projects. [EB/OL]. [2010.10.02]. http://www.geni.net.
[6]http://internethealthreport.com
[7]The FP74WARD Project:Overview. [OL]. http://www.4ward-project.eu/index.php?s=overview.
[8]D. Joseph, J. Kannan, A. Kubota, K. Lakshminarayanan, I. Stoica, and K. Wehrle, OCALA:An architecture for supporting legacy applications over overlays[C]. in Proc. Networked Systems Design and Implementation, May 2006.
[9]H. V. Madhyatha, A. Venkataramani, A. Krishnamurthy, and T. Anderson. Oasis: An overlay-aware network stack[C]. in Proc. ACM SIGOPS, January 2006.
[10]"GENI opt-in working group." http://geni.net/wg/opt-in-wg.html.
[11]GENI System Requirements[EB/OL]. http://www.geni.net.
[12]OpenFlow 计划[EB/OL]. http://www.openflowswitch.org/
[13]JGN2+Project [EB/OL]. http://www.jgn.nict.go.jp/english/about-us/index.html.
[14]GENI计划[EB/OL]. http://www.geni.net/.
[15]GENI System Overview, [EB/OL]. www.cra.org/ccc/docs/GENISysOvrvw092908.pdf.
[16]Overview of the GENI Architecture, http://groups.geni.net/geni/attachment/wiki/OldGPGDesignDocuments/GDD-07-43.pdf.
[17]Nick McKeown, Tom Anderson, Hari Balakrishnan, etal.OPenFlow:Enabling Innovation in Campus Networks. ACMSIGCOMM Computer Communication Review,2008,38(2):69-74.
[18]Rob Sherwood, Glen Gibb, Kok-Kiong YaP. Flow Visor:A Network Virtualization Layer. Technical Report, Stanford University, Jan2009.
[19]Marquezan, C.C.; Granville, L.Z.; Nunzi, G.; Brunner, M. "Distributed autonomic resource management for network virtualization",IEEE Network Operations and Allocation Symposium (NOMS).2010,463-470.
[20]Ines HOUIDI, Wajdi LOUATI, Djamal ZEGHLACHE. A Distributed and Autonomic Virtual Network Mapping Framework. Fourth International Conference on Autonomic and Autonomous Systems,2008:241-247.
[21]吕博,网络虚拟化资源管理架构与映射算法研究,[博士学位论文],北京邮电大学,2011.
[22]XML Tutorial [EB/OL]. www.w3schools.com/xml/.
[23]韩言妮,覃毅芳,慈松.未来网络虚拟化关键技术研究[J].中兴通讯技术.2011(02)
[1]M.Yu, Y.Yi, J.Rexford, M.Chiang. Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SICCOMM Computer Communication Review,2008,38(2), pp.17-29
[2]I.Houidi, W.Loutai, D.Zeghlache. A distributed virtual network mapping algorithm. Proc of IEEE ICC,2008,565-578.
[3]N.M.M.K.Chowdhury, M.R.Rahman, R.Boutaba. Virtual network embedding with coordinated node and link mapping. Proc of IEEE INFOCOM,2009, pp.783-791
[4]W Szeto, Y Iraqi, R Boutaba. A multi-commodity flow based approach to virtual network resource allocation [A]. IEEE GLOBECOM[C]. San Francisco:IEEE Press,2003.3004-3008.
[5]Yong Zhu, Mostafa Ammar. Algorithms for assigning substrate network resources to virtual network components[C]. IEEE International Conference on Computer Communications (INFOCOM) [C]. Barcelona:IEEE Press,2006.1-12.
[6]Y.Zhou, Y.Li, D.P.Jin. A virtual network embedding scheme with two-stage node mapping based on physical resource migration. Proc of ICCS,2010, pp.761-766
[7]R.Rieei, C.Alfeld, andJ.LePreau. A Solver for the Network Testbed Mapping Problem, ACMCCR,2003,33(2):65-81.
[8]J. Fan, M.Ammar. Dynamic topology configuration in service overlay networks:A study of reconfiguration Policies. IEEE. INFOCOM,2006:1-12.
[9]A*Gupta, J'Kleinberg, A'Kumar, etal. Provisioning a virtual Private network: A network design Problem for multi-commodity flow. In ACM STOC, 2001:389-398.
[10]W.Szeto, Y.Iraqi, R.Boutaba. A Multi-Commodity Flow based Approach to Virtual Network Resource Allocation.In IEEE GLOBECOM,2003:3004-3008.
[11]J. Lu, J. Turner. Efficient Mapping of Virtual Networks onto a Shared Substrate [EB/OL]. Technical Report WUCSE-2006-35. Washington University,2006.
[12]Capone A, Elias J, and Martignon F. Routing and resource optimization in service overlay networks [J]. Elsevier Computer Networks,2009,53(2): 180-190.
[13]吕博,网络虚拟化资源管理架构与映射算法研究,[学位论文],北京邮电大学,2011.
[14]J.Lischka, H.Karl. A virtual network mapping algorithm based on subgraph isomorphism detection. VISA,2009,81-88.
[15]S. Even, A. Itai, and A. Shamir. On the complexity of time table and multi-commodity flow problems. In 16th Annual Symposium on Foundations of Computer Science, pages 184-193,1975.
[16]Thomas H. Cormen、 Charles E. Leiserson、Ronald L. Rivest and Clifford Stein. 29. Introduction to Algorithms.2nd edition. MIT Press and McGraw-Hill.2001 [1990]:788-789.
[17]S. Even and A. Itai and A. Shamir. On the Complexity of Timetable and Multicommodity Flow Problems. SIAM Journal on Computing. SIAM.1976,5 (4):691-703.
[18]George Karakostas. Faster approximation schemes for fractional multicommodity flow problems. Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms.2002:pp.166-173.
[19]R.K.Ahuja, T.L.Magnanti, J.B.Orlin. Network Flows:Theory, Algorithms, and Applications. Prentice Hall, February 1993.
[20]M.R.Bussieck and A.Drud. SBB:A new solver for mixed integer nonlinear programming. In Recent Advances in nonlinear Mixed Integer Optimization. INFORMS Fall,2000. Invited talk.
[21]Jeff T. Linderoth, and Martin W. P. Savelsbergh, "A Computational Study of Search Strategies for Mixed Integer Programming." INFORMS Journal on Computing, Vol.11, Nr.2 (1999), p.173-187.
[22]Prabhakar Raghavan, Clark D. Tompson, "Randomized rounding:a technique for provably good algorithms and algorithmic proofs," Combinatorica, v.7 n.4, p.365-374, Dec,1987
[23]Neal E. Young, "Randomized rounding without solving the linear program," Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.170-178, January 22-24,1995.
[24]C. Chekuri, J. Vondrak, R. Zenklusen, "Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures," 2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE 575-584.
[25]Benjamin Doerr, "Non-independent randomized rounding," Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14,2003, Baltimore, Maryland.
[26]D. Bertsimas, C. Teo, and R. Vohra. On dependent randomized rounding algorithms. Oper. Res. Lett.,24:105-114,1999.
[27]N. Alon and J. H. Spencer, The Probabilistic Method,2nd ed., John Wiley & Sons, New York,2000.
[28]离散事件仿真工具, http://www.mosharaf.com/ViNE-Yard.tar.gz.
[29]S. Yook, H. Jeong, and A. Barabasi, "Modeling the internet's large-scale topology," Proc. Nati. Acad. Sci. USA 99,13382-13386. (2002).
[30]E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internetwork," in Proceedings of IEEE INFOCOM,1996, pp.594-602.
[31]"GNU Linear Programming Kit," http://www.gnu.org/software/glpk/.
[1]"Cisco opening up IOS," December 2007. http://www.networkworld.com/news/2007/121207-cisco-ios.html.
[2]"Partner Solution Development Platfonn Opens Opportunity to Accelerate the Pace of Network Innovation with JUNOS Software," December 2007. http://www.juniper.net/company/presscenter/pr/2007/pr-071210.html.
[3]T. Anderson, L. Peterson, S. Shenker, and J. Turner. Overcoming the Internet impasse through virtualization. Computer, vol.38, pp.34-41, April 2005.
[4]J. S. Turner and D. E. Taylor. Diversifying the Internet[C]. in Proc. IEEE GLOBECOM, November 2005.
[5]Aun Haider, Riehard Potter, Akihiro Nakao. Challenges in Resource Allocation in Network Virtualization[C].20th ITC Specialist Seminar,2009.
[6]E.W.M.Wong, A.K.M.Chan, T.S.P.Yum. A taxonomy of rerouting in circuit Switched networks. Communications Magazine, IEEE,1999,37(11):116-122.
[7]Y. Zhu and M. Ammar. Algorithms for assigning substrate network resources to virtual network components[C]. Proc. of IEEE INFOCOM,2006.
[8]N. F. Butt, M. Chowdhury, R. Boutaba. Topology-Awareness and Re-optimization Mechanism for Virtual Network Embedding[C]. In Proceedings of the 9th IFIP NETWORKING Conference,2010:27-39。
[9]J. Shamsi and M. Broekmeyer, QoSMaP:QoS aware Mapping of Virtual Networks for Resiliency and Effieiency[C]. Proc. of IEEE Globlecom Workshops,2007:1-6.
[10]J. He, R. Shen, Y. Li, C. Lee, J. Rexford, and M. Chiang. DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet[C]. ACM CoNEXT Conference,2008.
[11]M. Chiang, S. H. Low, R. A. Calderbank, and J. C. Doyle, " Layering as optimization decomposition," Proceedings of the IEEE, January 2007.
[12]Saul I. Gass. Linear Programming:Methods and Applications. Courier Dover Publications,2010-11-18, pp544.
[13]石勇.多目标线性决策系统-理论及应用.第1版.高等教育出版社2007-01
[14]Paul Armand. Finding all maximal efficient faces in multiobjective linear programming [J]. Mathematical Programming,1993,61(1-3).
[15]D. Dutta, R.N. Tiwari, J.R. Rao. Multiple objective linear fractional programming—a fuzzy set theoretic approach[J]. Fuzzy Sets and Systems,52 (1992), pp.39-45
[16]R. Braden, D. Clark, and S. Shenker. Integrated Services in the Internet Architecture:An Overview[R]. RFC 1633, June 1994.
[17]S. Chen and K. Nahrstedt. An overview of quality-of-service routing for the next generation high-speed networks:Problems and solutions[J]. IEEE Network Magazine, November/December 1998.
[18]F. Kuipers, T. Korkmaz, M. Krunz, and P. V. Mieghem. Overview of constraint-based path selection algorithms for QoS routing[J]. IEEE Communication Magazine, pp.50-55, December 2002.
[19]S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An Architecture for Differentiated Services[R]. RFC 2475, October 1998.
[20]I. Matta and A. U. Shankar, "Type-of-service routing in datagram delivery systems," IEEE J. on Selected Areas in Communications, vol.13, pp.1411-1425, October 1995.
[21]D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient Overlay Networks," in Proc. Symposium on Operating Systems Principles, October 2001.
[22]D. X. Wei, C. Jin, S. H. Low, and S. Hegde, "FAST TCP:Motivation, architecture, algorithms, performance," IEEE/ACM Trans. Networking, December 2006.
[23]J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. O'Toole, "Overcast:Reliable multicasting with an overlay network," in Proc. Operating Systems Design and Implementation, October 2000.
[24]Y. Chu, S. G. Rao, S. Seshan, and H. Zhang, "Enabling conferencing applications on the Internet using an overlay multicast architecture," in Proc. ACM SIGCOMM, August 2001.
[25]L. Subramanian, I. Stoica, H. Balakrishnan, and R. Katz, "OverQoS:An overlay based architecture for enhancing Internet QoS," in Proc. Networked Systems Design and Implementation, September 2004.
[26]R. Keralapura, C.-N. Chuah, N. Taft, and G. Iannaccone, "Race conditions in coexisting overlay networks," IEEE/ACM Trans. Networking, vol.16, no.1, pp. 1-14,2008.
[27]J. He and J. Rexford, "Towards Internet-wide Multipath Routing," IEEE Network Magazine, March 2008.Saul I. Gass. Linear Programming:Methods and Applications. Courier Dover Publications,2010-11-18
[1]Sapan Bhatia, Murtaza Motiwala, Wolfgang Muhlbauer, Vytautas Valancius, Andy Bavier, Nick Feamster, Larry Peterson, and Jennifer Rexford. Trellis:A Platform for Building Flexible, Fast Virtual Networks on Commodity Hardware. ACM CoNEXT Conference,2008.
[2]McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow:enabling innovation in campus networks [J]. ACM SIGCOMM Computer Communication Review, 2008,38(2):69-74
[3]Paul Barham, Boris Dragovic, Keir Fraser, Steven Hand, Tim Harris, Alex Ho, Rolf Neugebauer, Ian Pratt and Andrew Warfield. Xen and the art of virtualization. Proceedings of the nineteenth ACM symposium on Operating systems principles, 2003, vol.37, no.5, pp.164-177
[4]Robert Morris, Eddie Kohler, John Jannotti, and M. Frans Kaashoek. The Click modular router[J]. ACM Symposium on Operating Systems Principles,1999.
[5]Mark Handley, Orion Hodson, Eddie Kohler, XORP:an open platform for network research[J]. ACM SIGCOMM Computer Communication Review, v.33 n.l, p.53-57, January 2003.
[6]Mukwevho, Mukosi Abraham. A Virtual Integrated Network Emulator on Xen (viNex). IEEE ICST 2009.
[7]Cacti. Cacti:The complete rrdtool-based graphing solution. [EB/OL]. http://www.cacti.net/screenshots.php.
[8]EUSUFF M M, LANSEY K E. Water distribution network design using the shuffled frog leaping algorithm [A]. World Water Congress [C] 2001
[9]V. Balakrishnan, S. Boyd, and S. Balemi. Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems. Int.J. of Robust and Nonlinear Control,1(4):295-317, October-December 1991.
[10]EUSUFF M M, LANSEY K E. Optimization of water distribution network design using the shufled frog leaping algorithm[J]. J Water Resource Plan Manage,2003,129(3):10-25.
[11]Elbctagi E, Hegozy T, Grierson D. Comparison among five evolutionary-based optimization algorithms[J]. Advanced engineering Informatics,2005,19(1): 43-53.
[12]Elbehairy H, Elbeltagi E, Hegazy T, et al. Comparison of. teo evolutionary algorithms for optimization of bridge deck repairs[J]. Computer-aided Civil and Infrastructure Engineering,2006,21:561-572.
[2]Haring, Bruce. "Who Really Invented the Net?" [J]. USA Today, September 2, 1999.
[3]Rogers, J.D.Internetworking and the politics of science:NSFNET in Internet history[J].The Information Society. vol.14(3), p213-228.1998.
[4]ANSNET. [EB/OL]. http://www.cs.sfu.ca/-tamaras/theInternetP2/ANSNET.html
[5]中国第一封电子邮件.[EB/OL]. http://www.cnnic.cn/html/Dir/2003/11/28/1539.htm
[6]中国互联网络信息中心(CNNIC)《第29次中国互联网络发展状况调查统计报告》[EB/OL]. [2012.1.16] http://www.cnnic.cn/dtygg/dtgg/201201/t20120116_23667.html
[7]刘韵洁.三网融合与电信企业创新[J].中兴通讯技术,2007,13(1)：1-4.
[8]刘韵洁.三网融合与未来网络的发展[J].重庆邮电大学学报(自然科学版).2010(06).
[9]高巍,何宝宏,李洁.全球云计算发展状况与分析[J].电信网技术.2012,(02).
[10]蒋林涛.互联网与物联网[J].电信工程技术与标准化.2010,(02).
[11]L. A. Adamic and B. A. Huberman. Zipfs law and the Internet[J]. Glottometrics, 3:143-150,2002.
[12]Guo, L. and Tan, E. and Chen, S. and Xiao, Z. and Zhang, X. Does Internet Media Traffic Really Follow Zipf-like Distrubution?[J]. PERFORMANCE EVALUATION REVIEW. Vol.35(1), p359,2007.
[13]Morgan Stanley Technology Research reports, The Mobile Internet Report [EB/OL]. www.ms.com/techresearch.
[14]Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, Jonathan Turner, OpenFlow: enabling innovation in campus networks, ACM SIGCOMM Computer Communication Review, v.38 n.2, April 2008.
[15]A. Adelin, P. Owezarski, T. Gayraud, On the impact of monitoring router energy consumption for greening the internet [C]. in:201011th IEEE/ACM International Conference on Grid Computing (GRID),2010, pp.298-304.
[16]Maruti Gupta, Suresh Singh, Greening of the internet [C]. Proceedings of the 2003 Conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29,2003, Karlsruhe, Germany.
[17]Davie, B., Lawrence, J., McCloghrie, K., Rekhter, Y., Rosen, E., Swallow, G. and P. Doolan, "MPLS using LDP and ATM VC Switching" [R]. RFC 3035, January 2001.
[18]李晓辉,顾华玺,党岚君,移动IP技术与网络移动性,国防工业出版社,2009-05-01.
[19]王三海,杨放春.下一代网络端到端QoS体系的研究[J].北京邮电大学学报,2004,(S1).
[20]IP Security Protocol (ipsec). [EB/OL]. http://datatracker.ietf.org/wg/ipsec/
[21]NSF 100*100 Clean Slate Program [EB/OL]. http://100x100network.org.
[22]FIND, SING, NGNI. [EB/OL]. http://www.nsf. go v/cise/funding/2007_12_net__sci_eng.jsp
[23]Future Internet Design (FIND) project[EB/OL]. http://www.nets-find.net/index.php
[24]An Arehitecture for a Diversified Internet [EB/OL]. http://www.nets-find.net/Funded/Diversifiedlnternet.php.
[25]CABO:Concurrent Architectures are Better than One [OL]. http://www.nets-find.net/Funded/Cabo.Php.
[26]GENI at a Glance PDF with GENI FAQs[EB/OL]. http://www.geni.net/wp-content/uploads/2011/06/GENI-at-a-Glance-1 Jun2011.pd f
[27]About GENI, [EB/OL]. http://www.geni.net/?page_id=2
[28]Research-Clean Slate Design for the Internet[EB/OL]. http://cleanslate.stanford.edu/research_projects.php
[29]McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow:enabling innovation in campus networks [J]. ACM SIGCOMM Computer Communication Review, 2008,38(2):69-74
[30]Future Internet Research and Experimentation (FIRE) Project. [EB/OL]. http://cordis.europa.eu/fp7/ict/fire/home_en.html
[31]Anastasius Gavras, Arto Karila, Serge Fdida, Martin May, Martin Potts, Future internet research and experimentation:the FIRE initiative. [J], ACM SIGCOMM Computer Communication Review, v.37 n.3, July 2007.
[32]The FP74WARD Project:Overview. [EB/OL]. http://www.4ward-project.eu/index.php?s=overview.
[33]AKARI Architecture Conceputual Design Documents. [EB/OL]. http://akari-project.nict.go.jp/eng/concept-design/AKARI_fulltext_e_preliminary_ver2.pdf.
[34]唐晖,林涛,范典,侯自强.开展后IP技术研究发展互联网下一代[J],中国科学院院刊,2010-01-15
[35]Network Science and Engineering (NetSE) Project. [EB/OL]. http://www.cra.org/ccc/netse.php.
[36]Focus Group on Future Networks (FGFN). [EB/OL]. http://www.itu.int/dms_pub/itu-t/oth/3A/05/T3A050000170002MSWE.doc.
[37]L. Peterson, S. Shenker, J. Turner. Overcoming the Internet impasse through virtualization [J]. IEEE Computer Magazine,2005,38(4):34-1.
[38]吕博,网络虚拟化资源管理架构与映射算法研究,[学位论文],北京邮电大学,2011.
[39]Ananthl, Sundararaj, AshishGuPta, etal. Dynamic Topology adaptation of virtual networks of virtual machines [C]. ACM International Conference Proceeding Series,2004:1-8.
[40]Pan, J., Paul, S., Jain, R. A Survey of the Research on Future Internet Architectures [J]. IEEE Comm. Magazine,49 (7):26-36. July 2011.
[1]Thomas Anderson, Larry Peterson, etc. Overcoming the Internet Impasse through Virtualization[J]. IEEE Computer Magazine,2005,38(4):34-41.
[2]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.
[3]David Taylor, Jonathan Turner. Towards a Diversified Internet [EB/OL]. http://www.arl.wustl.edu/netv/contrib/.2004.
[4]CABO:Concurrent Architectures are Better than One [OL]. http://www.nets-find.net/Funded/Cabo.Php.
[5]GENI projects. [EB/OL]. [2010.10.02]. http://www.geni.net.
[6]http://internethealthreport.com
[7]The FP74WARD Project:Overview. [OL]. http://www.4ward-project.eu/index.php?s=overview.
[8]D. Joseph, J. Kannan, A. Kubota, K. Lakshminarayanan, I. Stoica, and K. Wehrle, OCALA:An architecture for supporting legacy applications over overlays[C]. in Proc. Networked Systems Design and Implementation, May 2006.
[9]H. V. Madhyatha, A. Venkataramani, A. Krishnamurthy, and T. Anderson. Oasis: An overlay-aware network stack[C]. in Proc. ACM SIGOPS, January 2006.
[10]"GENI opt-in working group." http://geni.net/wg/opt-in-wg.html.
[11]GENI System Requirements[EB/OL]. http://www.geni.net.
[12]OpenFlow 计划[EB/OL]. http://www.openflowswitch.org/
[13]JGN2+Project [EB/OL]. http://www.jgn.nict.go.jp/english/about-us/index.html.
[14]GENI计划[EB/OL]. http://www.geni.net/.
[15]GENI System Overview, [EB/OL]. www.cra.org/ccc/docs/GENISysOvrvw092908.pdf.
[16]Overview of the GENI Architecture, http://groups.geni.net/geni/attachment/wiki/OldGPGDesignDocuments/GDD-07-43.pdf.
[17]Nick McKeown, Tom Anderson, Hari Balakrishnan, etal.OPenFlow:Enabling Innovation in Campus Networks. ACMSIGCOMM Computer Communication Review,2008,38(2):69-74.
[18]Rob Sherwood, Glen Gibb, Kok-Kiong YaP. Flow Visor:A Network Virtualization Layer. Technical Report, Stanford University, Jan2009.
[19]Marquezan, C.C.; Granville, L.Z.; Nunzi, G.; Brunner, M. "Distributed autonomic resource management for network virtualization",IEEE Network Operations and Allocation Symposium (NOMS).2010,463-470.
[20]Ines HOUIDI, Wajdi LOUATI, Djamal ZEGHLACHE. A Distributed and Autonomic Virtual Network Mapping Framework. Fourth International Conference on Autonomic and Autonomous Systems,2008:241-247.
[21]吕博,网络虚拟化资源管理架构与映射算法研究,[博士学位论文],北京邮电大学,2011.
[22]XML Tutorial [EB/OL]. www.w3schools.com/xml/.
[23]韩言妮,覃毅芳,慈松.未来网络虚拟化关键技术研究[J].中兴通讯技术.2011(02)
[1]M.Yu, Y.Yi, J.Rexford, M.Chiang. Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SICCOMM Computer Communication Review,2008,38(2), pp.17-29
[2]I.Houidi, W.Loutai, D.Zeghlache. A distributed virtual network mapping algorithm. Proc of IEEE ICC,2008,565-578.
[3]N.M.M.K.Chowdhury, M.R.Rahman, R.Boutaba. Virtual network embedding with coordinated node and link mapping. Proc of IEEE INFOCOM,2009, pp.783-791
[4]W Szeto, Y Iraqi, R Boutaba. A multi-commodity flow based approach to virtual network resource allocation [A]. IEEE GLOBECOM[C]. San Francisco:IEEE Press,2003.3004-3008.
[5]Yong Zhu, Mostafa Ammar. Algorithms for assigning substrate network resources to virtual network components[C]. IEEE International Conference on Computer Communications (INFOCOM) [C]. Barcelona:IEEE Press,2006.1-12.
[6]Y.Zhou, Y.Li, D.P.Jin. A virtual network embedding scheme with two-stage node mapping based on physical resource migration. Proc of ICCS,2010, pp.761-766
[7]R.Rieei, C.Alfeld, andJ.LePreau. A Solver for the Network Testbed Mapping Problem, ACMCCR,2003,33(2):65-81.
[8]J. Fan, M.Ammar. Dynamic topology configuration in service overlay networks:A study of reconfiguration Policies. IEEE. INFOCOM,2006:1-12.
[9]A*Gupta, J'Kleinberg, A'Kumar, etal. Provisioning a virtual Private network: A network design Problem for multi-commodity flow. In ACM STOC, 2001:389-398.
[10]W.Szeto, Y.Iraqi, R.Boutaba. A Multi-Commodity Flow based Approach to Virtual Network Resource Allocation.In IEEE GLOBECOM,2003:3004-3008.
[11]J. Lu, J. Turner. Efficient Mapping of Virtual Networks onto a Shared Substrate [EB/OL]. Technical Report WUCSE-2006-35. Washington University,2006.
[12]Capone A, Elias J, and Martignon F. Routing and resource optimization in service overlay networks [J]. Elsevier Computer Networks,2009,53(2): 180-190.
[13]吕博,网络虚拟化资源管理架构与映射算法研究,[学位论文],北京邮电大学,2011.
[14]J.Lischka, H.Karl. A virtual network mapping algorithm based on subgraph isomorphism detection. VISA,2009,81-88.
[15]S. Even, A. Itai, and A. Shamir. On the complexity of time table and multi-commodity flow problems. In 16th Annual Symposium on Foundations of Computer Science, pages 184-193,1975.
[16]Thomas H. Cormen、 Charles E. Leiserson、Ronald L. Rivest and Clifford Stein. 29. Introduction to Algorithms.2nd edition. MIT Press and McGraw-Hill.2001 [1990]:788-789.
[17]S. Even and A. Itai and A. Shamir. On the Complexity of Timetable and Multicommodity Flow Problems. SIAM Journal on Computing. SIAM.1976,5 (4):691-703.
[18]George Karakostas. Faster approximation schemes for fractional multicommodity flow problems. Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms.2002:pp.166-173.
[19]R.K.Ahuja, T.L.Magnanti, J.B.Orlin. Network Flows:Theory, Algorithms, and Applications. Prentice Hall, February 1993.
[20]M.R.Bussieck and A.Drud. SBB:A new solver for mixed integer nonlinear programming. In Recent Advances in nonlinear Mixed Integer Optimization. INFORMS Fall,2000. Invited talk.
[21]Jeff T. Linderoth, and Martin W. P. Savelsbergh, "A Computational Study of Search Strategies for Mixed Integer Programming." INFORMS Journal on Computing, Vol.11, Nr.2 (1999), p.173-187.
[22]Prabhakar Raghavan, Clark D. Tompson, "Randomized rounding:a technique for provably good algorithms and algorithmic proofs," Combinatorica, v.7 n.4, p.365-374, Dec,1987
[23]Neal E. Young, "Randomized rounding without solving the linear program," Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.170-178, January 22-24,1995.
[24]C. Chekuri, J. Vondrak, R. Zenklusen, "Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures," 2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE 575-584.
[25]Benjamin Doerr, "Non-independent randomized rounding," Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14,2003, Baltimore, Maryland.
[26]D. Bertsimas, C. Teo, and R. Vohra. On dependent randomized rounding algorithms. Oper. Res. Lett.,24:105-114,1999.
[27]N. Alon and J. H. Spencer, The Probabilistic Method,2nd ed., John Wiley & Sons, New York,2000.
[28]离散事件仿真工具, http://www.mosharaf.com/ViNE-Yard.tar.gz.
[29]S. Yook, H. Jeong, and A. Barabasi, "Modeling the internet's large-scale topology," Proc. Nati. Acad. Sci. USA 99,13382-13386. (2002).
[30]E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internetwork," in Proceedings of IEEE INFOCOM,1996, pp.594-602.
[31]"GNU Linear Programming Kit," http://www.gnu.org/software/glpk/.
[1]"Cisco opening up IOS," December 2007. http://www.networkworld.com/news/2007/121207-cisco-ios.html.
[2]"Partner Solution Development Platfonn Opens Opportunity to Accelerate the Pace of Network Innovation with JUNOS Software," December 2007. http://www.juniper.net/company/presscenter/pr/2007/pr-071210.html.
[3]T. Anderson, L. Peterson, S. Shenker, and J. Turner. Overcoming the Internet impasse through virtualization. Computer, vol.38, pp.34-41, April 2005.
[4]J. S. Turner and D. E. Taylor. Diversifying the Internet[C]. in Proc. IEEE GLOBECOM, November 2005.
[5]Aun Haider, Riehard Potter, Akihiro Nakao. Challenges in Resource Allocation in Network Virtualization[C].20th ITC Specialist Seminar,2009.
[6]E.W.M.Wong, A.K.M.Chan, T.S.P.Yum. A taxonomy of rerouting in circuit Switched networks. Communications Magazine, IEEE,1999,37(11):116-122.
[7]Y. Zhu and M. Ammar. Algorithms for assigning substrate network resources to virtual network components[C]. Proc. of IEEE INFOCOM,2006.
[8]N. F. Butt, M. Chowdhury, R. Boutaba. Topology-Awareness and Re-optimization Mechanism for Virtual Network Embedding[C]. In Proceedings of the 9th IFIP NETWORKING Conference,2010:27-39。
[9]J. Shamsi and M. Broekmeyer, QoSMaP:QoS aware Mapping of Virtual Networks for Resiliency and Effieiency[C]. Proc. of IEEE Globlecom Workshops,2007:1-6.
[10]J. He, R. Shen, Y. Li, C. Lee, J. Rexford, and M. Chiang. DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet[C]. ACM CoNEXT Conference,2008.
[11]M. Chiang, S. H. Low, R. A. Calderbank, and J. C. Doyle, " Layering as optimization decomposition," Proceedings of the IEEE, January 2007.
[12]Saul I. Gass. Linear Programming:Methods and Applications. Courier Dover Publications,2010-11-18, pp544.
[13]石勇.多目标线性决策系统-理论及应用.第1版.高等教育出版社2007-01
[14]Paul Armand. Finding all maximal efficient faces in multiobjective linear programming [J]. Mathematical Programming,1993,61(1-3).
[15]D. Dutta, R.N. Tiwari, J.R. Rao. Multiple objective linear fractional programming—a fuzzy set theoretic approach[J]. Fuzzy Sets and Systems,52 (1992), pp.39-45
[16]R. Braden, D. Clark, and S. Shenker. Integrated Services in the Internet Architecture:An Overview[R]. RFC 1633, June 1994.
[17]S. Chen and K. Nahrstedt. An overview of quality-of-service routing for the next generation high-speed networks:Problems and solutions[J]. IEEE Network Magazine, November/December 1998.
[18]F. Kuipers, T. Korkmaz, M. Krunz, and P. V. Mieghem. Overview of constraint-based path selection algorithms for QoS routing[J]. IEEE Communication Magazine, pp.50-55, December 2002.
[19]S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An Architecture for Differentiated Services[R]. RFC 2475, October 1998.
[20]I. Matta and A. U. Shankar, "Type-of-service routing in datagram delivery systems," IEEE J. on Selected Areas in Communications, vol.13, pp.1411-1425, October 1995.
[21]D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient Overlay Networks," in Proc. Symposium on Operating Systems Principles, October 2001.
[22]D. X. Wei, C. Jin, S. H. Low, and S. Hegde, "FAST TCP:Motivation, architecture, algorithms, performance," IEEE/ACM Trans. Networking, December 2006.
[23]J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. O'Toole, "Overcast:Reliable multicasting with an overlay network," in Proc. Operating Systems Design and Implementation, October 2000.
[24]Y. Chu, S. G. Rao, S. Seshan, and H. Zhang, "Enabling conferencing applications on the Internet using an overlay multicast architecture," in Proc. ACM SIGCOMM, August 2001.
[25]L. Subramanian, I. Stoica, H. Balakrishnan, and R. Katz, "OverQoS:An overlay based architecture for enhancing Internet QoS," in Proc. Networked Systems Design and Implementation, September 2004.
[26]R. Keralapura, C.-N. Chuah, N. Taft, and G. Iannaccone, "Race conditions in coexisting overlay networks," IEEE/ACM Trans. Networking, vol.16, no.1, pp. 1-14,2008.
[27]J. He and J. Rexford, "Towards Internet-wide Multipath Routing," IEEE Network Magazine, March 2008.Saul I. Gass. Linear Programming:Methods and Applications. Courier Dover Publications,2010-11-18
[1]Sapan Bhatia, Murtaza Motiwala, Wolfgang Muhlbauer, Vytautas Valancius, Andy Bavier, Nick Feamster, Larry Peterson, and Jennifer Rexford. Trellis:A Platform for Building Flexible, Fast Virtual Networks on Commodity Hardware. ACM CoNEXT Conference,2008.
[2]McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow:enabling innovation in campus networks [J]. ACM SIGCOMM Computer Communication Review, 2008,38(2):69-74
[3]Paul Barham, Boris Dragovic, Keir Fraser, Steven Hand, Tim Harris, Alex Ho, Rolf Neugebauer, Ian Pratt and Andrew Warfield. Xen and the art of virtualization. Proceedings of the nineteenth ACM symposium on Operating systems principles, 2003, vol.37, no.5, pp.164-177
[4]Robert Morris, Eddie Kohler, John Jannotti, and M. Frans Kaashoek. The Click modular router[J]. ACM Symposium on Operating Systems Principles,1999.
[5]Mark Handley, Orion Hodson, Eddie Kohler, XORP:an open platform for network research[J]. ACM SIGCOMM Computer Communication Review, v.33 n.l, p.53-57, January 2003.
[6]Mukwevho, Mukosi Abraham. A Virtual Integrated Network Emulator on Xen (viNex). IEEE ICST 2009.
[7]Cacti. Cacti:The complete rrdtool-based graphing solution. [EB/OL]. http://www.cacti.net/screenshots.php.
[8]EUSUFF M M, LANSEY K E. Water distribution network design using the shuffled frog leaping algorithm [A]. World Water Congress [C] 2001
[9]V. Balakrishnan, S. Boyd, and S. Balemi. Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems. Int.J. of Robust and Nonlinear Control,1(4):295-317, October-December 1991.
[10]EUSUFF M M, LANSEY K E. Optimization of water distribution network design using the shufled frog leaping algorithm[J]. J Water Resource Plan Manage,2003,129(3):10-25.
[11]Elbctagi E, Hegozy T, Grierson D. Comparison among five evolutionary-based optimization algorithms[J]. Advanced engineering Informatics,2005,19(1): 43-53.
[12]Elbehairy H, Elbeltagi E, Hegazy T, et al. Comparison of. teo evolutionary algorithms for optimization of bridge deck repairs[J]. Computer-aided Civil and Infrastructure Engineering,2006,21:561-572.