检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武汉大学计算机学院软件工程国家重点实验室,武汉430072 [2]武汉科技大学计算机科学与技术学院,武汉430081
出 处:《计算机研究与发展》2005年第12期2070-2076,共7页Journal of Computer Research and Development
基 金:国家自然科学基金项目(90104005);湖北省自然科学基金重点项目(2003ABA047)~~
摘 要:目前,TCP拥塞控制算法作为一种可靠的数据传输被广泛应用在因特网中·在保证网络数据传输可靠性的基础上,数据流之间的公平性是算法设计的重要的性能指标之一·在单瓶颈网络环境下对TCP数据流之间的研究算法已经被提出,但对多瓶颈网络环境下TCP数据流之间的公平性研究至今不多见·因此,根据网络层的显示拥塞指示Marking Relay ECN(explicit congestion notification,ECN)技术,研究了在多瓶颈网络环境下TCP数据流的公平性,提出了一种改进的TCP拥塞控制算法,并使该算法在IP网络中得以实现·仿真结果证明,此算法在多瓶颈网络环境下能使TCP流达到较好的数据流之间的公平性;而且所提出的算法与传统的TCP算法相比,有更高的吞吐量和更快的响应·总之,所提算法性能表现良好·At present, TCP congestion control algorithm is widely applied to the Internet as a reliable data transmission protocol. When the credibility of data transmission is guaranteed, fairness among different TCP traffic flows is an important performance index of the network. Nowadays, the fairness algorithm among TCP flows has been proposed in a single bottleneck network, but few people have focused on the fairness among TCP flows in a multiple bottleneck link so far. Therefore, in this paper an enhanced TCP congestion control algorithm in multiple bottleneck networks is proposed and is realized in IP network in support of ECN mechanism in network layer. The simulation results demonstrate that remarkable fairness among TCP data flows in the multiple bottleneck networks can be achieved with the application of this algorithm. Furthermore, the supposed algorithm has higher throughput and faster response than the current TCP algorithm used. Therefore, the performance of this algorithm is better in multiple bottleneck networks than that of the current TCP algorithm used.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.226.214.156