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

发布时间：2018-01-29 04:01

本文关键词： 可重构网络元能力服务承载网服务供应模型服务路径　出处：《郑州大学学报(工学版)》2017年06期 　论文类型：期刊论文

【摘要】：现有服务承载网的构建方法均未考虑用户请求所属的业务类别,导致业务承载与服务供应缺少有效的串联.针对该问题,提出了一种新型的端到端服务供应模型,从承载同类别业务的角度构建服务承载网,通过在服务承载网上构建服务路径提供可定制的端到端服务.为验证模型的可行性和有效性,设计了一种基于跳数约束的服务承载网构建算法,并使用经典的Layered Graph算法构建服务路径.实验结果体现了在不同的负载压力下,跳数约束对开销、收益、接受率、路径长度等性能评价指标的影响,从而验证了模型和算法的有效性,提供了性价比最优的服务承载网构建决策.当跳数约束等于3时,取得了与跳数约束等于4或5时相近的性能,同时分别节省了约50%或75%的构建开销.
[Abstract]:The existing service hosting network construction methods do not consider the service category to which the user request belongs, which leads to the lack of effective series-connection between service bearer and service supply. A new end-to-end service supply model is proposed to construct the service carrying network from the point of view of carrying the same kind of service. In order to verify the feasibility and validity of the model, an algorithm for constructing service bearer network based on hops constraints is designed by constructing the service path on the service bearer network to provide customized end-to-end services. And the classic Layered Graph algorithm is used to construct the service path. The experimental results show that under different load pressures, hops constraints on the overhead, revenue, acceptance rate. The effectiveness of the model and algorithm is verified by the influence of the performance evaluation index such as path length, and the decision of constructing the service carrying network with the best cost performance ratio is provided, when the hop number constraint is equal to 3:00. The performance is similar to the number of hops constraint equal to 4 or 5:00, and the construction cost of about 50% or 75% is saved, respectively.
【作者单位】：郑州大学信息工程学院;河南工业大学信息科学与工程学院;国家数字交换系统工程技术研究中心;郑州大学数学与统计学院;
【基金】：国家重点基础研究发展计划(“973”计划)(2012CB315901) 国家自然科学基金资助项目(61379079) 河南省国际合作项目(152102410021)
【分类号】：TP393.09
【正文快照】： 0引言随着互联网规模的增长以及应用范围的扩展,端系统的多样化以及新兴通信模式的不断涌现,互联网内的体系结构“僵化”[1]、可扩展性差等缺点开始逐渐显现,在互联网中增加新的功能和部署新的业务变得非常困难.在当前互联网的体系结构中,大多数复杂的网络功能和数据通信服务

【相似文献】