| 注册
首页|期刊导航|重庆邮电大学学报(自然科学版)|基于区域扩展的绿色业务量疏导算法

基于区域扩展的绿色业务量疏导算法

王汝言 徐印 吴大鹏 彭海英

重庆邮电大学学报(自然科学版)2012,Vol.24Issue(2):133-137,158,6.
重庆邮电大学学报(自然科学版)2012,Vol.24Issue(2):133-137,158,6.DOI:10.3979/j.issn.1673-825X.2012.02.002

基于区域扩展的绿色业务量疏导算法

Green traffic grooming in zone-based scalable optical networks

王汝言 1徐印 1吴大鹏 1彭海英1

作者信息

  • 1. 重庆邮电大学光互联网及光信息处理研究所,重庆400065
  • 折叠

摘要

Abstract

In the view of high blocking probability of Traditional Green traffic grooming algorithm in optical networks, a Green traffic grooming in zone-based scalable optical networks is proposed and studied in this paper. On the basis of W + 5 Auxiliary Graph Model, generating an auxiliary graph which only contains parts of network nodes, it is possible to find a suitable and shorter route by flexibility to expand the auxiliary graph. Simulation results show that in comparison with the Traditional Green traffic grooming algorithm, the proposed algorithm can effectively reduce the blocking probability and achieve the lowest average power consumption when traffic load is relatively high.

关键词

业务量疏导/功耗/区域扩展

Key words

traffic grooming/power consumption/zone-based scalable

分类

信息技术与安全科学

引用本文复制引用

王汝言,徐印,吴大鹏,彭海英..基于区域扩展的绿色业务量疏导算法[J].重庆邮电大学学报(自然科学版),2012,24(2):133-137,158,6.

基金项目

国家自然科学基金项目(60972096) (60972096)

重庆市科委自然科学基金(CSTC2011BA2041) (CSTC2011BA2041)

重庆邮电大学启动基金(A2009-07)资助 (A2009-07)

重庆邮电大学基金(A2011-14) (A2011-14)

重庆市教委项目(KJ110531)资助 (KJ110531)

重庆邮电大学学报(自然科学版)

OA北大核心CSCDCSTPCD

1673-825X

访问量0
|
下载量0
段落导航相关论文