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 条
[31]   Joint Source-Channel Coding and Optimization for Layered Video Broadcasting to Heterogeneous Devices [J].
Ji, Wen ;
Li, Zhu ;
Chen, Yiqiang .
IEEE TRANSACTIONS ON MULTIMEDIA, 2012, 14 (02) :443-455
[32]   Trends in big data analytics [J].
Kambatla, Karthik ;
Kollias, Giorgos ;
Kumar, Vipin ;
Grama, Ananth .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (07) :2561-2573
[33]  
Kandula S, 2009, IMC'09: PROCEEDINGS OF THE 2009 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P202
[34]   A Stackelberg game to derive the limits of energy savings for the allocation of data center resources [J].
Leon, Xavier ;
Navarro, Leandro .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (01) :74-83
[35]   Minimizing Flow Completion Times in Data Centers [J].
Munir, Ali ;
Qazi, Ihsan A. ;
Uzmi, Zartash A. ;
Mushtaq, Aisha ;
Ismail, Saad N. ;
Iqbal, M. Safdar ;
Khan, Basma .
2013 PROCEEDINGS IEEE INFOCOM, 2013, :2157-2165
[36]   Efficient power control via pricing in wireless data networks [J].
Saraydar, CU ;
Mandayam, NB ;
Goodman, DJ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (02) :291-303
[37]   A delay-aware schedule method for distributed information fusion with elastic and inelastic traffic [J].
Shen, Bo ;
Rho, Seungmin ;
Zhou, Xingshe ;
Wang, Ru .
INFORMATION FUSION, 2017, 36 :68-79
[38]   Mixed scheduling with heterogeneous delay constraints in cyber-physical systems [J].
Shen, Bo ;
Zhou, Xingshe ;
Kim, Mucheol .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 61 :108-117
[39]   Deadline-Aware Datacenter TCP (D2TCP) [J].
Vamanan, Balajee ;
Hasan, Jahangir ;
Vijaykumar, T. N. .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) :115-126
[40]   Throughput-oriented MAC for mobile ad hoc networks: A game-theoretic approach [J].
Wang, Fan ;
Younis, Ossama ;
Krunz, Marwan .
AD HOC NETWORKS, 2009, 7 (01) :98-117