数据流的活动队列管理算法:MBLUE

MBLUE(Modified BLUE)是一种面向数据流的活动队列管理算法.它不是使用平均队列长度指示缓冲区拥塞状态,而是使用数据报丢弃的频率和队列空闲程度来管理网络拥塞.探测瓶颈连接早期的拥塞信息,通过数据报的丢弃和标记避免拥塞.它只维护一个先进先出队列,以较少的数据流状态信息,在不同流之间公平的分配网络带宽.能够适应瞬时的猝发流,能合理控制非TCP数据流,又能够保持较短的平均队列长度,从而控制、减轻网络拥塞.通过TCP/IP网络的模拟,证实算法在公平的分配网络带宽和降低数据报的丢失率上具有较好的鲁棒性.     

一种改进的RFQ网络公平拥塞控制方法

讨论了网络公平服务中的公平拥塞控制方法，针对解决这一问题的彩虹公平队列（Rainbow Fair Queuing，RFQ）法，提出了可以改进QoS的对网络速率编码的速率空间方法和一种新的网络层次丢弃算法。     

支持优先级与公平策略的队列规程

首先介绍了队列调度算法在流量控制中的关键地位,然后讨论了现有队列调度算法,如基于优先级的调度算法、轮询调度算法与公平队列调度算法,最后提出了一种新的队列规程,该队列规程融合了优先级调度算法与DRR调度算法。在网络正常情况下,不同业务流公平地共享网络带宽,在网络出现拥塞的情况下,高优先级业务流能够抢占带宽,保证其较低的丢包率,并能够实现两种调度算法的快速切换。     

一种基于速率和队列长度的主动队列管理机制

本文研究了拥塞产生的原因及其表现形式,提出了一种基于报文到达速率和队列长度的随机早丢弃算法(RQ).根据拥塞的严重程度和变化趋势将拥塞划分为六个级别,每个级别采用合适的丢弃概率,从而将队列控制在理想工作点附近.利用经典控制理论,分析了系统的稳定性,给出了参数配置的原则.最后,用NS网络仿真器对算法性能进行了验证.     

传感器网络拥塞避免与控制的模糊AQM算法

传感器网络节点通信能力有限,当数据到达速率持续超过节点转发能力时网络会发生拥塞;传感器网络是任务型网络,对不同优先级的信息具有不同的服务质量要求.针对传感器网络信息传输的上述特性,提出了一种新的拥塞避免与控制算法FAQM（Fuzzy Active Queue Management）.该算法在综合考虑数据包的随机指数标记概率和优先级权值的基础上,建立了模糊逻辑推理系统,并以数据包丢弃因子作为参量来实现数据流的智能调控.NS2仿真实验结果表明：FAQM算法能减少高优先级数据包的丢弃率和节点间链路的时延,稳定节点队列长度,在有效避免与控制拥塞网络的同时提升网络整体QoS（Quality of Service）性能.     

ATM网络中面向ABR服务的一种流量控制机制

在ATM网络有效和稳定的运行过程中,拥塞控制起着重要的作用.对此,本文提出一种方法来设计基于速率的流量控制机制以便调节ABR服务并有效地控制网络拥塞.目标是在多个竞争用户间公平分配可用链路带宽、维持瓶颈结点的队列长度在希望值.该机制基于最小节拍(DR)控制并具有非常简单的结构.仿真结果表明,该控制机制是公平的并且具有快速收敛、无振荡和高链路带宽利用率的优点.     

一种基于模糊逻辑的主动队列管理算法

主动队列管理 (ActiveQueueManagement,AQM)技术作为Internet拥塞控制的一种有效方法 ,对于提高In ternet的服务质量具有十分重要的作用 .本文根据TCP拥塞控制算法基于数据包丢失的窗口变化机制 ,设计了一种基于模糊逻辑的主动队列管理算法 .该算法依据路由器中队列长度的变化情况 ,根据一定的模糊自校正原则来调整数据包的丢弃概率 ,从而使路由器中的队列长度稳定在参考值附近 .仿真结果表明该算法不但十分有效 ,而且对不同的网络状况具有很好的适应能力 .     

主动队列管理中的智能分组丢弃新机制

主动队列管理通过网络中间节点有控制的分组丢弃实现了较低的排队延时和较高的有效吞吐量,是TCP端到端拥塞控制近来研究的一个技术热点.已有的大多数算法在判定分组丢弃时大都沿袭了RED的概率丢弃机制,具有一定计算复杂度的随机数生成过程不利于路由器性能的优化.在本文中,我们首先定义了拥塞指数这一新的测度变量来量化描述网络的拥塞状态.接着,利用模糊逻辑设计了一种新的智能分组丢弃机制,离线的合成推理使得分组丢弃的判定仅需要简单的查表操作和比较运算即可完成,为优化路由器的性能提供了便利.数字仿真的结果表明:智能分组丢弃机制的性能优于经典的RED算法,控制队列的能力强,鲁棒性好,稳定工作域大,能很好地抵抗突发性和非弹性业务的干扰,适合工作在瞬息万变的动态网络环境中.     

