A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network

M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase
{"title":"A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network","authors":"M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase","doi":"10.1109/GLOCOM.2002.1189127","DOIUrl":null,"url":null,"abstract":"We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2002.1189127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

Abstract

We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种最小化光突发交换WDM网络中到达突发所产生空隙的调度算法
提出了一种最小化光突发交换WDM网络中到达突发所产生的空洞的调度算法。在本文提出的调度算法中,当突发在一定时间到达光核心路由器时,可以利用未使用的数据信道容量在某些数据信道中传输(称为空闲),我们提出的调度算法选择突发传输后新产生的空闲最小的数据信道。通过计算机仿真,比较了本文提出的调度算法与传统调度算法在突发损耗率方面的性能。实验表明,该算法能有效地提高突发损失率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reconfiguration heuristics for logical topologies in wide-area WDM networks Dependent data broadcasting for unordered queries in a multiple channel mobile environment Performance analysis of TCM with generalized selection combining on Rayleigh fading channels Quasi-orthogonal space-time block codes with full diversity Hybrid flooding and tree-based broadcasting for reliable and efficient link-state dissemination
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1