该文研究了IMS(IP Multimedia Subsystem)中的呼叫建立流程,以确定可以优化的信令流量,研究结果显示:S-CSCF(Serving Call Session Control Function)是IMS中的瓶颈点。为了降低会话建立时延,提高系统性能,提出了一种基于组的业务触发算...该文研究了IMS(IP Multimedia Subsystem)中的呼叫建立流程,以确定可以优化的信令流量,研究结果显示:S-CSCF(Serving Call Session Control Function)是IMS中的瓶颈点。为了降低会话建立时延,提高系统性能,提出了一种基于组的业务触发算法(Group based Service Triggering Algorithm,GSTA),然后对现有3GPP(3rd Generation Partnership Project)提出的业务触发算法(3GPP STA,3GPP Service Triggering Algorithm)和GSTA进行了性能建模,理论分析和仿真结果表明GSTA可以有效地降低S-CSCF的信令流量,增加了整个系统的吞吐量,同时显著减少了会话建立时延,提高了IMS网络的服务质量。展开更多
研究了新型动态p-cycle保护算法,并且根据网络环境和动态业务矩阵的变化提出了一种新型的基于业务预测矩阵的动态p-cycle算法RSPC-DP(Routing in Spare plus Protecting Capacity Dynamic p-cycle),对此算法从阻塞率、保护容量比例以及...研究了新型动态p-cycle保护算法,并且根据网络环境和动态业务矩阵的变化提出了一种新型的基于业务预测矩阵的动态p-cycle算法RSPC-DP(Routing in Spare plus Protecting Capacity Dynamic p-cycle),对此算法从阻塞率、保护容量比例以及控制开销3个方面进行了仿真分析,结果表明,RSPC-DP算法可以动态地根据业务的变化计算保护p-cycle集合。展开更多
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
文摘该文研究了IMS(IP Multimedia Subsystem)中的呼叫建立流程,以确定可以优化的信令流量,研究结果显示:S-CSCF(Serving Call Session Control Function)是IMS中的瓶颈点。为了降低会话建立时延,提高系统性能,提出了一种基于组的业务触发算法(Group based Service Triggering Algorithm,GSTA),然后对现有3GPP(3rd Generation Partnership Project)提出的业务触发算法(3GPP STA,3GPP Service Triggering Algorithm)和GSTA进行了性能建模,理论分析和仿真结果表明GSTA可以有效地降低S-CSCF的信令流量,增加了整个系统的吞吐量,同时显著减少了会话建立时延,提高了IMS网络的服务质量。
文摘研究了新型动态p-cycle保护算法,并且根据网络环境和动态业务矩阵的变化提出了一种新型的基于业务预测矩阵的动态p-cycle算法RSPC-DP(Routing in Spare plus Protecting Capacity Dynamic p-cycle),对此算法从阻塞率、保护容量比例以及控制开销3个方面进行了仿真分析,结果表明,RSPC-DP算法可以动态地根据业务的变化计算保护p-cycle集合。
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
