首页> 中文期刊> 《计算机技术与发展》 >基于紧迫度分组调度算法

基于紧迫度分组调度算法

         

摘要

在分布式存储系统的数据中心,数据块通常都是以条状的方式分散存储在不同的服务器中。当客户请求数据时,多个服务器将会同时响应,将分散存储在服务器中的数据传输给客户。当传输的数据量超过交换机缓冲区大小就会在数据中心网络中发生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.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号