TY - JOUR
T1 - Parallel prioritized scheduling for WDM optical switching system
AU - Tien, Po-Lung
AU - Ke, Bo Yu
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Quality of Service (QoS)
KW - neural networks
KW - optical interconnect
KW - optical switch
KW - parallel scheduling
UR - http://www.scopus.com/inward/record.url?scp=84889067034&partnerID=8YFLogxK
U2 - 10.1109/HPSR.2013.6602295
DO - 10.1109/HPSR.2013.6602295
M3 - Conference article
AN - SCOPUS:84889067034
SN - 2325-5595
SP - 86
EP - 91
JO - IEEE International Conference on High Performance Switching and Routing, HPSR
JF - IEEE International Conference on High Performance Switching and Routing, HPSR
M1 - 6602295
T2 - 2013 IEEE 14th International Conference on High Performance Switching and Routing, HPSR 2013
Y2 - 8 July 2013 through 11 July 2013
ER -