摘要
研究了多域光网络中的路由保护问题;为了克服多域光网络中可扩展性约束,提出了一种混合拓扑聚合方法。该方法结合了全连通和生成树拓扑聚合的优点,在网络中需要存储和发布的链路状态信息与聚合信息反映实际物理拓扑的精确性之间进行了折中;然后在此混合拓扑聚合方法的基础上,提出了一种基于查询机制的多域分段保护算法。仿真表明,相比传统的多域保护算法,该算法阻塞率低,可扩展性好。
In order to deal with the survivability problem in multi-domain optical mesh networks,this paper proposed a new hybrid topology aggregation scheme at first.This scheme combined the advantages of the full mesh model and spanning tree model to tradeoff between accuracy in preserving the original topological features and compactness in representation to achieve scaling.Then it proposed an improved segment-shared protection approach called HTASP.Simulation evaluation shows that the proposed scheme is effective in multi-domain path protection with lower blocking probabilities and less inter-domain link update messages
出处
《计算机应用研究》
CSCD
北大核心
2012年第9期3369-3371,3375,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61071117
60972069)
重庆市科委自然科学基金资助项目(CSTC2010BB2413)
重庆市教委资助项目(KJ110527)
重庆邮电大学自然科学基金资助项目(A2009-32
A2009-38)
关键词
多域光网络
全连通拓扑聚合
生成树拓扑聚合
混合拓扑聚合
分段保护
multi-domain optical mesh networks
full mesh topology aggregation
spanning tree hybrid topology aggregation
hybrid topology aggregation
segment-shared protection