MinPSL: WDM星型网络中一种基于智能全局消息重排序的高性能调度协议

P. A. Tsimoulas, G. Papadimitriou, A. Pomportsis
{"title":"MinPSL: WDM星型网络中一种基于智能全局消息重排序的高性能调度协议","authors":"P. A. Tsimoulas, G. Papadimitriou, A. Pomportsis","doi":"10.1109/ISADS.2009.5207392","DOIUrl":null,"url":null,"abstract":"Several well-known scheduling schemes like EATS and MSL seem to suffer notable performance degradation under the realistic conditions of non-uniform destinations and non-negligible transceiver tuning latencies that apply in practical WDM star networks. Our EMPS protocol has been shown to noticeably increase the performance of practical networks of this kind. Nonetheless, EMPS tries to balance the offered load by only considering the heads of the message queues maintained by the source nodes; therefore, its performance is degraded, especially for medium to high offered loads and for rather slowly tunable transceivers. In this article we propose the Minimization of Probability and Size of scheduling Latency (MinPSL) protocol, which examines each source node's message queue at a certain depth and reorders messages intelligently on the basis of receiver availability. MinPSL perfectly minimizes the probability of having to schedule two or more messages intended for the same destination simultaneously or at close times. The proposed scheme also minimizes the actual performance penalty incurred, when scheduling of consecutive messages with the same destination cannot be avoided. Extensive simulations are carried out in order to study the performance of MinPSL and compare it to EMPS under various conditions. The simulation results ascertain the fact that MinPSL always brings about a considerable performance improvement.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MinPSL: A high-performance scheduling protocol based on intelligent global message reordering in WDM star networks\",\"authors\":\"P. A. Tsimoulas, G. Papadimitriou, A. Pomportsis\",\"doi\":\"10.1109/ISADS.2009.5207392\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several well-known scheduling schemes like EATS and MSL seem to suffer notable performance degradation under the realistic conditions of non-uniform destinations and non-negligible transceiver tuning latencies that apply in practical WDM star networks. Our EMPS protocol has been shown to noticeably increase the performance of practical networks of this kind. Nonetheless, EMPS tries to balance the offered load by only considering the heads of the message queues maintained by the source nodes; therefore, its performance is degraded, especially for medium to high offered loads and for rather slowly tunable transceivers. In this article we propose the Minimization of Probability and Size of scheduling Latency (MinPSL) protocol, which examines each source node's message queue at a certain depth and reorders messages intelligently on the basis of receiver availability. MinPSL perfectly minimizes the probability of having to schedule two or more messages intended for the same destination simultaneously or at close times. The proposed scheme also minimizes the actual performance penalty incurred, when scheduling of consecutive messages with the same destination cannot be avoided. Extensive simulations are carried out in order to study the performance of MinPSL and compare it to EMPS under various conditions. The simulation results ascertain the fact that MinPSL always brings about a considerable performance improvement.\",\"PeriodicalId\":342911,\"journal\":{\"name\":\"2009 International Symposium on Autonomous Decentralized Systems\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Symposium on Autonomous Decentralized Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISADS.2009.5207392\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Symposium on Autonomous Decentralized Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2009.5207392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

一些著名的调度方案,如EATS和MSL,在实际WDM星形网络中应用的非均匀目的地和不可忽略的收发器调优延迟的现实条件下,似乎会遭受明显的性能下降。我们的EMPS协议已被证明可以显著提高这类实际网络的性能。尽管如此,EMPS试图通过只考虑源节点维护的消息队列的头部来平衡提供的负载;因此,它的性能下降,特别是对于中等到高提供负载和相当缓慢可调的收发器。在本文中,我们提出了最小化调度延迟(MinPSL)协议,该协议在一定深度检查每个源节点的消息队列,并根据接收方的可用性智能地重新排序消息。MinPSL完美地减少了必须同时或在关闭时间调度用于同一目的地的两条或多条消息的可能性。当无法避免对具有相同目的地的连续消息进行调度时,所提出的方案还最大限度地减少了实际的性能损失。为了研究MinPSL在各种条件下的性能并与EMPS进行比较,进行了大量的仿真。仿真结果表明,MinPSL总能带来相当大的性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MinPSL: A high-performance scheduling protocol based on intelligent global message reordering in WDM star networks
Several well-known scheduling schemes like EATS and MSL seem to suffer notable performance degradation under the realistic conditions of non-uniform destinations and non-negligible transceiver tuning latencies that apply in practical WDM star networks. Our EMPS protocol has been shown to noticeably increase the performance of practical networks of this kind. Nonetheless, EMPS tries to balance the offered load by only considering the heads of the message queues maintained by the source nodes; therefore, its performance is degraded, especially for medium to high offered loads and for rather slowly tunable transceivers. In this article we propose the Minimization of Probability and Size of scheduling Latency (MinPSL) protocol, which examines each source node's message queue at a certain depth and reorders messages intelligently on the basis of receiver availability. MinPSL perfectly minimizes the probability of having to schedule two or more messages intended for the same destination simultaneously or at close times. The proposed scheme also minimizes the actual performance penalty incurred, when scheduling of consecutive messages with the same destination cannot be avoided. Extensive simulations are carried out in order to study the performance of MinPSL and compare it to EMPS under various conditions. The simulation results ascertain the fact that MinPSL always brings about a considerable performance improvement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信