基于紧迫度分组调度算法  

Group Scheduling Algorithm Based on Pressing Degree

作　　者：刘桐羽 陈翰雄 陈春玲[1] 

机构地区：[1]南京邮电大学计算机学院软件学院,江苏南京210003 [2]南京邮电大学通信与信息工程学院,江苏南京210023

出　　处：《计算机技术与发展》2015年第10期97-100,106,共5页Computer Technology and Development

基　　金：国家自然科学基金资助项目(61373137);华为科研基金项目(YB2013050012)

摘　　要：在分布式存储系统的数据中心,数据块通常都是以条状的方式分散存储在不同的服务器中。当客户请求数据时,多个服务器将会同时响应,将分散存储在服务器中的数据传输给客户。当传输的数据量超过交换机缓冲区大小就会在数据中心网络中发生TCP Incast现象。为改善数据中心网络发生TCP Incast吞吐量崩溃问题,提出基于紧迫度分组调度算法。通过在传输过程中将并发传输的数据流分组,并且按照紧迫度顺序对其传输,将并发传输数据进行分组调度传输,实现并发数据的串行传输。仿真实验表明,该算法大大降低了TCP Incast发生率,在服务器数量增加的情况下依然可以保证吞吐量没有出现大幅下降现象。基于紧迫度分组调度算法在大多数用例中可以避免Incast问题,并且提升网络传输性能。In a data center of distributed storage system, the data blocks are usually stored in stripe as SRUs in these different servers. When multiple data senders simultaneously communicate with a single receiver, namely in many-to-one communication pattern, the burst data overloads the receiver＇ s switch buffers, which leads to TCP throughput collapse, that＇ s so-called TCP Incast problem. In order to improve the throughput collapse problem caused by TCP Incast in the data center networks ,propose the algorithm Based on Pressing de- gree Group Scheduling （BPGS）. Transfer the flows by grouping the flows and ordering them by the pressing degree. Simulation results show that the algorithm reduces the incidence of TCP Incast greatly, even when the number of servers increase, this algorithm can also en- sure the throughout. BPGS can avoid the TCP Incast in most cases, what is more,it can also improve the network transmission perform- ance.

关 键 词：数据中心网络 Incast TCP 交错流 基于紧迫度分组调度算法 

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