可重构网络中的一种新型端到端服务供应模型  

A Novel End-to-end Service Provisioning Model in Reconfigurable Network

作　　者：马丁[1,2] 庄雷[1] 兰巨龙[3] 慕小武 

机构地区：[1]郑州大学信息工程学院,河南郑州450001 [2]河南工业大学信息科学与工程学院,河南郑州450001 [3]国家数字交换系统工程技术研究中心,河南郑州450002 [4]郑州大学数学与统计学院,河南郑州450001

出　　处：《郑州大学学报（工学版）》2017年第6期11-16,共6页Journal of Zhengzhou University（Engineering Science）

基　　金：国家重点基础研究发展计划("973"计划)(2012CB315901);国家自然科学基金资助项目(61379079);河南省国际合作项目(152102410021)

摘　　要：现有服务承载网的构建方法均未考虑用户请求所属的业务类别,导致业务承载与服务供应缺少有效的串联.针对该问题,提出了一种新型的端到端服务供应模型,从承载同类别业务的角度构建服务承载网,通过在服务承载网上构建服务路径提供可定制的端到端服务.为验证模型的可行性和有效性,设计了一种基于跳数约束的服务承载网构建算法,并使用经典的Layered Graph算法构建服务路径.实验结果体现了在不同的负载压力下,跳数约束对开销、收益、接受率、路径长度等性能评价指标的影响,从而验证了模型和算法的有效性,提供了性价比最优的服务承载网构建决策.当跳数约束等于3时,取得了与跳数约束等于4或5时相近的性能,同时分别节省了约50%或75%的构建开销.Current service carrying network mapping algorithms ignored the business category of the service re -quest,which resulted in the disconnection between the business carrying phase and the service provisioning phase.To address this problem,a novel end-to-end service provisioning model was proposed,in which service carrying networks were constructed considering aggregating service requests belonging to the same business cat -egory and customized end-to-end services were provided via establishing the corresponding service path over the service carrying network.To evaluate the feasibility and effectiveness of the proposed model,a service car-rying network mapping algorithm with hop constraint was and desighed Layered Graph algorithm was used to select service path.Simulation experiments on a large mix of service requests showed the impact the hop con-straint had on network performance in terms of cost, revenue,acceptance ratio, length of service path, etc. under different working load,validated the effectiveness of the proposed model and algorithms,and eventually determined the optimal value of hops.When the value of hops equaled 3,compared with the situation in which the value of hops equals 4 or 5,the achieved performance was approximately same,and about 50 percent and 75 percent cost of constructing service carrying network can be saved respectively.

关 键 词：可重构网络 元能力 服务承载网 服务供应模型 服务路径 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]