一种基于市场模型的网络带宽分配方法

价格手段最近被用来控制网络拥塞和管理网络资源的分配,而价格手段的一个重要特点是可以促进资源的合理分配和利用。本文提出一种基于市场模型的网络带宽分配方法,该方法根据用户的宽带需求和网络系统带宽的使用状况,计算出网络带宽的市场价格,并通过用户有的价格参数进行带宽资源的协凋与分配,分析表明,该方法可以达到优化系统效率和提高用户满意度的目标。     

一种基于模糊逻辑的主动队伍管理算法

主动队列管理（AciiveQueue Management,AQM)技术作为Internet拥塞控制的一种有效方法，对于提高Internet的服务质量具有十分重要的作用，本文根据TCP拥塞控制算法基于数据包丢失的窗口变化机制，设计了一种基于模糊逻辑的主动队伍管理算法，该算法依据路由器中队列长度的变化情况，根据一定的模糊自校正原则来调整数据包的丢弃概率，从而使路由器中的队列长度稳定在参考值附近，仿真结果表明该算法不但十分有效，而且对不同的网络状况具有很好的适应能力。     

An active queue management scheme based on a capture-recapture model

One of the challenges in the design of switches/routers is the efficient and fair use of the shared bottleneck bandwidth among different Internet flows. In particular, various active queue management (AQM) schemes have been developed to regulate transmission control protocol traffic in response to router congestion. In addition, in order to provide fair bandwidth sharing, these AQM must protect the well-behaved flows from the misbehaving flows. However, most of the existing AQM schemes cannot provide accurate fair bandwidth sharing while being scalable. The key to the scalability and fairness of the AQM schemes is the accurate estimation of certain network resources without keeping too much state information. We propose a novel technique to estimate two network resource parameters: the number of flows in the buffer and the data source rate of a flow by using a capture-recapture (CR) model. The CR model depends on simply the random capturing/recapturing of the incoming packets, and as a result, it provides a good approximation tool with low time/space complexity. These network resource parameters are then used to provide fair bandwidth sharing among the Internet flows. Our experiments and analysis will demonstrate that this new technique outperforms the existing mechanisms and closely approximates the "ideal" case, where full state information is needed.     

Implementing PacketEconomy: Distributed money‐based QoS in OMNET++

In this work we examine how quality of service (QoS) can be achieved in a real network by allowing packets to coordinate using fiat money in a market economy for router queue positions. In this context we implement and evaluate the PacketEconomy mechanism in the discrete‐event simulator OMNET++, using the standard INET library for simulating Internet Protocol version 6 networks and evaluate throughput, end‐to‐end delay, and packet drop rates. Additionally, we examine whether the flows have a game‐theoretic incentive to participate in the market economy, while covering both Transmission Control Protocol– and User Datagram Protocol–based flows in multiple different cases. The mechanism achieves QoS by allowing packets with different QoS requirements waiting to be served in router queues to mutually trade positions by exchanging money. Notably, each flow can independently and selfishly define the ask and bid prices of its packets. In this manner, packets can coordinate to be able to self‐regulate their packet‐specific access to shared network resources. The results are promising and show that the innovative PacketEconomy mechanism provides robust, effective, and fine‐grained QoS while maintaining end‐user control for both rate‐ and window‐based flows.     

Distributed control and resource marking using best-effort routers

We present a method for creating differential QoS where control is in the hands of the end system or user, and the network distributes congestion feedback information to users via packet marking at resources. Current proposals for creating differential QoS in the Internet often rely on classifying packets into a number of classes with routers treating different classes appropriately. The router plays a critical role in guaranteeing performance. In contrast, there is a growing body of work that seeks to place more of the control in the hands of the end system or user, with simple functionality in the router. This is the approach outlined in this tutorial article: using insights from economics and control theory we show how cooperation between end systems and the network can be encouraged using a simple packet marking scheme. The network distributes congestion feedback information to users via packet marking at resources, and users react accordingly to obtain differential QoS     

DRED: a random early detection algorithm for TCP/IP networks

It is now widely accepted that a RED [2] controlled queue certainly performs better than a drop‐tail queue. But an inherent weakness of RED is that its equilibrium queue length cannot be maintained at a preset value independent of the number of TCP active connections. In addition, RED's optimal parameter setting is largely correlated with the number of connections, the round‐trip time, the buffer space, etc. In light of these observations, we propose DRED, a novel algorithm which uses the basic ideas of feedback control to randomly discard packets with a load‐dependent probability when a buffer in a router gets congested. Over a wide range of load levels, DRED is able to stabilize a router queue occupancy at a level independent of the number of active TCP connections. The benefits of stabilized queues in a network are high resources utilization, predictable maximum delays, more certain buffer provisioning, and traffic‐load‐independent network performance in terms of traffic intensity and number of connections. Copyright © 2002 John Wiley & Sons, Ltd.     

