Delay-Differentiated Scheduling in Optical Packet Switches for Cloud Data Centers  

作　　者：LI Yaofang XIAO Jie WU Bin WEN Hong YU Hongfang YANG Shu XIN Shanshan GUO Jianing 

机构地区：[1]School of Computer Science and Technology, Tianjin University [2]Computing Center, Tianjin Chengjian University [3]National Key Laboratory on Communications, University of Science and Technology of China [4]School of Communication Engineering, University of Electronic Science and Technology of China

出　　处：《China Communications》2015年第8期22-32,共11页中国通信（英文版）

基　　金：supported by the Major State Basic Research Program of China (973 project No. 2013CB329301 and 2010CB327806);the Natural Science Fund of China (NSFC project No. 61372085, 61032003, 61271165 and 61202379);the Research Fund for the Doctoral Program of Higher Education of China (RFDP project No. 20120185110025, 20120185110030 and 20120032120041);supported by Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, P. R. China

摘　　要：We consider differentiated timecritical task scheduling in a N×N input queued optical packet s w itch to ens ure 100% throughput and meet different delay requirements among various modules of data center. Existing schemes either consider slot-by-slot scheduling with queue depth serving as the delay metric or assume that each input-output connection has the same delay bound in the batch scheduling mode. The former scheme neglects the effect of reconfiguration overhead, which may result in crippled system performance, while the latter cannot satisfy users' differentiated Quality of Service(Qo S) requirements. To make up these deficiencies, we propose a new batch scheduling scheme to meet the various portto-port delay requirements in a best-effort manner. Moreover, a speedup is considered to compensate for both the reconfiguration overhead and the unavoidable slots wastage in the switch fabric. With traffic matrix and delay constraint matrix given, this paper proposes two heuristic algorithms Stringent Delay First(SDF) and m-order SDF(m-SDF) to realize the 100% packet switching, while maximizing the delay constraints satisfaction ratio. The performance of our scheme is verified by extensive numerical simulations.We consider differentiated time- critical task scheduling in a N×N input queued optical packet switch to ensure 100% throughput and meet different delay requirements among various modules of data center. Existing schemes either consider slot-by-slot scheduling with queue depth serving as the delay metric or assume that each input-output connection has the same delay bound in the batch scheduling mode. The former scheme neglects the effect of reconfiguration overhead, which may result in crippled system performance, while the latter cannot satisfy users＇ differentiated Quality of Service （QoS） requirements. To make up these deficiencies, we propose a new batch scheduling scheme to meet the various port- to-port delay requirements in a best-effort manner. Moreover, a speedup is considered to compensate for both the reconfiguration overhead and the unavoidable slots wastage in the switch fabric. With traffic matrix and delay constraint matrix given, this paper proposes two heuristic algorithms Stringent Delay First （SDF） and m-order SDF（m-SDF） to realize the 100% packet switching, while maximizing the delay constraints satisfaction ratio. The performance of our scheme is verified by extensive numerical simulations.

关 键 词：delay-differentiated packetscheduling optical switch data center cloudservice 

分 类 号：TP308[自动化与计算机技术—计算机系统结构]