面向服务提供的逻辑承载网构建关键技术研究
|
摘要
多年来，网络一直沿着面向业务支撑的技术体系发展，秉承为承载特定业务构建网络，为融合新兴业务改造网络的网络设计思路。新一代网络的发展趋势是，网络角色已经由终端连接及简单的业务传输演变为丰富的服务提供。为扩展网络核心节点设备对网络业务的承载服务，满足网络可控制、可管理和可运营的综合要求，国家863计划重大项目“新一代高可信网络”启动了子项课题——“可重构路由器构件组研制”。基于构件化思想和可重构技术，产生面向服务提供的新型网络技术体系所需节点设备，其目标就是提供可扩展的网络承载服务，以满足特性差异日益扩大的用户业务承载需求，而关键技术之一就是产生与之相适直的新型网络构建方法。故针对课题研发需求，本文以基于可重构路由器的逻辑承载网构建为研究方向，依托“可重构路由器构件组研制”项目开展研究工作。
本文结合传统网络构建方法和网络虚拟化构建的优势，提出一种基于路由交换节点的一体化承载网络体系架构，研究该体系架构的关键技术——逻辑承载网构建，关注资源分配均衡性对逻辑承载网构建效率的影响及相直优化方法。研究成果可以运用到“新一代高可信网络”项目。本文主要包括如下几个方面的工作：
1、分析了当前网络构建方法的两大分支，即面向业务构建和虚拟网构建。由于基于网络虚拟化的虚拟网构建方法可支持业务多样性，具有灵活、可扩展、易于管理等优点，成为未来网络发展的趋势之一。通过综述及分析以前及正在进行的虚拟网构建典型研究，总结出虚拟网构建面临限制问题研究空间、不注重负载均衡等问题，这些问题影响了所构建网络的性能和资源利用效率。通过研究还发现，当前虚拟网构建研究将所有节点同等对待，并没有充分考虑路由交换节点的特征，导致虚拟网构建方法并不完全适用于由路由交换节点组成的承载网构建。
2、针对当前信息网络结构特点以及网络业务快速发展的特征，提出了基于可重构路由交换平台的一体化承载网络体系架构。它面向服务提供，给出了下一代网络一体化融合的一种模式。对架构的层次结构和工作原理进行了介绍，给出了架构的关键技术即可重构路由交换平台、一体化承载网相关定义及分层构建策略。分析表明：该架构面向服务提供进行逻辑承载网构建，可以较好地为现有网络业务及未来可能出现的大部分网络业务提供柔性服务。
3、研究了基于负载强度的构建算法。基于网络虚拟化的虚拟网拓扑构建，通过节点映射转化为单源单汇问题研究，链路映射时由于大都采用最短路径算法，可能会引起物理网络的资源瓶颈问题。以资源均衡利用为出发点，通过定义逻辑承载网负载强度度量指标，提出均衡负载强度的逻辑承载网构建策略。使得在构建时不仅考虑了路径的可达性，还考虑对后续逻辑承载网构建的影响。仿真结果表明，该算法可以提高逻辑承载网构建的成功率，并增强网络服务提供能力。
4、研究了基于路径分割的构建算法。对逻辑承载网构建需求进行分析，认为可以用多物质流(Multi-Commodity Flow,McF)模型进行求解。为更充分地利用网络资源，结合网络业务特性，提出了对不同服务需求提供不同网络资源的按需承载策略，并基于可用资源和链路负载状态，用改进的最小费用多物质流进行优化计算。仿真结果表明，该算法通过有效利用片资源，增强了网络服务能力。
5、研究了基于长时负载的优化构建算法，解决逻辑承载网动态优化问题。首先分析了网络资源的静态均衡分配，指出其没有考虑逻辑承载网生存时间的影响，并定义了基于sigmoid函数的反映逻辑承载网剩余运行时间的度量指标；其次，基于链路利用率及剩余运行时间研究逻辑承载网的优化重构算法。由仿真结果可以看出，逻辑承载网构建是随时间而变化的动态过程，因此需要动态地对网络资源进行调整，以更有效的提供服务能力。
6、给出了一种一体化承载网实现方案。通过对逻辑承载网构建请求分析，给出可行的分层构建策略、分层管理机制及逻辑承载网构建流程，并对一体化承载网功能实体接口进行了定义和配置。该方案的设计有助于“柔性网络体系”组网试验。
While traditional network architecture, which is traffic-oriented, has been constructed for carrying special traffic and then reconstructed for integrating new types of traffic. In the new generation network, the functions of network have changed from connecting hosts and traffic transferring to abundant service providing. To expand the carrying service capability of network core node equipments, and to meet the requirements of making the network controllable, manageable and operational, "New Generation of Trustworthy Network" of the National High-Tech Research and Development Program of China (863 Program) launches the project of "Research of Reconfigurable Component Router ". Based on Component and reconfigurable technology, new type of service providing-oriented technology architecture is emerging. Providing scalable network-carrying capability and meeting the widening different requirements of all kinds of network traffic are the goals of this architecture, the key of which is to bring out new network-n struction methods. So based on reconfigurable router this thesis is focused on the construction of logical carrying network.
Combining the advantages of traffic-oriented network with virtual network construction methods, a kind of universal carrying network architecture is presented. And this thesis focuses one problem- research on the construction of logical carrying network. The influence of allocation equilibrium of network resource on construction efficiency is also studied. The results of above researches can be applied into the project of "New Generation of Trustworthy Network". This paper includes the following aspects:
1.Firstly by analyzing the current network construction methods, which is traffic-oriented construction and virtual network construction , virtual network construction is considered as being able to support the diversity of network traffic and taking on the characteristics of flexibility and scalability. Network virtualization has become one direction of network development. By summarizing and analyzing ongoing network virtualization research projects, such problems as strict restriction and load unbalancing are found to influence the performance and efficiency of network construction. So, these methods can't be adopted in the carrying network construction which is based on router.
2. Aiming at the characteristics of rapid development of network traffic and current network architectures, universal carrying network architecture based on reconfigurable routing & switching platform is brought forward. It presents a universal developing mode of next generation network. This chapter introduces the hierarchy and working principles as well as key technologies of this architecture. It is shown that the service providing-oriented architecture can provide better carrying service capability for both current and most future network traffic.
3. Stress-based construction algorithm (SCA) is studied for logical carrying network (LCN) construction. Most researches on virtual network may get into the bottleneck problem of physical network resource which comes from shortest path algorithm adopted in link mapping. By defining the parameters of Load Stress to show the network load, SCA is introduced based on stress balancing. SCA pays attention to not only the path attainability of LCN, but also the influence on the succeeding LCN requests. Simulation results indicate that this algorithm can improve the successful construction ratio of LCN and enhance the network service providing capacity.
4. Path splitting based construction algorithm is studied in this chapter. Sometimes, there are plenty of resource fragments left when some LCN have been constructed. In order to fully utilize the physical network resource fragments, path splitting-based on-demand carrying network construction strategy is introduced to provide different resource to meet different service requirements. Base on availab le resource and current link load, an improved min-cost multi-commodity model is used to compute the resource allocation. Simulation results indicate that this algorithm can not only fully utilize resource fragments but also improve network service capability.
5. An optimal construction algorithm is studied based on long time traffic load to solve the problem of dynamic LCN optimization. Parameter of long time traffic load is defined based on Sigmoid function to denote the influence of LCN residual runtime, which has not been paid attention to by static construction algorithms. Then, optimal reconstructing algorithm based on factors such as link utilization and residual runtime of LCN is studied. It can be seen from simulation and analysis results that logical carrying network construction is also a dynamic process in which resource distribution changes along with time. So dynamic adjusting according to need is necessary for LCN construction.
6. A scheme of UCN implementation is given in the end. On the basis of analysis of LCN construction requests, layered management mechanism and feasible LCN construction course are presented. Furthermore, entities in UCN architecture are defined and configured. The design of this scheme will be beneficial to experiments of UCN which are service providing-oriented.
本文结合传统网络构建方法和网络虚拟化构建的优势，提出一种基于路由交换节点的一体化承载网络体系架构，研究该体系架构的关键技术——逻辑承载网构建，关注资源分配均衡性对逻辑承载网构建效率的影响及相直优化方法。研究成果可以运用到“新一代高可信网络”项目。本文主要包括如下几个方面的工作：
1、分析了当前网络构建方法的两大分支，即面向业务构建和虚拟网构建。由于基于网络虚拟化的虚拟网构建方法可支持业务多样性，具有灵活、可扩展、易于管理等优点，成为未来网络发展的趋势之一。通过综述及分析以前及正在进行的虚拟网构建典型研究，总结出虚拟网构建面临限制问题研究空间、不注重负载均衡等问题，这些问题影响了所构建网络的性能和资源利用效率。通过研究还发现，当前虚拟网构建研究将所有节点同等对待，并没有充分考虑路由交换节点的特征，导致虚拟网构建方法并不完全适用于由路由交换节点组成的承载网构建。
2、针对当前信息网络结构特点以及网络业务快速发展的特征，提出了基于可重构路由交换平台的一体化承载网络体系架构。它面向服务提供，给出了下一代网络一体化融合的一种模式。对架构的层次结构和工作原理进行了介绍，给出了架构的关键技术即可重构路由交换平台、一体化承载网相关定义及分层构建策略。分析表明：该架构面向服务提供进行逻辑承载网构建，可以较好地为现有网络业务及未来可能出现的大部分网络业务提供柔性服务。
3、研究了基于负载强度的构建算法。基于网络虚拟化的虚拟网拓扑构建，通过节点映射转化为单源单汇问题研究，链路映射时由于大都采用最短路径算法，可能会引起物理网络的资源瓶颈问题。以资源均衡利用为出发点，通过定义逻辑承载网负载强度度量指标，提出均衡负载强度的逻辑承载网构建策略。使得在构建时不仅考虑了路径的可达性，还考虑对后续逻辑承载网构建的影响。仿真结果表明，该算法可以提高逻辑承载网构建的成功率，并增强网络服务提供能力。
4、研究了基于路径分割的构建算法。对逻辑承载网构建需求进行分析，认为可以用多物质流(Multi-Commodity Flow,McF)模型进行求解。为更充分地利用网络资源，结合网络业务特性，提出了对不同服务需求提供不同网络资源的按需承载策略，并基于可用资源和链路负载状态，用改进的最小费用多物质流进行优化计算。仿真结果表明，该算法通过有效利用片资源，增强了网络服务能力。
5、研究了基于长时负载的优化构建算法，解决逻辑承载网动态优化问题。首先分析了网络资源的静态均衡分配，指出其没有考虑逻辑承载网生存时间的影响，并定义了基于sigmoid函数的反映逻辑承载网剩余运行时间的度量指标；其次，基于链路利用率及剩余运行时间研究逻辑承载网的优化重构算法。由仿真结果可以看出，逻辑承载网构建是随时间而变化的动态过程，因此需要动态地对网络资源进行调整，以更有效的提供服务能力。
6、给出了一种一体化承载网实现方案。通过对逻辑承载网构建请求分析，给出可行的分层构建策略、分层管理机制及逻辑承载网构建流程，并对一体化承载网功能实体接口进行了定义和配置。该方案的设计有助于“柔性网络体系”组网试验。
While traditional network architecture, which is traffic-oriented, has been constructed for carrying special traffic and then reconstructed for integrating new types of traffic. In the new generation network, the functions of network have changed from connecting hosts and traffic transferring to abundant service providing. To expand the carrying service capability of network core node equipments, and to meet the requirements of making the network controllable, manageable and operational, "New Generation of Trustworthy Network" of the National High-Tech Research and Development Program of China (863 Program) launches the project of "Research of Reconfigurable Component Router ". Based on Component and reconfigurable technology, new type of service providing-oriented technology architecture is emerging. Providing scalable network-carrying capability and meeting the widening different requirements of all kinds of network traffic are the goals of this architecture, the key of which is to bring out new network-n struction methods. So based on reconfigurable router this thesis is focused on the construction of logical carrying network.
Combining the advantages of traffic-oriented network with virtual network construction methods, a kind of universal carrying network architecture is presented. And this thesis focuses one problem- research on the construction of logical carrying network. The influence of allocation equilibrium of network resource on construction efficiency is also studied. The results of above researches can be applied into the project of "New Generation of Trustworthy Network". This paper includes the following aspects:
1.Firstly by analyzing the current network construction methods, which is traffic-oriented construction and virtual network construction , virtual network construction is considered as being able to support the diversity of network traffic and taking on the characteristics of flexibility and scalability. Network virtualization has become one direction of network development. By summarizing and analyzing ongoing network virtualization research projects, such problems as strict restriction and load unbalancing are found to influence the performance and efficiency of network construction. So, these methods can't be adopted in the carrying network construction which is based on router.
2. Aiming at the characteristics of rapid development of network traffic and current network architectures, universal carrying network architecture based on reconfigurable routing & switching platform is brought forward. It presents a universal developing mode of next generation network. This chapter introduces the hierarchy and working principles as well as key technologies of this architecture. It is shown that the service providing-oriented architecture can provide better carrying service capability for both current and most future network traffic.
3. Stress-based construction algorithm (SCA) is studied for logical carrying network (LCN) construction. Most researches on virtual network may get into the bottleneck problem of physical network resource which comes from shortest path algorithm adopted in link mapping. By defining the parameters of Load Stress to show the network load, SCA is introduced based on stress balancing. SCA pays attention to not only the path attainability of LCN, but also the influence on the succeeding LCN requests. Simulation results indicate that this algorithm can improve the successful construction ratio of LCN and enhance the network service providing capacity.
4. Path splitting based construction algorithm is studied in this chapter. Sometimes, there are plenty of resource fragments left when some LCN have been constructed. In order to fully utilize the physical network resource fragments, path splitting-based on-demand carrying network construction strategy is introduced to provide different resource to meet different service requirements. Base on availab le resource and current link load, an improved min-cost multi-commodity model is used to compute the resource allocation. Simulation results indicate that this algorithm can not only fully utilize resource fragments but also improve network service capability.
5. An optimal construction algorithm is studied based on long time traffic load to solve the problem of dynamic LCN optimization. Parameter of long time traffic load is defined based on Sigmoid function to denote the influence of LCN residual runtime, which has not been paid attention to by static construction algorithms. Then, optimal reconstructing algorithm based on factors such as link utilization and residual runtime of LCN is studied. It can be seen from simulation and analysis results that logical carrying network construction is also a dynamic process in which resource distribution changes along with time. So dynamic adjusting according to need is necessary for LCN construction.
6. A scheme of UCN implementation is given in the end. On the basis of analysis of LCN construction requests, layered management mechanism and feasible LCN construction course are presented. Furthermore, entities in UCN architecture are defined and configured. The design of this scheme will be beneficial to experiments of UCN which are service providing-oriented.
引文
[1] CNNIC Homepage [EB/OL]. 2008, http://www.cnnic.com.cn.
[2] N. M. Mosharaf, K. Chowdhury. A Survey of Network Virtualization [R]. Technical Report: CS-2008-25. http://www.cs.uwaterloo.ca/research/tr/2008/CS-2008-25.pdf.
[3]韦乐平.下一代电信网的发展与演进策略[J] .电信技术,2002.5,56(5):1-4.
[4] ATM Forum Homepage [EB/OL]. 1999, http://www.atmforum.com/.
[5] MARJORY S. BLUMENTHAL. Rethinking the Design of the Internet: The End-to-EndArguments vs. the Brave New World [J]. ACM Transactions on Internet Technology,August 2001, 1(1): 728-740. [6] R. Braden, D. Clark, and S. Shenker. Integrated Services in the Internet Architecture: anOverview [S]. June 1994, RFC 1633.
[7] S. Blake et al. An Architecture for Diferentiated Service [S], Dec 1998, RFC 2475.
[8] E. Rosen, A. Viswanathan, and A. Callon. Multi Protocol Label Switching Architecture [S].Jan.2001, RFC3031.
[9] D. AWDUCHE, A. ELWALIDN, I. WIDJAJA. A Framework for Internet TrafficEngineering[S]. 2000. IETF Draft: draft-ietf-tewg- framework-01.txt.
[10] D. Medhi. Computer Communication Networks: Network Planning, Design and Analysis[D]. University of Missouri, Kansas. (1999).
[11] Juniper Networks. Traffic Engineering for the New Public Network [EB/OL]. 1999.1, http://www.juniper.net.
[12] Next Generation Network Global Standards Initiative (NGN-GSI) [EB/OL]. 2001,http ://www.itu.int/ITU-T/ngn/.
[13] D. Clark, J. Wroclawski, K.R Sollins, R. Braden. Tussle in Cyberspace: Definingtomorrow's Internet [C]. In: Proc. of ACM SIGCOMM'02, Pittsburgh, PA, USA, 2002,pp.347-356.
[14] GENI: Global Environment for Network Innovation [EB/OL]. 2005.6,http://www.geni.net/.
[15] FIND: Future Internet Network Design [EB/OL]. 2005.7, http://frnd.isi.edu/.
[16] PlanetLab: An Open Platform for Developing, Deploying, and Accessing Planetary-scaleServices [EB/OL]. 2004.5, http://www.planet-lab.org/.
[17] AKARI Homepage [EB/OL]. 2007.8, http://akari-project.nict.go.jp/.
[18] 6-Bone Homepage [EB/OL]. 2003-2007, http://www.6bone.net.
[19] GENI Planning Group.GENI: Conceptual Design, Project Execution Plan [EB/OL].January 2006. http://www.geni.net/GDD/GDD- 06-07.pdf
[20] B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb,and A. Joglekar. An Integrated Experimental Environment for Distributed Systems andNetworks[C]. In: Proc. of the Fifth Symposium on Operating Systems Design andImplementation, Boston, MA, Dec. 2002, pp.255-270.
[21] Thomas Anderson, Larry Peterson, etc. Overcoming the Internet Impasse throughVirtualization [J]. IEEE Computer Magazine, 2005, 38(4): 34-41.
[22] N. Feamster, L. Gao, J. Rexford. How to Lease the Internet in Your Spare Time [J]. ACMSIGCOMM Computer Communications Review, January 2007, 37(l):61-64.
[23] David Taylor, Jonathan Turner. Towards a Diversified Internet [EB/OL].http ://www.arl.wustl. edu/netv/contrib/. 2004.
[24] e-Europe Homepage [EB/OL]. http://ec.europa.eu/research/. 2005.
[25] The FP7 4WARD Project Homepage [EB/OL]. http://www.4ward-project.eu/. 2005.
[26] L. Andersson and T Madsen. Provider Provisioned Virtual Private Network (VPN)Terminology[S]. March 2005, RFC 4026.
[27] M. Carugi and D. McDysan.Service Requirements for Layer 3 Provider Provisioned VirtualPrivate Networks (PPVPNs) [S]. April 2005, RFC 4031.
[28] R. Callon and M. Suzuki.A Framework for Layer 3 Provider-Provisioned Virtual PrivateNetworks (PPVPNs) [S]. July 2005, RFC 4110.
[29] L. Andersson and E. Rosen.Framework for Layer 2 Virtual Private Networks (L2VPNs)[S] . September 2006, RFC 4664.
[30] W. Augustyn and Y. Serbest.Service Requirements for Layer 2 Provider-Provisioned VirtualPrivate Networks[S]. September 2006, RFC 4665.
[31] D. Benhaddou and W. Alanqar. Layer 1 Virtual Private Networks in MultidomainNext-generation Networks [J]. IEEE Communications Magazine, April 2007, 45 (4):52-58.
[32] T. Takeda.Framework and Requirements for Layer 1 Virtual Private Networks[S]. April2007, RFC 4847.
[33] J. Touch and S. Hotz. The X-Bone [C]. In: Proceedings of the Third Global InternetMini-Conference at GLOBECOM'98, 1998, pp.44-52.
[34] J. E. van der Merwe, S. Rooney I. Leslie, and S. Crosby. The Tempest-A practicalFramework for Network Programmability [J]. IEEE Network Magazine, 1998, 12(3):20-28.
[35]田瑞雄.自组织覆盖网络建模与优化[D].北京：清华大学，2005.3.
[36] D. G Andersen, H. Balakrishnan, M. Kaashoek, and R Morris. Resilient overlay networks[C]. In: Proc. 18thACMSOSP, Banff, Canada, Oct. 2001, pp. 131-145.
[37] S. Savage et al. Detour: A Case for Informed Internet Routing and Transport [J]. IEEE Micro, Jan. 1999, 19 (3):50-59.
[38] Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, and Sonesh Surana. Internet Indirection Infrastructure [C]. In: Proceedings of SIGCOMM 2002, Pennsylvania USA.
[39] L.Lazar and W.Terrill. Exploring Content Delivery Networking [J]. IEEE IT Pro, July 2001, 3(4):47-49.
[40] Open Signaling working group [EB/OL]. 2001. htt://comet.columbia.edu/opensig/.
[41] D. L. Tennenhouse and D. J. Wetherall.Towards an Active Network Architecture [J]. ACM Computer Communication Review, 1996, 26(2):2-15.
[42] D. L. Tennenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G J. Minden. Asurvey of active network research [J]. IEEE Communications Magazine, January 1997,35(l):80-86.
[43] Traffic Management Specification Version 4.1[EB/OL]. The ATM Forum TechnicalCommittee. 1999. ftp://ftp.atmforum.com/pub/approved-specs/af-tm-0121.000.pdf.
[44] K. Chan, F. Baker, J. Babiarz. Configuration Guidelines for DiffServ Service Classes [S].2006.8, RFC 4594.
[45] K. Chan J. Babiarz. Nortel. F.Baker. Aggregation of Diffserv Service Classes[S]. 2008.2,RFC 5127.
[46]江涛.通播网言－全IP及三网合一的网络体系及产业结构[M].北京：北京邮电大学出版社，2006.
[47] A. Bavier, N. Feamster, M. Huang, L. Peterson, and J. Rexford. In VINI Veritas: Realisticand Controlled Network Experimentation [C]. In: Proc. of SIGCOMM, Pisa, Italy, Sept.2006, pp.3-14.
[48] L.Peterson, T.Anderson, D.Culler and T.Roscoe.A Blueprint for Introducing DisruptiveTechnology into the Internet[C]. In: Proceedings of ACM HotNets-I Workshop,October2002,33(l):59-64.
[49]严程，李星．CERNET IPv6试验床[J]．电信科学，2002.03，PP.24-26．
[50]科技部863计划联合办公室．新一代高可信网络”重大项目指南[EB/OL].http：//www.most.gov.cn/tztg/200711/t20071107_57004.html．
[51]汪斌强，兰巨龙等.863重大专项‘新一代高可信网络”重大课题‘可重构路由器构件组研制’硕目申请书[M]．项目号：2008AA01A323.2008．
[52] D.McPherson, D.O’Leary, D.Ward, E.Brendel, O.Aruj. Core Network Design and vendorProphecies[C]. In: Proc. NANOG June 2003.
[53] Juniper Networks: Intelligent Logical Router Service [EB/OL].http://www.juniper.net/solutions/literature/white_papers/200097.pdf.
[54] Y Zhu and M. Ammar. Algorithms for Assigning Substrate Network Resources to Virtual Network Components[C]. In: Proceedings of IEEE INFOCOM, 2006, pp.1-12.
[55] Q. Fang, J. Cobb, and E. Leiss.A Pre-selection Routing Scheme for Virtual CircuitNetworks[C]. In: Proc. IASTED International Conference on Parallel and DistributedComputing and Systems (PDCS), 2000.
[56] A. 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. ACMsymposium on Theory of computing (STOC), 2001, pp. 389-398.
[57] M.EI-Darieby J.Rolia and D.C.Petriu.Performance Modeling for Virtual Network-basedService Provisioning[C]. In: Proc. Of IM2001. pp. 139-153.
[58] Redlich. Virtual Networks in the Internet [C]. In: OPENARCH.1999, pp.108-114.
[59] M. Sayal, Y Breitbart, P. Scheuermann, and R. Vingralek.Selection Algorithms for Replicated Web Servers[C]. In: SIGMETRICS Perform. Eval. Rev, 199826, (3):44-50.
[60] S. Shi and J. Turner.Placing Servers in Overlay Networks[C]. In: Proc. InternationalSymposium on Performance Evaluation of Computer and Telecommunication Systems(SPETS), 2002.
[61] 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.
[62] ACM SIGCOM [EB/OL]. http://conferences.sigcomm.org/sigcomm/2009/workshops/visa/.
[63] R. ricci, et aL A Solver for the Network Testbed Mapping Problem [J]. ACM ComputerCommunication Review, January 2003, 33(2):65-81.
[64] J. Lu and J. Turner. Efficient Mapping of Virtual Networks onto a Shared Substrate [R].Washington University, Technical Report WUCSE-2006-35, 2006.
[65] Z. Duan, Z.-L. Zhang, and Y. T. Hou.Service Overlay Networks: SLAs, QoS, and bandwidth provisioning [J]. IEEE/ACM Transactions on Networking, 2003, ll(6):870-883.
[66] Shansi Ren, Lei Guo, Song Jiang, et aL SAT-match: a self-adaptive topology matchingmethod to achieve low lookup latency in structured P2P overlay networks[C]. In:Proceedings of the 18th International Parallel and Distributed Processing Symposium(IPDPS’04), Santa Fe, New Mexico, USA, April 2004, pp.83-91.
[67] Sibelius Lellis Vieira, Jorg Liebeherr. Topology Design for Service Overlay Networks with Bandwidth Guarantees [C]. In: IEEE IWQoS 2004, June 2004, pp.211-220.
[68] Ling Zhou, Arunabha Sen. Topology Design of Service Overlay Network with aGeneralized Cost Model[C]. In: IEEE GLOBECOM 2007, November 2007, pp. 75-80.
[69] Antonio Capone, Jocelyne Elias, Fabio Martignon. Optimal Design of Service OverlayNetworks[C]. In: Proceedings of the Fourth International Workshop on QoS inMultiservice IP Networks (QoS-IP), February 2008, pp. 46-52.
[70] Antonio Capone, Jocelyne Elias, Fabio Martignon. Routing and Resource Optimization in Service Overlay Networks [J]. IEEE/ACM Computer Networks, 2009, 53(2): 180-190.
[71] Jing Lu, Jonathan Turner. Poster: Constraint-driven Virtual Network Design on a Shared Substrate[C]. In: IEEE ICNP2006, November 2006, pp 13-14.
[72] Arunabha Sen, Ling Zhou. On Topological Design of Service Overlay Networks [C]. In:IEEEIWQoS 2005, June 2005, Vol.3552, pp 54-68.
[73] Hung Tuan Tran, Thomas Ziegler. A Design Framework towards the Profitable Operation of Service Overlay Networks [J]. IEEE/ACM Computer Networks, 2007, 51(1): 94-113.
[74] Minlan Yu, Yung Yi, Jennifer Rexford, etc. Rethinking Virtual Network Embedding:Substrate Support for Path Splitting and Migration[C]. In: ACM SIGCOMM ComputerCommunication Review, 2008, 38(2):17-29.
[75] Tzi-cker Chiueh. Resource Visualization Techniques for Wide-area Overlay Networks[R].Technical Report TR112, State University of New York, 2003.
[76] W. Szeto, Y Iraqi and R. Boutaba. A Multi-Commodity Flow Based Approach to VirtualNetwork Resource Allocation[C]. In: IEEE GLOBECOM 2003, December 2003, pp.3004-3008.
[77] Jinliang Fan, Mostafa H. Ammar. Dynamic Topology Configuration in Service OverlayNetworks: A Study of Reconfiguration Policies[C]. In: IEEE INFOCOM 2006, April2006, pp. 1-12.
[78] Hung Tuan Tran. On the Service Overlay Network Concept for End-to-End QoS Assurances[R]. Technical report FTW-TR-2005, Telecommunications Research CenterVienna, 2005.
[79] Houidi. a Distributed Virtual Network Mapping Algorithm [C]. In: ICC’08, 2008, pp.5634-5640.
[80] M. Boucadair, B. Decraene, M. Garcia-Osma, A. J. Elizondo, J. R. Sanchez, B. Lemoine, E. Mykoniati,P. Georgatsos, D. Gri_n, J. Spencer, J. Griem, N. Wang, M. Howarth, G Pavlou,S. Georgoulas, andB. Quoitin.Parallel Internets framework [R]. AGAVE Deliverable (Id:AGAVE/WP1/FTRD/D1.I/public), 2006.
[81] M. Boucadair, P. Levis, D. Grin, N. Wang, M. Howarth, G Pavlou, E. Mykoniati, P.Georgatsos, B. Quoitin, J. R. Sanchez, and M. Garcia-Osma. A Framework for End-to-endService Differentiation: Network planes and parallel Internets [J]. IEEE Communications,September 2007, 45(9):134-143.
[82] VINI: A Virtual Network Infrastructure [EB/OL].2006. http://www.vini-veritas.net/.
[83] J. D. Touch, Y.-S. Wang, L. Eggert, and G Finn.A Virtual Internet Architecture[R].USC/Information Sciences Institute, Tech. Rep. TR-570, 2003.
[84] N. Wang, D. Grin, J. Spencer, J. Griem, J. R. Sanchez, M. Boucadair, E. Mykoniati, B.Quoitin, M. Howarth, G Pavlou, A J. Elizondo, M. L. G Osma, and P. Georgatsos. Aframework for lightweight QoS provisioning: Network planes and parallel Internets [C]. In:Proceedings of the 10th IFIP/IEEE International Symposium on Integrated NetworkManagement (IM’7), 2007, pp. 797-810.
[85] X. Jiang and D. Xu. VIOLIN: Virtual Internetworking on Overlay Infrastructure[R]. Purdue University, Tech. Rep. TR-03-027, 2003.
[86] P. Ruth, X. Jiang, D. Xu, and S. Goasguen. Virtual distributed environments in a sharedinfrastructure [J].Computer, 2005, 38(5):63-69.
[87] A. Jun and A Leon-Garcia, A virtual network approach to network resources management[C]. In: Proceedings of the Canadian Conference on Broadband Research (CCBR'98), June 1998. pp. 365-373.
[88] Andrew Do-Sung Jun, Alberto Leon-Garcia, Virtual network resources management: Adivide-and-conquer approach for the control of future networks[C]. In: Proceedings of theIEEE Global Telecommunications Conference (GLOBECOM’98), 1998, vol2, pp.1065-1070.
[89] W. Ng, R. Boutaba, and A Leon-Garcia.Provision and customization of ATM virtualnetworks for supporting IP services[C]. In: Proceedings of the IEEE ATM Workshop'1999,1999, pp. 205-210.
[90] S. da Silva, Y Yemini, and D. Florissi.The NetScript active network system [J]. IEEE Journal on Selected Areas in Communication, 2001, 19(3):538-551.
[91] S. da Silva, D. Florissi, and Y Yemini.NetScript: A language-based approach to activenetworks [R].Columbia University, Tech. Rep, January 1998.
[92] M. Kounavis, A. Campbell, S. Chou, F. Modoux, J. Vicente, and H. Zhuang.The Genesis Kernel: A Programming System for Spawning Network Architectures [J]. IEEE Journal on Selected Areas in Communications, 2001, 19(3):511-526.
[93] A. T. Campbell, M. E. Kounavis, D. A. Villela, J. Vicente, K. Miki, H. G D. Meer, and K.S. Kalaichelvan. Spawning Networks [J]. IEEE Network Magazine, 1999, 13(4):16-30.
[94] G P. Group, GENI design principles [J]. Computer, 2006, 39(9):102-105.
[95] D. Tennenhouse. Layered Multiplexing Considered HarmfulfC]. Proc. of IFIP Workshop on Protocols for High-speed Networks, 1989, pp. 143~148.
[96] D. Clark, D. Tennenhouse. Architectural considerations for a new generation of protocols[C]. In: Computer Communications Review, 1990, 20(4): 200-208.
[97] Campbell A T, De Meer H G, Kounavis M E, et al. A survey of programmable networks [C]. SIGCOMM Computer Communication Review, April 1999, 29(2):7-23.
[98]杨鹏．基于交互、面向服务的新一代网络体系架构模型研究[J]．电子学报，2005，33 (51)：804-809．
[99] J.S. Turner and D.E. Taylor. Diversifying the Internet [C]. In: IEEE GLOBECOM, 2005, 2(l):89-100.
[100]林闯，彭雪海．可信网络研究[J]．计算机学报，2005，28(5)：752-758．
[101] Maria E. Orlowska, Sanjiva Weerawarana, Michael P. Papazoglou, Jian Yang. Service-Oriented Computing [C]. In: ICSOC 2003.
[102]曾家智，徐洁等．服务元网络体系结构和微通信元系统架构[J].电子学报，2004，32(5)：745-749．
[103]王浩学，汪斌强．一体化承载网络体系架构研究[J]．计算机学报，2009.3，32(31)：371-376．
[104] Eddie Kohler. The Click modular router [D]. Thesis for the degree of Doctor ofPhilosophy at the Massachusetts Institute of Technology, February 2001.
[105] L Yang. Forwarding and Control Element Separation (ForCES) Framework[S]. RFC3746. 2004.
[106] M. Handley O. Hodchild, and E. Kohler.Xorp: An open Platform for NetworkResearch[C]. In: 1st Workshop on Hot Topics in Networks (HotNets-I), Princton, NewJersey, October 2002.
[107] Dave McDysan. Multiservice Networking using a Component-based Switch and RouterArchitecture[C]. In: ATM 2000. Proceedings of the IEEE Conference on HighPerformance Switching and Routing.
[108] Hemmati, H. Niamanesh. A Framework to Support Run-time Assured DynamicReconfiguration for Pervasive Computing Environments [C]. In: Wireless PervasiveComputing, 2006.
[109] NetFPGA[EB/OL]. 2003. http://netipga.org/.
[110]王浩学，汪斌强，兰巨龙．基于开放可重构路由交换平台的新型网络体系[J].电信科学2008.7, 24(7):44-48.
[111] Wilson, R.J. (1972).Introduction to Graph Theory [M], Oliver and Boyd, Edinburgh.
[112] H. Zhang, A. Durresi. Differentiated Multi-Layer Survivability in IP/WDM Networks [C].In:Proc.IEEE/IFIP NOMS’2002, Florence, Italy, April 2002, pp. 681-694.
[113] Debasis Mitra, John Morrison.Virtual Private Networks: Joint Resource Allocation AndRouting Design[C]. In: IEEE ICC’99, 1999, Vol.2:21-25.
[114] A. Girard. Routing and Dimentioning in Circuit-Switched Networks [M].Addison-Wesley, 1990, pages: 556.
[115] F. P. Kelly. Routing in Circuit-switched Networks: Optimization, Shadow Prices andDecentralization [J]. Advances in AppliedProbability, 1988, Vol.20:112-144.
[116] M. Yu, Y. Yi, J. Rexford, and M. Chiang.Rethinking Virtual Network Embedding:Substrate Support for Path Splitting and Migration [R]. Princeton University, TechnicalReport TR-788-07, July 2007.
[117]姜明.逻辑承载网构建中的数学建模[J].信息工程大学学报, 2009.1, 10(1):50-52.
[118]于婧.面向服务的逻辑承载网构建方法研究[J].信息工程大学学报, 2009.1,10(1):57-60.
[119] R.K.Ahuja, T.L.Magnanti, J.B.Orlin. Network flows: theory, algorithms, and applications [M].1993.
[120] J.Kleinberg. Approximation Algorithms for Disjoint Paths Problems [D]. PhD thesis, MIT,1996.
[121] Cui Y, Wu JP, Xu K. Research on Internetwork QoS Routing Algorithms: A survey [J].Journal of Software, 2002, 13(11):2065-2075.
[122]邹园萍.基于MPLS和DiffServ的域内蒙古自治区网络资源配置方法[J].电子与信息学报，2007. 29(1):214-217.
[123] Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and MungChiang. Davinci: Dynamically Adaptive Virtual Networks for a Customized Internet [C].In: ACM CoNEXT, Madrid, SPAIN, 2008, pp.1-12.
[124] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts.On-line Load Balancing withApplications to Machine Scheduling and Virtual Circuit Routing [C]. In: Proc. ACMsymposium on Theory of computing, 1993, pp. 623-631.
[125] Y. Azar, B. Kalyanasundaram, S. A. Plotkin, K. Pruhs, and O. Waarts. Online LoadBalancing of Temporary Tasks [C]. In: Proc. Workshop on Algorithms and DataStructures, 1993, 22(11):119-130.
[126]王华.MPLS及IP网络流量工程的研究[D].南京:南京理工大学. 2003.4.
[127] E.J.Anderson. A multicommodity flow based approach to adaptive internet routing [D]. Ph.D Thesis, University of Washington, 2002.
[128] S. Even.On the Complexity of Timetable and Multicommodity Flow Problems [J]. SIAMJournal on Computing. pp.691-703.SIAM.doi:10.1137/0205048.
[129] George Karakostas. Faster Approximation Schemes for Fractional Multicommodity FlowProblems[C]. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, 2002, pp.166-173.
[130] Kodialam M S and Lakshman T V. Minimum Interference Routing with Applications to MPLS Traffic Engineering[C]. In: Proc. of IEEE INFOCOM2000, Vol.2: 884-893.
[131]唐治果，李乐民．针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报，2007.29(5)：1187-1190．
[132] J. He and J. Rexford. Towards Internet-wide Multipath Routing [J]. IEEE NetworkMagazine Special Issue on Scalability, March 2008, 22(2):16-21.
[133] P. Key, L. Massoulie, and D. Towsley. Path Selection and Multipath Congestion Control[C]. In: Proc. IEEE INFOCOM07, 2007, pp.143-151.
[134] A. Sundararaj, A. Gupta, and P. Dinda. Dynamic Topology Adaptation in VirtualNetworks of Virtual Machines [C]. In: LCR 2004 Proceedings of the Seventh Workshopon Langauges, Compilers and Run-time Support for Scalable Systems. 81(3): 1-8.
[135] Joe Touch.Dynamic Internet Overlay Deployment and Management Using the x-bone [J].Computer Networks, 2001, 36(2):117-135.
[136] Jinliang Fan and Mostafa H.Ammar.Dynamic Topology Reconfiguration of OverlayNetworks: Structure and Approximation of Optimal Policies [EB/OL]. Georgia Instituteof Technology, 2004. http://www.cc.gatech.edu/～jlfan/policy-techreport.pdf
[137] Yi Wang. Virtual Routers on the Move: Live Router Migration as aNetwork-Management Primitive[C]. In: SIGCOMM'08, Seattle, Washington, USApp.231-242.
[138] M. Harchol-Baiter, A. B. Downey. Exploiting Process Lifetime Distributions forDynamic Load Balancing [J]. ACM Transactions on Computer Systems, 1997,15(3):253-285.
[139] Zhenhai Duan, Zhi-Li Zhang. A Core Stateless Bandwidth Broker Architecture forScalable Support of Guaranteed Services [J]. IEEE Transactions on Parallel andDistributed Systems, January 2004, 15(1): 167-182.
[2] N. M. Mosharaf, K. Chowdhury. A Survey of Network Virtualization [R]. Technical Report: CS-2008-25. http://www.cs.uwaterloo.ca/research/tr/2008/CS-2008-25.pdf.
[3]韦乐平.下一代电信网的发展与演进策略[J] .电信技术,2002.5,56(5):1-4.
[4] ATM Forum Homepage [EB/OL]. 1999, http://www.atmforum.com/.
[5] MARJORY S. BLUMENTHAL. Rethinking the Design of the Internet: The End-to-EndArguments vs. the Brave New World [J]. ACM Transactions on Internet Technology,August 2001, 1(1): 728-740. [6] R. Braden, D. Clark, and S. Shenker. Integrated Services in the Internet Architecture: anOverview [S]. June 1994, RFC 1633.
[7] S. Blake et al. An Architecture for Diferentiated Service [S], Dec 1998, RFC 2475.
[8] E. Rosen, A. Viswanathan, and A. Callon. Multi Protocol Label Switching Architecture [S].Jan.2001, RFC3031.
[9] D. AWDUCHE, A. ELWALIDN, I. WIDJAJA. A Framework for Internet TrafficEngineering[S]. 2000. IETF Draft: draft-ietf-tewg- framework-01.txt.
[10] D. Medhi. Computer Communication Networks: Network Planning, Design and Analysis[D]. University of Missouri, Kansas. (1999).
[11] Juniper Networks. Traffic Engineering for the New Public Network [EB/OL]. 1999.1, http://www.juniper.net.
[12] Next Generation Network Global Standards Initiative (NGN-GSI) [EB/OL]. 2001,http ://www.itu.int/ITU-T/ngn/.
[13] D. Clark, J. Wroclawski, K.R Sollins, R. Braden. Tussle in Cyberspace: Definingtomorrow's Internet [C]. In: Proc. of ACM SIGCOMM'02, Pittsburgh, PA, USA, 2002,pp.347-356.
[14] GENI: Global Environment for Network Innovation [EB/OL]. 2005.6,http://www.geni.net/.
[15] FIND: Future Internet Network Design [EB/OL]. 2005.7, http://frnd.isi.edu/.
[16] PlanetLab: An Open Platform for Developing, Deploying, and Accessing Planetary-scaleServices [EB/OL]. 2004.5, http://www.planet-lab.org/.
[17] AKARI Homepage [EB/OL]. 2007.8, http://akari-project.nict.go.jp/.
[18] 6-Bone Homepage [EB/OL]. 2003-2007, http://www.6bone.net.
[19] GENI Planning Group.GENI: Conceptual Design, Project Execution Plan [EB/OL].January 2006. http://www.geni.net/GDD/GDD- 06-07.pdf
[20] B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb,and A. Joglekar. An Integrated Experimental Environment for Distributed Systems andNetworks[C]. In: Proc. of the Fifth Symposium on Operating Systems Design andImplementation, Boston, MA, Dec. 2002, pp.255-270.
[21] Thomas Anderson, Larry Peterson, etc. Overcoming the Internet Impasse throughVirtualization [J]. IEEE Computer Magazine, 2005, 38(4): 34-41.
[22] N. Feamster, L. Gao, J. Rexford. How to Lease the Internet in Your Spare Time [J]. ACMSIGCOMM Computer Communications Review, January 2007, 37(l):61-64.
[23] David Taylor, Jonathan Turner. Towards a Diversified Internet [EB/OL].http ://www.arl.wustl. edu/netv/contrib/. 2004.
[24] e-Europe Homepage [EB/OL]. http://ec.europa.eu/research/. 2005.
[25] The FP7 4WARD Project Homepage [EB/OL]. http://www.4ward-project.eu/. 2005.
[26] L. Andersson and T Madsen. Provider Provisioned Virtual Private Network (VPN)Terminology[S]. March 2005, RFC 4026.
[27] M. Carugi and D. McDysan.Service Requirements for Layer 3 Provider Provisioned VirtualPrivate Networks (PPVPNs) [S]. April 2005, RFC 4031.
[28] R. Callon and M. Suzuki.A Framework for Layer 3 Provider-Provisioned Virtual PrivateNetworks (PPVPNs) [S]. July 2005, RFC 4110.
[29] L. Andersson and E. Rosen.Framework for Layer 2 Virtual Private Networks (L2VPNs)[S] . September 2006, RFC 4664.
[30] W. Augustyn and Y. Serbest.Service Requirements for Layer 2 Provider-Provisioned VirtualPrivate Networks[S]. September 2006, RFC 4665.
[31] D. Benhaddou and W. Alanqar. Layer 1 Virtual Private Networks in MultidomainNext-generation Networks [J]. IEEE Communications Magazine, April 2007, 45 (4):52-58.
[32] T. Takeda.Framework and Requirements for Layer 1 Virtual Private Networks[S]. April2007, RFC 4847.
[33] J. Touch and S. Hotz. The X-Bone [C]. In: Proceedings of the Third Global InternetMini-Conference at GLOBECOM'98, 1998, pp.44-52.
[34] J. E. van der Merwe, S. Rooney I. Leslie, and S. Crosby. The Tempest-A practicalFramework for Network Programmability [J]. IEEE Network Magazine, 1998, 12(3):20-28.
[35]田瑞雄.自组织覆盖网络建模与优化[D].北京：清华大学，2005.3.
[36] D. G Andersen, H. Balakrishnan, M. Kaashoek, and R Morris. Resilient overlay networks[C]. In: Proc. 18thACMSOSP, Banff, Canada, Oct. 2001, pp. 131-145.
[37] S. Savage et al. Detour: A Case for Informed Internet Routing and Transport [J]. IEEE Micro, Jan. 1999, 19 (3):50-59.
[38] Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, and Sonesh Surana. Internet Indirection Infrastructure [C]. In: Proceedings of SIGCOMM 2002, Pennsylvania USA.
[39] L.Lazar and W.Terrill. Exploring Content Delivery Networking [J]. IEEE IT Pro, July 2001, 3(4):47-49.
[40] Open Signaling working group [EB/OL]. 2001. htt://comet.columbia.edu/opensig/.
[41] D. L. Tennenhouse and D. J. Wetherall.Towards an Active Network Architecture [J]. ACM Computer Communication Review, 1996, 26(2):2-15.
[42] D. L. Tennenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G J. Minden. Asurvey of active network research [J]. IEEE Communications Magazine, January 1997,35(l):80-86.
[43] Traffic Management Specification Version 4.1[EB/OL]. The ATM Forum TechnicalCommittee. 1999. ftp://ftp.atmforum.com/pub/approved-specs/af-tm-0121.000.pdf.
[44] K. Chan, F. Baker, J. Babiarz. Configuration Guidelines for DiffServ Service Classes [S].2006.8, RFC 4594.
[45] K. Chan J. Babiarz. Nortel. F.Baker. Aggregation of Diffserv Service Classes[S]. 2008.2,RFC 5127.
[46]江涛.通播网言－全IP及三网合一的网络体系及产业结构[M].北京：北京邮电大学出版社，2006.
[47] A. Bavier, N. Feamster, M. Huang, L. Peterson, and J. Rexford. In VINI Veritas: Realisticand Controlled Network Experimentation [C]. In: Proc. of SIGCOMM, Pisa, Italy, Sept.2006, pp.3-14.
[48] L.Peterson, T.Anderson, D.Culler and T.Roscoe.A Blueprint for Introducing DisruptiveTechnology into the Internet[C]. In: Proceedings of ACM HotNets-I Workshop,October2002,33(l):59-64.
[49]严程，李星．CERNET IPv6试验床[J]．电信科学，2002.03，PP.24-26．
[50]科技部863计划联合办公室．新一代高可信网络”重大项目指南[EB/OL].http：//www.most.gov.cn/tztg/200711/t20071107_57004.html．
[51]汪斌强，兰巨龙等.863重大专项‘新一代高可信网络”重大课题‘可重构路由器构件组研制’硕目申请书[M]．项目号：2008AA01A323.2008．
[52] D.McPherson, D.O’Leary, D.Ward, E.Brendel, O.Aruj. Core Network Design and vendorProphecies[C]. In: Proc. NANOG June 2003.
[53] Juniper Networks: Intelligent Logical Router Service [EB/OL].http://www.juniper.net/solutions/literature/white_papers/200097.pdf.
[54] Y Zhu and M. Ammar. Algorithms for Assigning Substrate Network Resources to Virtual Network Components[C]. In: Proceedings of IEEE INFOCOM, 2006, pp.1-12.
[55] Q. Fang, J. Cobb, and E. Leiss.A Pre-selection Routing Scheme for Virtual CircuitNetworks[C]. In: Proc. IASTED International Conference on Parallel and DistributedComputing and Systems (PDCS), 2000.
[56] A. 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. ACMsymposium on Theory of computing (STOC), 2001, pp. 389-398.
[57] M.EI-Darieby J.Rolia and D.C.Petriu.Performance Modeling for Virtual Network-basedService Provisioning[C]. In: Proc. Of IM2001. pp. 139-153.
[58] Redlich. Virtual Networks in the Internet [C]. In: OPENARCH.1999, pp.108-114.
[59] M. Sayal, Y Breitbart, P. Scheuermann, and R. Vingralek.Selection Algorithms for Replicated Web Servers[C]. In: SIGMETRICS Perform. Eval. Rev, 199826, (3):44-50.
[60] S. Shi and J. Turner.Placing Servers in Overlay Networks[C]. In: Proc. InternationalSymposium on Performance Evaluation of Computer and Telecommunication Systems(SPETS), 2002.
[61] 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.
[62] ACM SIGCOM [EB/OL]. http://conferences.sigcomm.org/sigcomm/2009/workshops/visa/.
[63] R. ricci, et aL A Solver for the Network Testbed Mapping Problem [J]. ACM ComputerCommunication Review, January 2003, 33(2):65-81.
[64] J. Lu and J. Turner. Efficient Mapping of Virtual Networks onto a Shared Substrate [R].Washington University, Technical Report WUCSE-2006-35, 2006.
[65] Z. Duan, Z.-L. Zhang, and Y. T. Hou.Service Overlay Networks: SLAs, QoS, and bandwidth provisioning [J]. IEEE/ACM Transactions on Networking, 2003, ll(6):870-883.
[66] Shansi Ren, Lei Guo, Song Jiang, et aL SAT-match: a self-adaptive topology matchingmethod to achieve low lookup latency in structured P2P overlay networks[C]. In:Proceedings of the 18th International Parallel and Distributed Processing Symposium(IPDPS’04), Santa Fe, New Mexico, USA, April 2004, pp.83-91.
[67] Sibelius Lellis Vieira, Jorg Liebeherr. Topology Design for Service Overlay Networks with Bandwidth Guarantees [C]. In: IEEE IWQoS 2004, June 2004, pp.211-220.
[68] Ling Zhou, Arunabha Sen. Topology Design of Service Overlay Network with aGeneralized Cost Model[C]. In: IEEE GLOBECOM 2007, November 2007, pp. 75-80.
[69] Antonio Capone, Jocelyne Elias, Fabio Martignon. Optimal Design of Service OverlayNetworks[C]. In: Proceedings of the Fourth International Workshop on QoS inMultiservice IP Networks (QoS-IP), February 2008, pp. 46-52.
[70] Antonio Capone, Jocelyne Elias, Fabio Martignon. Routing and Resource Optimization in Service Overlay Networks [J]. IEEE/ACM Computer Networks, 2009, 53(2): 180-190.
[71] Jing Lu, Jonathan Turner. Poster: Constraint-driven Virtual Network Design on a Shared Substrate[C]. In: IEEE ICNP2006, November 2006, pp 13-14.
[72] Arunabha Sen, Ling Zhou. On Topological Design of Service Overlay Networks [C]. In:IEEEIWQoS 2005, June 2005, Vol.3552, pp 54-68.
[73] Hung Tuan Tran, Thomas Ziegler. A Design Framework towards the Profitable Operation of Service Overlay Networks [J]. IEEE/ACM Computer Networks, 2007, 51(1): 94-113.
[74] Minlan Yu, Yung Yi, Jennifer Rexford, etc. Rethinking Virtual Network Embedding:Substrate Support for Path Splitting and Migration[C]. In: ACM SIGCOMM ComputerCommunication Review, 2008, 38(2):17-29.
[75] Tzi-cker Chiueh. Resource Visualization Techniques for Wide-area Overlay Networks[R].Technical Report TR112, State University of New York, 2003.
[76] W. Szeto, Y Iraqi and R. Boutaba. A Multi-Commodity Flow Based Approach to VirtualNetwork Resource Allocation[C]. In: IEEE GLOBECOM 2003, December 2003, pp.3004-3008.
[77] Jinliang Fan, Mostafa H. Ammar. Dynamic Topology Configuration in Service OverlayNetworks: A Study of Reconfiguration Policies[C]. In: IEEE INFOCOM 2006, April2006, pp. 1-12.
[78] Hung Tuan Tran. On the Service Overlay Network Concept for End-to-End QoS Assurances[R]. Technical report FTW-TR-2005, Telecommunications Research CenterVienna, 2005.
[79] Houidi. a Distributed Virtual Network Mapping Algorithm [C]. In: ICC’08, 2008, pp.5634-5640.
[80] M. Boucadair, B. Decraene, M. Garcia-Osma, A. J. Elizondo, J. R. Sanchez, B. Lemoine, E. Mykoniati,P. Georgatsos, D. Gri_n, J. Spencer, J. Griem, N. Wang, M. Howarth, G Pavlou,S. Georgoulas, andB. Quoitin.Parallel Internets framework [R]. AGAVE Deliverable (Id:AGAVE/WP1/FTRD/D1.I/public), 2006.
[81] M. Boucadair, P. Levis, D. Grin, N. Wang, M. Howarth, G Pavlou, E. Mykoniati, P.Georgatsos, B. Quoitin, J. R. Sanchez, and M. Garcia-Osma. A Framework for End-to-endService Differentiation: Network planes and parallel Internets [J]. IEEE Communications,September 2007, 45(9):134-143.
[82] VINI: A Virtual Network Infrastructure [EB/OL].2006. http://www.vini-veritas.net/.
[83] J. D. Touch, Y.-S. Wang, L. Eggert, and G Finn.A Virtual Internet Architecture[R].USC/Information Sciences Institute, Tech. Rep. TR-570, 2003.
[84] N. Wang, D. Grin, J. Spencer, J. Griem, J. R. Sanchez, M. Boucadair, E. Mykoniati, B.Quoitin, M. Howarth, G Pavlou, A J. Elizondo, M. L. G Osma, and P. Georgatsos. Aframework for lightweight QoS provisioning: Network planes and parallel Internets [C]. In:Proceedings of the 10th IFIP/IEEE International Symposium on Integrated NetworkManagement (IM’7), 2007, pp. 797-810.
[85] X. Jiang and D. Xu. VIOLIN: Virtual Internetworking on Overlay Infrastructure[R]. Purdue University, Tech. Rep. TR-03-027, 2003.
[86] P. Ruth, X. Jiang, D. Xu, and S. Goasguen. Virtual distributed environments in a sharedinfrastructure [J].Computer, 2005, 38(5):63-69.
[87] A. Jun and A Leon-Garcia, A virtual network approach to network resources management[C]. In: Proceedings of the Canadian Conference on Broadband Research (CCBR'98), June 1998. pp. 365-373.
[88] Andrew Do-Sung Jun, Alberto Leon-Garcia, Virtual network resources management: Adivide-and-conquer approach for the control of future networks[C]. In: Proceedings of theIEEE Global Telecommunications Conference (GLOBECOM’98), 1998, vol2, pp.1065-1070.
[89] W. Ng, R. Boutaba, and A Leon-Garcia.Provision and customization of ATM virtualnetworks for supporting IP services[C]. In: Proceedings of the IEEE ATM Workshop'1999,1999, pp. 205-210.
[90] S. da Silva, Y Yemini, and D. Florissi.The NetScript active network system [J]. IEEE Journal on Selected Areas in Communication, 2001, 19(3):538-551.
[91] S. da Silva, D. Florissi, and Y Yemini.NetScript: A language-based approach to activenetworks [R].Columbia University, Tech. Rep, January 1998.
[92] M. Kounavis, A. Campbell, S. Chou, F. Modoux, J. Vicente, and H. Zhuang.The Genesis Kernel: A Programming System for Spawning Network Architectures [J]. IEEE Journal on Selected Areas in Communications, 2001, 19(3):511-526.
[93] A. T. Campbell, M. E. Kounavis, D. A. Villela, J. Vicente, K. Miki, H. G D. Meer, and K.S. Kalaichelvan. Spawning Networks [J]. IEEE Network Magazine, 1999, 13(4):16-30.
[94] G P. Group, GENI design principles [J]. Computer, 2006, 39(9):102-105.
[95] D. Tennenhouse. Layered Multiplexing Considered HarmfulfC]. Proc. of IFIP Workshop on Protocols for High-speed Networks, 1989, pp. 143~148.
[96] D. Clark, D. Tennenhouse. Architectural considerations for a new generation of protocols[C]. In: Computer Communications Review, 1990, 20(4): 200-208.
[97] Campbell A T, De Meer H G, Kounavis M E, et al. A survey of programmable networks [C]. SIGCOMM Computer Communication Review, April 1999, 29(2):7-23.
[98]杨鹏．基于交互、面向服务的新一代网络体系架构模型研究[J]．电子学报，2005，33 (51)：804-809．
[99] J.S. Turner and D.E. Taylor. Diversifying the Internet [C]. In: IEEE GLOBECOM, 2005, 2(l):89-100.
[100]林闯，彭雪海．可信网络研究[J]．计算机学报，2005，28(5)：752-758．
[101] Maria E. Orlowska, Sanjiva Weerawarana, Michael P. Papazoglou, Jian Yang. Service-Oriented Computing [C]. In: ICSOC 2003.
[102]曾家智，徐洁等．服务元网络体系结构和微通信元系统架构[J].电子学报，2004，32(5)：745-749．
[103]王浩学，汪斌强．一体化承载网络体系架构研究[J]．计算机学报，2009.3，32(31)：371-376．
[104] Eddie Kohler. The Click modular router [D]. Thesis for the degree of Doctor ofPhilosophy at the Massachusetts Institute of Technology, February 2001.
[105] L Yang. Forwarding and Control Element Separation (ForCES) Framework[S]. RFC3746. 2004.
[106] M. Handley O. Hodchild, and E. Kohler.Xorp: An open Platform for NetworkResearch[C]. In: 1st Workshop on Hot Topics in Networks (HotNets-I), Princton, NewJersey, October 2002.
[107] Dave McDysan. Multiservice Networking using a Component-based Switch and RouterArchitecture[C]. In: ATM 2000. Proceedings of the IEEE Conference on HighPerformance Switching and Routing.
[108] Hemmati, H. Niamanesh. A Framework to Support Run-time Assured DynamicReconfiguration for Pervasive Computing Environments [C]. In: Wireless PervasiveComputing, 2006.
[109] NetFPGA[EB/OL]. 2003. http://netipga.org/.
[110]王浩学，汪斌强，兰巨龙．基于开放可重构路由交换平台的新型网络体系[J].电信科学2008.7, 24(7):44-48.
[111] Wilson, R.J. (1972).Introduction to Graph Theory [M], Oliver and Boyd, Edinburgh.
[112] H. Zhang, A. Durresi. Differentiated Multi-Layer Survivability in IP/WDM Networks [C].In:Proc.IEEE/IFIP NOMS’2002, Florence, Italy, April 2002, pp. 681-694.
[113] Debasis Mitra, John Morrison.Virtual Private Networks: Joint Resource Allocation AndRouting Design[C]. In: IEEE ICC’99, 1999, Vol.2:21-25.
[114] A. Girard. Routing and Dimentioning in Circuit-Switched Networks [M].Addison-Wesley, 1990, pages: 556.
[115] F. P. Kelly. Routing in Circuit-switched Networks: Optimization, Shadow Prices andDecentralization [J]. Advances in AppliedProbability, 1988, Vol.20:112-144.
[116] M. Yu, Y. Yi, J. Rexford, and M. Chiang.Rethinking Virtual Network Embedding:Substrate Support for Path Splitting and Migration [R]. Princeton University, TechnicalReport TR-788-07, July 2007.
[117]姜明.逻辑承载网构建中的数学建模[J].信息工程大学学报, 2009.1, 10(1):50-52.
[118]于婧.面向服务的逻辑承载网构建方法研究[J].信息工程大学学报, 2009.1,10(1):57-60.
[119] R.K.Ahuja, T.L.Magnanti, J.B.Orlin. Network flows: theory, algorithms, and applications [M].1993.
[120] J.Kleinberg. Approximation Algorithms for Disjoint Paths Problems [D]. PhD thesis, MIT,1996.
[121] Cui Y, Wu JP, Xu K. Research on Internetwork QoS Routing Algorithms: A survey [J].Journal of Software, 2002, 13(11):2065-2075.
[122]邹园萍.基于MPLS和DiffServ的域内蒙古自治区网络资源配置方法[J].电子与信息学报，2007. 29(1):214-217.
[123] Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and MungChiang. Davinci: Dynamically Adaptive Virtual Networks for a Customized Internet [C].In: ACM CoNEXT, Madrid, SPAIN, 2008, pp.1-12.
[124] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts.On-line Load Balancing withApplications to Machine Scheduling and Virtual Circuit Routing [C]. In: Proc. ACMsymposium on Theory of computing, 1993, pp. 623-631.
[125] Y. Azar, B. Kalyanasundaram, S. A. Plotkin, K. Pruhs, and O. Waarts. Online LoadBalancing of Temporary Tasks [C]. In: Proc. Workshop on Algorithms and DataStructures, 1993, 22(11):119-130.
[126]王华.MPLS及IP网络流量工程的研究[D].南京:南京理工大学. 2003.4.
[127] E.J.Anderson. A multicommodity flow based approach to adaptive internet routing [D]. Ph.D Thesis, University of Washington, 2002.
[128] S. Even.On the Complexity of Timetable and Multicommodity Flow Problems [J]. SIAMJournal on Computing. pp.691-703.SIAM.doi:10.1137/0205048.
[129] George Karakostas. Faster Approximation Schemes for Fractional Multicommodity FlowProblems[C]. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, 2002, pp.166-173.
[130] Kodialam M S and Lakshman T V. Minimum Interference Routing with Applications to MPLS Traffic Engineering[C]. In: Proc. of IEEE INFOCOM2000, Vol.2: 884-893.
[131]唐治果，李乐民．针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报，2007.29(5)：1187-1190．
[132] J. He and J. Rexford. Towards Internet-wide Multipath Routing [J]. IEEE NetworkMagazine Special Issue on Scalability, March 2008, 22(2):16-21.
[133] P. Key, L. Massoulie, and D. Towsley. Path Selection and Multipath Congestion Control[C]. In: Proc. IEEE INFOCOM07, 2007, pp.143-151.
[134] A. Sundararaj, A. Gupta, and P. Dinda. Dynamic Topology Adaptation in VirtualNetworks of Virtual Machines [C]. In: LCR 2004 Proceedings of the Seventh Workshopon Langauges, Compilers and Run-time Support for Scalable Systems. 81(3): 1-8.
[135] Joe Touch.Dynamic Internet Overlay Deployment and Management Using the x-bone [J].Computer Networks, 2001, 36(2):117-135.
[136] Jinliang Fan and Mostafa H.Ammar.Dynamic Topology Reconfiguration of OverlayNetworks: Structure and Approximation of Optimal Policies [EB/OL]. Georgia Instituteof Technology, 2004. http://www.cc.gatech.edu/～jlfan/policy-techreport.pdf
[137] Yi Wang. Virtual Routers on the Move: Live Router Migration as aNetwork-Management Primitive[C]. In: SIGCOMM'08, Seattle, Washington, USApp.231-242.
[138] M. Harchol-Baiter, A. B. Downey. Exploiting Process Lifetime Distributions forDynamic Load Balancing [J]. ACM Transactions on Computer Systems, 1997,15(3):253-285.
[139] Zhenhai Duan, Zhi-Li Zhang. A Core Stateless Bandwidth Broker Architecture forScalable Support of Guaranteed Services [J]. IEEE Transactions on Parallel andDistributed Systems, January 2004, 15(1): 167-182.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |