检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学通信与信息工程学院,南京210003
出 处:《光通信研究》2016年第2期22-23,36,共3页Study on Optical Communications
摘 要:生存性是WDM(波分复用)光网络的核心技术之一,对多播业务而言,IpC(智能P圈保护)是一种具有快速、高效等特点的保护算法。文章提出一种EIpC(增强型智能P圈)保护方案,包括分段和路径IpC算法,分段和路径IpC算法分别为每个分段和路径寻找新的P圈。理论分析和仿真结果表明,路径IpC在资源利用率、P圈构造个数以及圈平均覆盖度等方面最优,分段IpC次之,传统(链路)IpC最低。在先验效率方面,链路IpC最优,分段IpC次之,路径IpC最低。Survivability is one of the most important promising technologies in Wavelength Division Multiplexing(WDM)networks.The P-cycle based dynamic multicast protection scheme(IpC)is widely accepted as a good solution due to its fast restoration time and high capacity efficiency.This paper presents an improved IpC mechanism named EIpC including both the segment IpC and the path IpC algorithm simultaneously.The main feature of EIpC is to use segment IpC algorithm to find a new P-cycle for a segment and path IpC algorithm to find a new P-cycle for a path,respectively.Theoretical analysis and simulation results show that the path IpC has better performance in resource utilization,the number of P-cycle(s)and the P-cycle's average coverage,than the segment IpC and the classical(link)IpC.However,the link IpC has a higher average AE than the segment IpC and the path IpC.
分 类 号:TN915.01[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33