%0 Journal Article
%T Minimum overhead scheduling of optical packet switches<br>光分组交换的最小开销调度法
%A LI Ji-bi
%A MAO Qi-jian
%A ZHANG Zhi-zhong
%A <br>李季碧
%A 毛期俭
%A 张治中
%J 重庆邮电大学学报(自然科学版)
%D 2006
%I 
%X 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.
%K optical packet switches
%K minimum overhead
%K reconfiguration delay
%K scheduling algorithm<br>光分组交换
%K 最小时延
%K 切换时延
%K 调度算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=96E6E851B5104576C2DD9FC1FBCB69EF&jid=5C2694A2E5629ECD6B59D7B28C6937AD&aid=32FE2E884C0F9E33&yid=37904DC365DD7266&vid=13553B2D12F347E8&iid=0B39A22176CE99FB&sid=4609832E4B5C797B&eid=B1F98368A47B8888&journal_id=1673-825X&journal_name=重庆邮电大学学报(自然科学版)&referenced_num=1&reference_num=8