Deadline-aware rate allocation for IoT services in data center network

被引:9
作者
Shen, Bo [1 ,2 ]
Chilamkurti, Naveen [3 ]
Wang, Ru [4 ]
Zhou, Xingshe [2 ]
Wang, Shiwei [5 ]
Ji, Wen [6 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Northwestern Polytech Univ, Sch Comp Sci & Engn, Xian, Shaanxi, Peoples R China
[3] La Trobe Univ, Dept Comp Sci & Comp Engn, Melbourne, Vic, Australia
[4] Northwest A&F Univ, Coll Informat Engn, Yangling, Shaanxi, Peoples R China
[5] Weihai Yuanhang Technol Dev Co Ltd, Weihai, Peoples R China
[6] Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Data center network; Big data; Online service; Internet of things; Incast congestion; GAME; INCAST; TCP; INTERNET; THINGS; MAC;
D O I
10.1016/j.jpdc.2017.09.012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Data center is the key infrastructure for a plenty of applications involving a high volume of data in Internet of Things (IoT). The Data Center Network (DCN) connecting multiple servers plays a vital role. Its mechanism for managing the traffic has a significant impact on the performance of IoT services. To guarantee the real-time performance of IoT services is one of the major challenges. In the paper Deadline-aware Rate Allocation (DRA) algorithm for scheduling the heterogeneous flows in DCNs is proposed. A non-cooperative game-theoretic framework is introduced to model the interactions in the scenario. The core idea of DRA is to assign the traffic with deadline constraints a higher priority. The worker with a lower served rate in the past period is assigned a higher priority. Meanwhile, DRA is a kind of preemptive algorithm. Simulation results have shown that under the mechanism flows wait shorter time and the real-time performance is guaranteed. DRA also achieves good fairness among different IoT services. © 2017 Elsevier Inc.
引用
收藏
页码:296 / 306
页数:11
相关论文
共 48 条
[21]  
Greenberg A, 2009, SIGCOMM 2009, P51
[22]   Internet of Things (IoT): A vision, architectural elements, and future directions [J].
Gubbi, Jayavardhana ;
Buyya, Rajkumar ;
Marusic, Slaven ;
Palaniswami, Marimuthu .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (07) :1645-1660
[23]   Fair Network Bandwidth Allocation in IaaS Datacenters via a Cooperative Game Approach [J].
Guo, Jian ;
Liu, Fangming ;
Lui, John C. S. ;
Jin, Hai .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (02) :873-886
[24]  
Hayes B, 2008, COMMUN ACM, V51, P9, DOI [10.1145/1364782.1364786, 10.1145/1364782.1364789]
[25]   Finishing Flows Quickly with Preemptive Scheduling [J].
Hong, Chi-Yao ;
Caesar, Matthew ;
Godfrey, P. Brighten .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) :127-138
[26]   Deadline and Incast Aware TCP for cloud data center networks [J].
Hwang, Jaehyun ;
Yoo, Joon ;
Choi, Nakjung .
COMPUTER NETWORKS, 2014, 68 :20-34
[27]  
Jain R., 1984, DEC TECHNICAL REPORT
[28]   Profit Maximization through Online Advertising Scheduling for a Wireless Video Broadcast Network [J].
Ji, Wen ;
Chen, Yingying ;
Chen, Min ;
Chen, Bo-Wei ;
Chen, Yiqiang ;
Kung, Sun-Yuan .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2016, 15 (08) :2064-2079
[29]   Profit Optimization for Wireless Video Broadcasting Systems Based on Polymatroidal Analysis [J].
Ji, Wen ;
Frossard, Pascal ;
Chen, Bo-Wei ;
Chen, Yiqiang .
IEEE TRANSACTIONS ON MULTIMEDIA, 2015, 17 (12) :2310-2327
[30]   Profit Improvement in Wireless Video Broadcasting System: A Marginal Principle Approach [J].
Ji, Wen ;
Chen, Bo-Wei ;
Chen, Yiqiang ;
Kung, Sun-Yuan .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2015, 14 (08) :1659-1671