共查询到18条相似文献,搜索用时 125 毫秒
1.
针对现有TCP类组播拥塞控制机制不具有速率平滑性、往返时间(RTT)公平性以及在高速环境中传输效率低的问题,提出一种基于种群生态理论的自适应高速组播拥塞控制机制。该机制在每个接收端实现瓶颈链路带宽和背景流速率的测量,并将这两个测量值用于种群生态模型中以计算期望服务速率,然后使用一种简单的反馈抑制机制选取期望服务速率最小的接收端作为代表,该代表将其期望服务速率反馈给源端控制发送速率。仿真结果表明新机制发送速率平滑,具有RTT公平性,在低速网络和高速网络中都能与单播流公平共享带宽资源。 相似文献
2.
传统TCP协议在现代高速网络中的数据传输变的低效,具有不同往返时延的TCP数据流在竞争瓶颈带宽时将引发带宽不公平分配问题。基于UDP的可靠数据传输协议(UDP-based Data Transfer Protocol,UDT)是在UDP之上增加了可靠性和拥塞控制机制,适合于高速网络下的大量数据传输,具有很高的公平性。通过NS2仿真平台,改变瓶颈带宽、时延等形成不同的网络环境,在效率、公平、稳定等UDT目标性能上同传统TCP进行比较研究,结果显示UDT在高速网络环境下具有比传统TCP更优的传输性能。 相似文献
3.
CSFQ算法分析与改进 总被引:2,自引:0,他引:2
核心无状态公平队列调度(CSVQ)算法提供了如同有状态网那样好的公平带宽分配,但它的丢包算法不适用于TCP流。针对TCP流的特点,对CSFQ算法进行如下改进:将缓存队列长度与丢包概率关联起来,用一种类似于RED(random early drop)缓存管理方法解决了缓存频繁溢出导致的一些问题;对TCP流的丢包率进行修正,使用多余带宽来转发TCP包,解决TCP流与UDP流的带宽分配公平性。仿真试验表明,新算法NEW-CSFQ更好地提供数据流公平的频宽共享,对突发流响应较原算法有所提高,且算法复杂度简单,容易在高速核心路由器上实现。 相似文献
4.
基于UDP的可靠数据传输协议仿真研究 总被引:1,自引:0,他引:1
传统TCP协议在现代高速网络中的数据传输变的低效,具有不同往返时延的TCP数据流在竞争瓶颈带宽时将引发带宽不公平分配问题.基于UDP的可靠数据传输协议(UDP-based Data Transfer Protocol, UDT)是在UDP之上增加了可靠性和拥塞控制机制,适合于高速网络下的大量数据传输,具有很高的公平性.通过NS2仿真平台,改变瓶颈带宽、时延等形成不同的网络环境,在效率、公平、稳定等UDT目标性能上同传统TCP进行比较研究,结果显示UDT在高速网络环境下具有比传统TCP更优的传输性能. 相似文献
5.
6.
随着网络应用的增长和性能的提高,传统TCP协议开始显现对高速网络的不适应性,因此急需对其进行改进。作者首先简单介绍了高速TCP算法产生的背景和几种有代表性的算法,然后具体分析其中MIMD算法与传统TCP之间的影响。分析结果表明,在按比例丢包的链路中,MIMD流和传统TCP流占有的带宽将会保持一定比例,并且能各自维持平衡。但是当链路出现大量同时丢包时,MIMD流将显现极强的资源掠夺性。 相似文献
7.
TCP/IP协议的成熟极大地促进了地面网络的发展,然而传统TCP/IP协议难以直接高效地应用于卫星网络.文中针对卫星网络固有的大带宽时延积、高误码率等特点以及卫星网络中UDP流的资源争用问题,深入对比分析了传统TCP协议在卫星网络中的缺点,并针对多媒体数据流引入TFRC机制,从而实现卫星网络TCP流量和UDP流量竞争情况下带宽的公平分配.实验表明:TFRC机制的引入可以有效解决流量带宽竞争问题,较好地实现卫星网络带宽的公平性. 相似文献
8.
9.
10.
11.
An ECN-based implementing bandwidth-sharing algorithm for unicast and multicast flows is presented.The algorithm uses a bandwidth allocation strategy to give an incentive to multicast flows in bandwidth allocation according to algorithm of the number of receivers, and to assure the unicast flows get their bandwidth shares fairly.Provided best-effort networks, an ECN-based congestion control algorithm is used to implement differentiated service in bandwidth allocation between unicast flows and multicast flows. In implementation, we solve the problems such asreceiver‘s number estimation, the RTT estimation and compromise between convergence and stability.The simulation results show that the algorithm can implement bandwidth sharing for TCP flows and multicast flows. Atthe same time, the algorithm not only allocates more bandwidth to multicast flows, but promises TCP flows to get their fair bandwidth share. 相似文献
12.
Recent congestion control protocols such as XCP and RCP achieve fair bandwidth sharing, high utilization, small queue sizes and nearly zero packet loss by implementing an explicit bandwidth share mechanism in the network routers. This paper develops new quantitative techniques for achieving the same results using only end-host measures. We develop new methods of computing bottleneck link characteristics, a new technique for sharing bandwidth fairly with Reno flows, and a new approach for rapidly converging to bandwidth share. A new transport protocol, TCP-Madison, that employs the new bandwidth sharing techniques is also defined in the paper. Experiments comparing TCP-Madison with FAST TCP, BIC-TCP and TCP-Reno over hundreds of PlanetLab and other live Internet paths show that the new protocol achieves the stated bandwidth sharing properties, is easily configured for near-optimal performance over all paths, and significantly outperforms the previous protocols. 相似文献
13.
14.
The fairness (or TCP-friendliness) of recent high-speed TCP proposals for high bandwidth-delay product networks is generally poor. We believe that the lack of TCP-friendliness of high-speed TCP proposals stems from their ineffectiveness in detecting competing TCP flows. We suggest a competition detection mechanism for a single TCP flow to detect the presence of competing TCP flows. We propose a new TCP, called Adaptive TCP (A-TCP) to demonstrate the usefulness of the competition detection mechanism. A-TCP uses the competition detection mechanism to control its aggressiveness: If it does not detect competing flows, a single A-TCP flow increases its sending rate aggressively in order to highly utilize the network. Otherwise, it behaves like a standard TCP flow to fairly share network resources with competing flows. We implemented A-TCP as part of Linux as well as in ns-2. Experimental results show that A-TCP achieves better fairness than existing high-speed TCP proposals when they compete against standard TCP in simple topology networks. 相似文献
15.
《Computer Networks》2008,52(12):2395-2410
The majority of current Internet applications uses Transmission Control Protocol (TCP) for ensuring reliable end-to-end delivery of data over IP networks. The resulting path is, generally speaking, characterized by fairly large propagation delays (of the order of tens to hundreds of milliseconds) and increasing available bandwidth. Current TCP1performance is far from representing an optimal solution in such operating conditions. The main reason lies in the conservative congestion control strategy employed, which does not let TCP to exploit the always increasing available path capacity. As a consequence, TCP optimization has been an active research topic in the research community over the last 25 years, boosted in the last few years by the widespread adoption of high-speed optical fiber links in the backbone and the emergence of supercomputing networked applications from one side and tremendous growth of wireless bandwidth in network access from another. This has led to the introduction of several alternative proposals for performing congestion control. Most of them focus on the effectiveness of bandwidth utilization, introducing more “aggressive” congestion control strategies. However, such approaches result often in unfairness among flows with substantially different RTTs, or do not present the inter-protocol fairness features required for incremental network deployment.In this paper, we propose TCP LogWestwood+, a TCP Westwood+ enhancement based on a logarithmic increase function, targeting adaptation to the high-speed wireless environment. The algorithm shows low sensitivity with respect to RTT value, while maintaining high network utilization in a wide range of network settings. The performance, fairness and stability properties of the proposed TCP LogWestwood+ are studied analytically, and then validated by means of an extensive set of experiments including computer simulations and wide area Internet measurements. 相似文献
16.
LI Yongli LIU Guizhong ZHANG Zhongwei & WU Chenggui . Department of Electronic Information Engineering Xi’an Jiaotong University Xi’an China . Beijing ZhongChuang Telecom Test Co. Ltd Beijing China Correspondence should be addressed to Li Yongli 《中国科学F辑(英文版)》2005,48(3):273-284
1 Introduction In the current Internet, not all applications use TCP and they do not follow the same concept of fairly sharing the available bandwidth. The rapid growing of real-time streaming media applications will bring much UDP traffic without integrating TCP compatible congestion control mechanism into Internet. It threats the quality of service (QoS) of real-time applications and the stability of the current Internet. For this reason, it is desirable to define appropriate rate rule… 相似文献
17.
Wen Shushan Fang Yuguang Sun Hairong 《Parallel and Distributed Systems, IEEE Transactions on》2009,20(1):34-47
Differentiated Services (DiffServ) networks categorize routers into edge routers and core routers. In core routers, one of the technological challenges is how to implement differentiated bandwidth allocation and TCP protection together with low complexity. We present an Active Queue Management (AQM) scheme called CHOKeW. A method is borrowed from a previous scheme, CHOKe, which draws a packet at random from the buffer, compares it with the arriving packet, and drops both if they are from the same flow. CHOKeW enhances the drawing function by adjusting the maximum number of draws based on the priority of the new arrival and the current status of network congestion. With respect to the number of flows, both the memory-requirement complexity and the per-packet-processing complexity for CHOKeW is O(1). An analytical model and multiple simulations are used to explain and evaluate CHOKeW. We show that CHOKeW is able to 1) support differentiated bandwidth allocation; 2) provide the flows in the same priority with better fairness than other conventional stateless AQM schemes such as RED and BLUE; 3) maintain high link utilization as well as short queue length; and 4) protect TCP flows by restricting the bandwidth share of high-speed unresponsive flows. 相似文献
18.
Internet业务流由大量相互竞争的数据流构成。为了保障各种网络业务所需的服务质量,需要在这些数据流之间进行近似公平的带宽分配。文章提出了采用多令牌桶进行带宽分配的机制,提供了一定的流间隔离与保护。仿真实验表明,该算法在保护网关的缓冲区和控制带宽的公平分配方面是有效的。 相似文献