Fair end‐to‐end window‐based congestion control in time‐varying data communication networks

Communication networks are time varying and, hence, fair sharing of network resources among the users in such a dynamic environment is a challenging task. In this context, a time‐varying network model is designed, and the shortest user's route is found. In the designed network model, an end‐to‐end window‐based congestion control scheme is developed with the help of internal nodes or router, and the end user can get implicit feedback (throughput). This scheme is considered as fair if the allocation of resources among users minimizes overall congestion or backlog in the networks. Window update approach is based on a multi‐class fluid model and is updated dynamically by considering delays (communication, propagation, and queuing) and the backlog of packets in the user's routes. Convergence and stability of the window size are obtained using a Lyapunov function. A comparative study with other window‐based methods is also provided.     

基于信任管理系统的可信路由器的设计与实现(英文)

This paper presents a scheme to perform QoS management and assure network security by using the trusted-router based on the Trust Management System.In this trusted-router,every IP packet is forwarded and queued by its trust value,which is the quantification of the network's expectation for this packet's and its owner's behavior in the network.We outline the algorithms to calculate the trust value of the trusted-router and the IP packet.We also introduce the trust-based QoS management algorithm and the deplo...     

网边缘可控的IP QoS体系结构及其算法

IP QoS要求是综合宽带网发展的重要瓶颈,而现有IP QoS体系不能很好地满足用户需求,因此,本研究将对IP QoS体系做一个新探索.依托当前网络环境、着眼于下一代网络发展,研究一种网边缘控制的自组织IP QoS体系结构及其算法.本体系中采用探测分组、染色分组和信息分组三类分组,并通过智能控制系统来控制三类分组的比例关系,有效地提供用户所需求的QoS. 本体系将克服现有机制的流状态保持,并通过用户的自组织行为来加强网络的自适应性与可扩展性,更好适应网络发展与应用需求.     

SR软件路由器的设计与实现

分段路由(segment routing,SR)是近几年IETF提出的一种路由机制,其目的是使IP/MPLS网络面向服务并且更高效.SR减少现有MPLS网络控制平面复杂的协议(LDP/RSVP-TE),并实现流量工程等机制.与基于RSVP的显式路径中隧道中间节点维护报文流的状态不同,基于SR的显式路径只在入口边界路由器中维护报文流的状态,从而提高了网络的可扩展性,因此SR对于下一代互联网具有重要的研究意义.对SR的实现机制进行了研究,利用软件路由平台Click,对基于PCE架构的SR控制平面子系统和基于MPLS的SR数据平面子系统的各个模块进行实现,并在实际中进行部署,以验证SR软件路由器的可行性.     

Buffer management schemes for supporting TCP in gigabit routerswith per-flow queueing

There has been much interest in using active queue management in routers in order to protect users from connections that are not very responsive to congestion notification. An Internet draft recommends schemes based on random early detection for achieving these goals, to the extent that it is possible, in a system without “per-flow” state. However, a “stateless” system with first-in/first-out (FIFO) queueing is very much handicapped in the degree to which flow isolation and fairness can be achieved. Starting with the observation that a “stateless” system is but one extreme in a spectrum of design choices and that per-flow queueing for a large number of flows is possible, we present active queue management mechanisms that are tailored to provide a high degree of isolation and fairness for TCP connections in a gigabit IP router using per-flow queueing. We show that IP flow state in a router can be bounded if the scheduling discipline used has finite memory, and we investigate the performance implications of different buffer management strategies in such a system. We show that merely using per-flow scheduling is not sufficient to achieve effective isolation and fairness, and it must be combined with appropriate buffer management strategies     

Detecting disruptive routers: a distributed network monitoringapproach

An attractive target for a computer system attacker is the router. An attacker in control of a router can disrupt communication by dropping or misrouting packets passing through the router. We present a protocol called WATCHERS which detects and reacts to routers that drop or misroute packets. WATCHERS is based on the principle of conservation of flow in a network: all data bytes sent into a node, and not destined for that node, are expected to exit the node. WATCHERS tracks this flow, and detects routers that violate the conservation principle. We show that WATCHERS has several advantages over existing network monitoring techniques. We discuss WATCHERS response to several different types of bad router behavior. We demonstrate that in ideal conditions WATCHERS makes no false positive diagnoses, and we describe how WATCHERS can be tuned to perform nearly as well in realistic conditions. Also, we argue that WATCHERS impact on router performance and WATCHERS memory requirements are reasonable for many environments