| 注册
首页|期刊导航|重庆邮电学院学报(自然科学版)|光分组交换的最小开销调度法

光分组交换的最小开销调度法

李季碧 毛期俭 张治中

重庆邮电学院学报(自然科学版)2006,Vol.18Issue(2):178-182,5.
重庆邮电学院学报(自然科学版)2006,Vol.18Issue(2):178-182,5.

光分组交换的最小开销调度法

Minimum overhead scheduling of optical packet switches

李季碧 1毛期俭 1张治中1

作者信息

  • 1. 重庆邮电学院,重庆,400065
  • 折叠

摘要

Abstract

During scheduling optical packets in an optical switch, the main problem focus on finding a schedule to send all packets to the output ports in minimum makespan, which include the actual traffic-sending time and the reconfiguration delay. In order to attain this aim, a new Traffic Exhaust Matching (TEM) algorithm based on leaky bucket is presented in this paper. The time complexity of this novel algorithm is O(N2) and it can achieve 100% throughput. Simulation results demonstrate that TEM is superior to other algorithms such as ADJUST and DOUBLE in terms of traffic transmission delay and time complexity.

关键词

光分组交换/最小时延/切换时延/调度算法

Key words

optical packet switches/minimum overhead/reconfiguration delay/scheduling algorithm

分类

信息技术与安全科学

引用本文复制引用

李季碧,毛期俭,张治中..光分组交换的最小开销调度法[J].重庆邮电学院学报(自然科学版),2006,18(2):178-182,5.

基金项目

重庆市教委基金(040502 ()

040504 ()

KJ050504) ()

重庆市科委基金(2005BB2066) (2005BB2066)

重庆邮电学院教改基金(0970101)This work was supported by Chongqing committee of education Fund (040502 (0970101)

040504 ()

KJ050504) ()

Chongqing committee of science Fund(2005 BB2066) and Education reform fund of chongqing university of Posts and telecommunications(0970101). (2005 BB2066)

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

OACSTPCD

1673-825X

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