检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国家数字交换系统工程技术研究中心,郑州450002
出 处:《电子与信息学报》2013年第1期126-132,共7页Journal of Electronics & Information Technology
基 金:国家973计划项目(2012CB315901;2012CB315905);国家863计划项目(2011AA01A103)资助课题
摘 要:可重构柔性网络链路失效将严重影响其上承载的可重构服务承载网(RSCN)的可靠性。文章基于路径备份策略着重解决时延敏感类型RSCN的可靠性问题,并提出分阶段处理方式进一步优化备份资源消耗。在拓扑预处理阶段,根据RSCN是否支持路径分裂分别提出分裂的最小备份拓扑生成(S-MBT-Gen)算法和最小备份生成树(MBST-Gen)算法,减小备份拓扑带宽约束总量;在拓扑映射阶段,提出主备拓扑协同映射(RNM-PBT)算法,协调利用底层网络资源。仿真结果表明,本文提出的算法降低了RSCN平均资源消耗,且具有较高的请求接受率和较低的平均执行时间。The substrate link failures have made a great impact on the reliability of Reconfigurable Service Carrying Networks (RSCNs) over Reconfigurable Flexible Network (RFNet). In this paper, the reliability problem of delay-sensitive RSCNs is solved based on a path backup strategy, and a two-stage approach is presented to further reduce the backup resource cost. In the topology preprocessing stage, according to whether the path split is supported by RSCNs, the Splittable Minimum Backup Topology Generation (S-MBT-Gen) and Minimum Backup Spanning Tree Generation (MBST-Gen) algorithms are respectively proposed to reduce the total bandwidth constraints of backup topology. In the topology mapping stage, a Reconfigurable service carrying Network Mapping algorithm with coordinated Primary and Backup Topology (RNM-PBT) is proposed to make the best of the substrate network resource. The simulation experiments show that our proposed algorithms can reduce the average resource cost and execution time cost, while improving the request accepted ratio of RSCNs.
关 键 词:可重构柔性网络 可重构服务承载网 可靠性映射 最小备份拓扑 时延敏感
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40