基于Hopfield神经网络的WDM光互联系统QoS并行调度

P. Tien, Bo-Yu Ke
{"title":"基于Hopfield神经网络的WDM光互联系统QoS并行调度","authors":"P. Tien, Bo-Yu Ke","doi":"10.1109/HPSR.2011.5986038","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel ranked Hopfield neural-network (RHNN) parallel scheduler for a WDM optical interconnection system (WOPIS), containing a set of Clos-like optical switches and a handful of output FDL-based optical buffers. The RHNN scheduler determines an optimal set of neurons (I/O paths) to be enabled, achieving maximal system throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. The RHNN is specially structured with ranked neurons. With each neuron being associated with an input/output path within WOPIS, the RHNN allows higher-rank neurons (higher-priority and/or lower-delay paths) to disable lower-rank neurons that were enabled during previous iterations. Ranking the neurons unfortunately gives rise to a convergence problem. We present two theorems that supply the sufficient conditions for the RHNN scheduler to converge to the optimal solution. We demonstrate via simulation results that, with the computation time of less than one system time slot, the RHNN scheduler achieves near 100% throughput and multi-level prioritized scheduling.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new ranked Hopfield neural networks approach to QoS parallel scheduling for WDM optical interconnection system\",\"authors\":\"P. Tien, Bo-Yu Ke\",\"doi\":\"10.1109/HPSR.2011.5986038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel ranked Hopfield neural-network (RHNN) parallel scheduler for a WDM optical interconnection system (WOPIS), containing a set of Clos-like optical switches and a handful of output FDL-based optical buffers. The RHNN scheduler determines an optimal set of neurons (I/O paths) to be enabled, achieving maximal system throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. The RHNN is specially structured with ranked neurons. With each neuron being associated with an input/output path within WOPIS, the RHNN allows higher-rank neurons (higher-priority and/or lower-delay paths) to disable lower-rank neurons that were enabled during previous iterations. Ranking the neurons unfortunately gives rise to a convergence problem. We present two theorems that supply the sufficient conditions for the RHNN scheduler to converge to the optimal solution. We demonstrate via simulation results that, with the computation time of less than one system time slot, the RHNN scheduler achieves near 100% throughput and multi-level prioritized scheduling.\",\"PeriodicalId\":269137,\"journal\":{\"name\":\"2011 IEEE 12th International Conference on High Performance Switching and Routing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 12th International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2011.5986038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2011.5986038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们提出了一种用于WDM光互连系统(WOPIS)的新型排名Hopfield神经网络(RHNN)并行调度程序,该调度程序包含一组类clos光开关和少量基于输出fdl的光缓冲器。RHNN调度器确定要启用的一组最优神经元(I/O路径),在不受交换机和缓冲区争用约束的情况下实现最大的系统吞吐量和优先级区分。RHNN是由特殊的排序神经元组成的。由于每个神经元都与WOPIS中的输入/输出路径相关联,RHNN允许高阶神经元(高优先级和/或低延迟路径)禁用在前一次迭代中启用的低阶神经元。不幸的是,给神经元排序会引起一个收敛问题。给出了RHNN调度算法收敛于最优解的两个充分条件。仿真结果表明,RHNN调度器在计算时间少于一个系统时隙的情况下,实现了接近100%的吞吐量和多级优先级调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new ranked Hopfield neural networks approach to QoS parallel scheduling for WDM optical interconnection system
In this paper, we propose a novel ranked Hopfield neural-network (RHNN) parallel scheduler for a WDM optical interconnection system (WOPIS), containing a set of Clos-like optical switches and a handful of output FDL-based optical buffers. The RHNN scheduler determines an optimal set of neurons (I/O paths) to be enabled, achieving maximal system throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. The RHNN is specially structured with ranked neurons. With each neuron being associated with an input/output path within WOPIS, the RHNN allows higher-rank neurons (higher-priority and/or lower-delay paths) to disable lower-rank neurons that were enabled during previous iterations. Ranking the neurons unfortunately gives rise to a convergence problem. We present two theorems that supply the sufficient conditions for the RHNN scheduler to converge to the optimal solution. We demonstrate via simulation results that, with the computation time of less than one system time slot, the RHNN scheduler achieves near 100% throughput and multi-level prioritized scheduling.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Assessing network vulnerability under probabilistic region failure model Group-based two-hop relay with redundancy in MANETs Evaluating the energy-awareness of future Internet devices FPGA implementation of lookup algorithms StablePlus: A practical 100% throughput scheduling for input-queued switches
×
引用
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