Browsing by Author "Ke, Bo-Yu"

Now showing 1 - 3 of 3

Parallel Prioritized Flow Scheduling for Software Defined Data Center Network
(2013)
Ke, Bo-Yu
;
Tien, Po-Lung
;
Hsiao, Yu-Lin
;
電子工程學系及電子研究所
;
Department of Electronics Engineering and Institute of Electronics
Prioritized flow scheduling is essential for providing QoS differentiation and energy saving in data center network. While dynamically manipulating the routing paths of incoming flows becomes practical via enabling technology of software-defined network (SDN), scheduling a large amount of flows in real time remains challenging. In this paper, we propose an Iterative Parallel Grouping Algorithm (IPGA) to the prioritized flow-scheduling problem. Thanks to the inherent nature of parallelism, the IPGA-based flow scheduler not only performs fast scheduling but also can be efficiently realized by a CUD A system within the SDN controller. Via simulations, we demonstrate that the IPGA scheduler achieves QoS differentiation and promising energy saving for a Fat-tree-based network.
Parallel Prioritized Scheduling for WDM Optical Switching System
(2013)
Tien, Po-Lung
;
Ke, Bo-Yu
;
電子工程學系及電子研究所
;
Department of Electronics Engineering and Institute of Electronics
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.
Parallel QoS Scheduling for WDM Optical Interconnection System Using a New Ranked Hopfield Neural Network
(2011-08-15)
Tien, Po-Lung
;
Ke, Bo-Yu
;
電機工程學系
;
Department of Electrical and Computer Engineering
In this paper, we propose a parallel QoS scheduler for a WDM optical interconnection system (WOPIS), using a new ranked Hopfield neural-network (RHNN). The WOPIS contains 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. Structured with ranked neurons, the RHNN allows higher-rank neurons (higher-priority and/or lower-delay paths) to disable lower-rank neurons that have been enabled during previous iterations. Ranking the neurons unfortunately gives rise to a convergence problem. We present two theorems that give the sufficient conditions for the RHNN scheduler to converge to the optimal solution. We demonstrate via simulation results that, with the computation time within one system slot time, the RHNN scheduler achieves near 100% throughput and multi-level prioritized scheduling.