共查询到19条相似文献,搜索用时 93 毫秒
1.
2.
DiffServ中一种公平的汇聚流标记算法 总被引:1,自引:0,他引:1
DiffServ被认为是目前比较有发展前景的一种服务模型,但经研究发现。在DiffServ网络中存在一些对带宽利用的不公平性。该文提出了一种基于TSW的三色标记算法,即公平数据包标记算法(FAMA),它能以一种近似按比例的方式在各个汇聚流之间公平地分配网络中的剩余带宽,并用仿真试验对该算法进行了验证。 相似文献
3.
区分服务网络中带宽利用的公平性 总被引:7,自引:0,他引:7
为了解决DiffServ网络中带宽利用的不公平性 ,该文提出了一种自适应的数据包标记算法AFM(AdaptiveFairMarker) .与现有的标记算法相比 ,它有两个显著的不同 :( 1)增加了一种带宽估计机制 ,对网络中可使用的带宽进行动态估计 ,并将所估计的带宽以按比例的方式公平地分配给各个汇聚流 ;( 2 )对TCP协议作了一个微小而又非常有效的改进 ,在控制TCP拥塞窗口的同时尽量避免TCP协议的AIMD机制 .该文通过仿真试验对算法进行了验证 ,结果证实AFM算法比其它几种算法具有更好的公平性 相似文献
4.
CSFQ算法分析与改进 总被引:2,自引:0,他引:2
核心无状态公平队列调度(CSVQ)算法提供了如同有状态网那样好的公平带宽分配,但它的丢包算法不适用于TCP流。针对TCP流的特点,对CSFQ算法进行如下改进:将缓存队列长度与丢包概率关联起来,用一种类似于RED(random early drop)缓存管理方法解决了缓存频繁溢出导致的一些问题;对TCP流的丢包率进行修正,使用多余带宽来转发TCP包,解决TCP流与UDP流的带宽分配公平性。仿真试验表明,新算法NEW-CSFQ更好地提供数据流公平的频宽共享,对突发流响应较原算法有所提高,且算法复杂度简单,容易在高速核心路由器上实现。 相似文献
5.
区分服务是目前在IP网络服务质量控制方面被广泛采用的一种体系结构,它在网络边界对用户数据流聚集进行分类、测量、标记和整型,在网络核心转发,实现PHB,从而达到对不同类型的业务进行区别对待的目的.本文通过对UDP和TCP混合聚集流的行为特性分析,指出将UDP和TCP业务进行分离的必要性.通过对TCP聚集流的仿真实验和分析,阐述了TCP聚集流和单个TCP的行为差异、聚集流中具有不同RTT的TCP流的速率差别,以及聚集流中的流的数目和链路带宽对链路利用率的影响.最后通过对TSW2cm标记算法的仿真实验,分析了该算法在公平性方面的弱点,提出了一种基于TCP流状态信息的聚集流标记算法f-TSW2cm,并对算法进行了对比实验和结果分析. 相似文献
6.
7.
为更好利用有限的网络带宽资源,提高带宽利用率,提出一种利用往返时延梯度精确感知带宽变化的多路径拥塞控制算法。根据往返时延的大小反馈网络拥塞程度,将拥塞程度量化为时延梯度作为拥塞窗口的控制参数;为保证链路公平,利用往返时延估计链路带宽,经迭代分配带宽,给出公平的资源分配方法。在NS-3上进行仿真,其结果表明,多路径流的吞吐量较单路径流明显提高,保证了链路分配的公平,动态环境下的响应时间较同类算法有所减小。该算法进一步提高了网络带宽的利用率。 相似文献
8.
9.
10.
区分服务中一种公平的汇聚流标记算法 总被引:2,自引:0,他引:2
区分服务是提供QoS的重要机制之一,但在区分服务中存在着汇聚流之间剩余带宽分配的不公平性问题。为解决该问题,提出了动态数据包标记算法(DPMA),该算法通过监测汇聚流的流速变化,能动态地调整标记策略,它能以一种近似按比例的方式在各汇聚流之间公平地分配网络中的剩余带宽。仿真结果表明该算法是有效的。 相似文献
11.
12.
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. 相似文献
13.
14.
15.
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. 相似文献
16.
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up within this architecture has not been well established. In this paper we explore the possibility of a scalable QoS flow set-up using a sink-tree paradigm. The paradigm initially constructs a sink tree at each egress edge router using network topology and bandwidth information provided by a QoS extended version of Open Shortest Path First (OSPF), which is a widely used link-state routing protocol. Our sink-tree paradigm dynamically reallocates network bandwidths online according to traffic demands. As a consequence, our paradigm easily supports QoS routing, resource allocation, and admission control at ingress edge routers without consulting core routers in a way that the QoS flow set-up time and overhead are minimized. Simulation results are very encouraging in that the proposed methodology requires significantly less communication overhead in setting up QoS flows compared to the traditional per-flow signaling-based methodology while still maintaining high resource utilization. 相似文献
17.
确保转发过程中带宽享用的公平性问题一直是区分服务网络研究的热点,影响这种公平性的因素包括回路响应时间RTT、数据包大小、目标速率及聚流中包含的单流数量等.确保服务的实现依赖于在边界路由器执行的数据包标记策略和在核心路由器执行的队列管理策略,基于动态阈值的数据包标记策略DTBM的目的就是处理异质的TCP流之间带宽享用的公平性问题。DTBM通过测量局部吞吐量来调整标记算法中的阈值,以改变不同颜色的标记概率从而达到公平带宽享用的目的。DTBM的主要优点在于其实现简单、对参数不是很敏感并且对端结点主机是“透明”的,仿真实验表明,和其他几种标记算法相比,DTBM能有效地消除上述因素的影响,具有更好的公平性。 相似文献
18.
We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived flows known as elephants are present. 相似文献
19.
Let a flow be a sequence of packets that are sent from a source computer to a destination computer. In this paper, we consider the fair allocation of bandwidth to each flow in a computer network. We focus on max-min fairness, which assigns to each flow the largest possible bandwidth that avoids affecting other flows. What distinguishes our approach is that routers only maintain a constant amount of state, i.e., no per-flow state is maintained. This is consistent with trends in the Internet (such as the proposed Differentiated Services Internet architecture). In addition, to provide a high degree of fault-tolerance, we ensure our approach is self-stabilizing, that is, it returns to a normal operating state after a finite sequence of faults. 相似文献