重庆邮电大学学报（自然科学版）2007，Vol.19Issue(1)：108-113,6.
具有切换时延的异步光分组交换调度方案
Packet scheduling scheme for asynchronous optical switches with reconfiguration delay
摘要
Abstract
Scheduling algorithm and switch fabric of optical switch are two major factors of optical switch, the optical switch fabrics may work in synchronous or asynchronous fashion. Previously, much work has been done for the synchronous optical switch scheduling, but few works focus on asynchronous optical switch scheduling (AOSS). In this paper, a new scheduling algorithm, Longest Element Transmission First (LETF), is proposed, which works under asynchronous schedule conditions with reconfiguration delay. LETF firstly proved to be an optimum schedule by switches with two ports and then 2 approximation for larger switches. We prove that AOSS problem is NP-hard for switches with more than three ports by formulating it as an open shop problem. The theory analysis and simulation results demonstrate that the novel algorithm runs at O(N) time complexity, achieves 100% throughout and performs abysmally close to the optimal scheduling in average cases by using minimum speedup.关键词
异步光交换/切换时延/调度算法Key words
asynchronous optical switches/reconfiguration delay/scheduling algorithm分类
信息技术与安全科学引用本文复制引用
李季碧,陈恒志,张治中..具有切换时延的异步光分组交换调度方案[J].重庆邮电大学学报（自然科学版）,2007,19(1):108-113,6.基金项目
This paper is supported by scientific research fund of Chongqing Municipal Education Commission(040504 （）
KJ050504,040502) and Chongqing Science & Technology Commission(2005BB2066). （2005BB2066）
