摘要
ＴＣＰ是利用接收端返回的确认信息调整发送端数据发送的传输层协议。在非对称信道存在的网络中，当传输确认信息的信道带宽远小于传输数据的信道带宽，确认信息的传输速率小于数据包的传输速率时，ＴＣＰ数据包的传输受到确认信息返回速率的限制。如何在数据包和确认包共享同一个上行信道的情况下，能够既保证上行信道上数据包传输带宽，又不使下行信道上的数据包传输受到抑制是笔者所关心的问题。文章在上行信道采用了一种加权轮询分组调度算法对其数据包和确认包的发送进行控制来解决这一问题，并通过理论分析对该分组调度算法的性能进行分析，最后用仿真验证了对该算法的分析。
TCP is a transport layer protocol that regulate its downlink data sending through uplink ACKs. In asymmetric network where the bandwidth of reverse link is far less than forward link and the link rate of ACKs is slower than that of data, TCP data sending rate is greatly limited by the reverse link. What we concern is how to regulate data and ACKs ratio of the uplink, so that downlink and uplink can guarantee bandwidth for data packet sending at the same time. In this paper, a Weighted Round Robin Scheduler algorithm is proposed to solve this problem. It analyzes the performance of this algorithm and prove the analysis through simulation.
出处
《计算机工程与应用》
CSCD
北大核心
2000年第3期10-11,21,共3页
Computer Engineering and Applications
基金
国家自然科学基金!69896240
