Parallel prioritized flow scheduling for software defined data center network

Bo Yu Ke, Po-Lung Tien, Yu Lin Hsiao

Research output: Contribution to journalConference articlepeer-review

8 Scopus citations

Abstract

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 CUDA 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.

Original languageEnglish
Article number6602317
Pages (from-to)217-218
Number of pages2
JournalIEEE International Conference on High Performance Switching and Routing, HPSR
DOIs
StatePublished - 9 Dec 2013
Event2013 IEEE 14th International Conference on High Performance Switching and Routing, HPSR 2013 - Taipei, Taiwan
Duration: 8 Jul 201311 Jul 2013

Fingerprint Dive into the research topics of 'Parallel prioritized flow scheduling for software defined data center network'. Together they form a unique fingerprint.

Cite this