期刊文献+

基于分簇的动态业务量疏导区分保护策略

Differentiated protection strategy with dynamic traffic grooming based on clustering
下载PDF
导出
摘要 为对动态业务快速有效疏导,并实现智能区分保护,提出一种基于分簇业务量疏导的动态区分保护策略。该策略基于极大独立集将网络有效分簇,减小疏导寻路耗时;同时将分层辅助图、波长剩余容量矩阵及簇汇聚层相互协同,对簇内簇间业务疏导,实现资源的合理规划,提高疏导效率;其后通过感知各优先级业务比例划分波长链路重要度,设计智能P圈进行区分保护。仿真表明,所提策略能更充分利用资源,且随负载增加有较好的阻塞率性能。 To make dynamic traffic grooming faster and more efficient, and achieve an intelligent differentiated protection, a differentiated protection strategy with dynamic traffic grooming based on clustering(DPS-DTGC) was proposed. The whole network topology was allocated some clusters based on maximal independent set, in order to reduce the routing time consumption. Meanwhile, by the cooperation of layered auxiliary graph, residual capacity matrix and cluster aggregation layer, the traffic in inter- and intra- clusters would been groomed to realize the reasonable planning of resources and the higher efficiency of grooming. Furthermore, according to the proportion of different priority traffic in one wavelength, the link importance was evaluated and a smart P-cycle was designed to give differentiated protection to the link. The simulation results show this strategy can make a better utilization of network resource. And with the increase of network load, it will gain a good performance in blocking rate.
出处 《通信学报》 EI CSCD 北大核心 2015年第10期37-46,共10页 Journal on Communications
基金 国家自然科学基金资助项目(61401052) 重庆市自然科学基金资助项目(2011BA2041) 重庆市教委科学技术研究基金资助项目(KJ110531 KJ1400418) 重庆邮电大学博士启动基金资助项目(A2015-09)~~
关键词 WDM网络 动态业务量疏导 智能P圈 区分保护 WDM network dynamic traffic grooming smart P-cycle differentiated protection
  • 相关文献

参考文献10

  • 1YE Z, CAO X, GAO X, et al. A predictive and incremental grooming scheme for time-varying traffic in WDM networks [A]. INFOCOM 2013 Proceedings IEEE[C]. Turin, 2013.395-399.
  • 2JAEKEL A, BARI A, RAHMAN Q, et al. Resource efficient network design and traffic grooming strategy with guaranteed survivability [J]. Optical Switching and Networking, 2012, 9(4): 271-285.
  • 3ZHU K, MUKHERJEE B. Traffic grooming in an optical WDM mesh network [J]. IEEE Journal on Selected Areas in Communications, 2002, 20(1): 122-133.
  • 4DE T, PAL A, SENGUPTA I. Traffic grooming, routing, and wave- length assignment in an optical WDM mesh networks based on clique partitioning[J]. Photonic Network Communications, 2010, 20(2): 101-112.
  • 5WU J, GUO L, WEI X, et al. Survivable integrated grooming in multi-granularity optical networks [J]. Optical Fiber Technology, 2012, 18(3): 146-156.
  • 6GAO C, CANKAYA H C, PATEL A N, et al. Survivable impair- merit-aware traffic grooming and regenerator placement with connec- tion-level protection [J]. IEEE/OSA Journal of Optical Communica- tions and Networking, 2012, 4(3): 259-270.
  • 7ALSHAER H, ELMIRGHANI J M H. Probabilistic differentiated availability services in WDM networks protected by shared protection schemes [A]. 2011 IFIP/IEEE International Symposium on Integrated Network Management (IND [C]. Dublin, 2011.281-288.
  • 8DIKBIYIK F, TOMATORE M, MUKHERJEE B. Exploiting excess capacity for survivable traffic grooming in optical backbone net-works[J]. Journal of Optical Communications and Networking, 2014, 6(2): 127-137.
  • 9LIU V Y, TIPPER D. Spare capacity allocation using shared backup path protection for dual link failures [J]. Computer Communications, 2013, 36(6): 666-677.
  • 10WU B, YEUNG K L, HOP H. ILP formulations for p-cycle design without candidate cycle enumeration [J]. IEEE/ACM Transactions on Networking (TON), 2010, 18(1 ): 284-295.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部