{"title":"WDM光交换系统的并行优先调度","authors":"P. Tien, Bo-Yu Ke","doi":"10.1109/HPSR.2013.6602295","DOIUrl":null,"url":null,"abstract":"Packet scheduling for WDM optical switching systems requires exceedingly low latency processing, making it impractical to be realized by non-parallel based algorithms. In this paper, we propose a new recurrent discrete-time synchronous ranked neural-network (DSRN) for parallel prioritized scheduling. The DSRN is structured with ranked neurons and is capable of operating in a fully parallel (i.e., synchronous) discrete-time manner, and thus can be implemented in digital systems. We then design a DSRN scheduler for a previously proposed experimental WDM optical switching system (WOPIS). For newly arriving packets, the DSRN scheduler determines in real time an optimal set of input/output paths within WOPIS, achieving maximal throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. We delineate via a theorem that DSRN will converge to the optimal solution. The theorem also provides a theoretical upper bound of the convergence latency, O(H), where H is the switch port count. Finally, we demonstrate that, via CUDA-based simulations, the DSRN scheduler achieves near-optimal throughput and prioritized scheduling, with nearly O(logH) convergence latency.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel prioritized scheduling for WDM optical switching system\",\"authors\":\"P. Tien, Bo-Yu Ke\",\"doi\":\"10.1109/HPSR.2013.6602295\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Packet scheduling for WDM optical switching systems requires exceedingly low latency processing, making it impractical to be realized by non-parallel based algorithms. In this paper, we propose a new recurrent discrete-time synchronous ranked neural-network (DSRN) for parallel prioritized scheduling. The DSRN is structured with ranked neurons and is capable of operating in a fully parallel (i.e., synchronous) discrete-time manner, and thus can be implemented in digital systems. We then design a DSRN scheduler for a previously proposed experimental WDM optical switching system (WOPIS). For newly arriving packets, the DSRN scheduler determines in real time an optimal set of input/output paths within WOPIS, achieving maximal throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. We delineate via a theorem that DSRN will converge to the optimal solution. The theorem also provides a theoretical upper bound of the convergence latency, O(H), where H is the switch port count. Finally, we demonstrate that, via CUDA-based simulations, the DSRN scheduler achieves near-optimal throughput and prioritized scheduling, with nearly O(logH) convergence latency.\",\"PeriodicalId\":220418,\"journal\":{\"name\":\"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2013.6602295\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2013.6602295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel prioritized scheduling for WDM optical switching system
Packet scheduling for WDM optical switching systems requires exceedingly low latency processing, making it impractical to be realized by non-parallel based algorithms. In this paper, we propose a new recurrent discrete-time synchronous ranked neural-network (DSRN) for parallel prioritized scheduling. The DSRN is structured with ranked neurons and is capable of operating in a fully parallel (i.e., synchronous) discrete-time manner, and thus can be implemented in digital systems. We then design a DSRN scheduler for a previously proposed experimental WDM optical switching system (WOPIS). For newly arriving packets, the DSRN scheduler determines in real time an optimal set of input/output paths within WOPIS, achieving maximal throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. We delineate via a theorem that DSRN will converge to the optimal solution. The theorem also provides a theoretical upper bound of the convergence latency, O(H), where H is the switch port count. Finally, we demonstrate that, via CUDA-based simulations, the DSRN scheduler achieves near-optimal throughput and prioritized scheduling, with nearly O(logH) convergence latency.