为了解决延迟容忍网络中现有Drop-Front(DF)、Drop-Oldest(DO)等拥塞控制算法吞吐量较低的问题,提出了一种在传统的传染路由协议下基于复制率的拥塞控制算法.当节点接收新数据包缓存发生拥塞时,节点根据数据包的复制次数和已经过的生命周期估算各数据包的复制率,并丢弃复制率最大的数据包,从而缓解拥塞.仿真结果表明,该算法较DF和DO算法降低了网络的丢包率,提高了网络的吞吐量,有效地缓解了拥塞. In order to solve the problem of low throughput of existing congestion control algorithms such as Drop-Front (DF) and Drop-Oldest (DO) in delay-tolerant networks, a replication-based congestion control algorithm When a node receives a new packet cache congestion occurs, the node estimates the data packet replication rate and the packet with the highest replication rate according to the number of packets and the elapsed life cycle, so as to alleviate the congestion.The simulation results show that, Compared with DF and DO algorithms, this algorithm reduces the network packet loss rate, improves the network throughput and effectively reduces the congestion.