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 条
[1]   A scalable, commodity data center network architecture [J].
Al-Fares, Mohammad ;
Loukissas, Alexander ;
Vahdat, Amin .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :63-74
[2]   pFabric: Minimal Near-Optimal Datacenter Transport [J].
Alizadeh, Mohammad ;
Yang, Shuang ;
Sharif, Milad ;
Katti, Sachin ;
McKeown, Nick ;
Prabhakar, Balaji ;
Shenker, Scott .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :435-446
[3]   Data Center TCP (DCTCP) [J].
Alizadeh, Mohammad ;
Greenberg, Albert ;
Maltz, David A. ;
Padhye, Jitendra ;
Patel, Parveen ;
Prabhakar, Balaji ;
Sengupta, Sudipta ;
Sridharan, Murari .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) :63-74
[4]  
[Anonymous], 1991, Game Theory
[5]   Multi-Player Game Theoretic MAC Strategies for Energy Efficient Data Dissemination [J].
Antonopoulos, Angelos ;
Verikoukis, Christos .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (02) :592-603
[6]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[7]   Big Data computing and clouds: Trends and future directions [J].
Assuncao, Marcos D. ;
Calheiros, Rodrigo N. ;
Bianchi, Silvia ;
Netto, Marco A. S. ;
Buyya, Rajkumar .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 79-80 :3-15
[8]   The Internet of Things: A survey [J].
Atzori, Luigi ;
Iera, Antonio ;
Morabito, Giacomo .
COMPUTER NETWORKS, 2010, 54 (15) :2787-2805
[9]   Towards Predictable Datacenter Networks [J].
Ballani, Hitesh ;
Costa, Paolo ;
Karagiannis, Thomas ;
Rowstron, Ant .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (04) :242-253
[10]  
Batalla JM, 2016, MODEL OPTIM SCI TECH, V8, P25, DOI 10.1007/978-3-319-30913-2_2