一种新型的基于RED的逐节拥塞控制算法

随着Internet上各种多媒体应用的迅速发展,导致网络经常发生拥塞现象,严重影响网络传输的服务质量（QoS）,现有的拥塞控制采用以TCP为核心的基于窗口技术的端到端控制,具有丢包、响应速度慢等缺陷,提出的基于RED的逐节拥塞控制算法通过对拥塞的早期检测和在相邻节点进行拥塞控制等方法,使网络能对拥塞做出快速响应,有效地克服了现有拥塞控制方法的缺陷,实验结果表明,在相同配置下,采用该拥塞控制算法的网络在吞吐率和拌动等性能上均优于端到端拥塞控制。     

TCP/IP拥塞控制方法在Linux系统环境中的应用

目前广泛应用在Internet上的拥塞控制大都采用的是TCP/IP中的基于滑动窗口技术的端到端(end-to-end)控制方法。首先对TCP R eno和TCP V egas协议的原理进行了分析,然后探讨了这些拥塞控制协议在L inux中的应用,最后在通用拥塞控制协议的基础上提出了一种算法模型。对比分析表明该算法能使网络对拥塞作出快速响应,从而有效地克服了端到端拥塞控制方法的缺陷。     

基于背景流变化特征的组播拥塞控制算法

大部分组播拥塞控制机制都是将包丢失作为网络拥塞的信号,存在丢包、响应速度慢等缺陷。为了避免这种缺陷,提出一种新的基于背景流变化特征的拥塞控制算法。该方法根据网络队列延迟的变化检测拥塞,使网络能够对拥塞作出快速反应,更有效地利用网络资源,弥补了响应速度慢的缺陷。仿真实验结果表明,在相同的配置下采用该拥塞控制算法的网络,在吞吐量、丢包率等性能上均优于未采用该算法的网络。     

一种基于方程的多媒体实时流拥塞控制机制

1 引言端到端拥塞控制机制对Internet的鲁棒性和稳定性至关重要。目前Internet上许多应用使用基于窗口的拥塞控制算法对网络拥塞进行响应和避免网络崩溃。可以说,今天Internet的成功很大程度上得益于TCP拥塞控制算法的不断改进。     

一种快速拥塞指示算法及其性能分析

目前Internet采用的是TCP基于窗口的端到端的拥塞控制机制，但是端系统对拥塞的响应速度较慢，而且路由器在指示和控制拥塞方面不提供任何显式支持，基于上述考虑，本文提出了一种基于路由器的拥塞控制算法FECN，该算法在路由器处提供对拥塞的早期检测和指示机制，使源端具备快速响应拥塞的能力，同时通过自适应调整最大丢弃概率提高对网络状况的动态适应性，仿真实验表明，与RED／ECN算法相比，该算法降低了数据包的传输延迟，有效地提高了链路利用率，克服了现有算法的缺陷．     

基于路由器技术的队列管理算法

随着网络规模的不断扩大,网络拥塞问题日益严重。拥塞将会导致吞吐量下降,实时性变差,网络性能降低等问题。本文通过分析端到端拥塞控制存在的局限性,说明基于路由器技术的队列管理算法在改善端到端拥塞控制中所发挥的重要作用,并对当前拥塞控制中基于路由器技术的队列管理算法(RED、WRED、WRR、FQ、WFQ、DRR)进行分析与总结。     

QoS模型参数与Internet网络性能研究

Internet优秀的可测量性和鲁棒性部分的源于Internet拥塞控制中端到端的本质。但是,单独的端到端的拥塞控制却无法阻止拥塞崩溃和网络应用中非响应流的不公平行为,从而在网络内部节点中产生了一种新的机制,主动队列管理(AQM)。这种包调度机制成功的使IP层参与到拥塞控制中来,通过主动早期标记"尽力传输"网络拥塞状况,改善了网络质量并使延迟和丢包率降低。     

延迟容忍网络中的拥塞避免优化算法仿真

研究延迟容忍网络中的拥塞避免优化算法.在延迟容忍网络中采用托管传输机制,造成网络资源受限性耗尽,形成网络拥塞.传统的TCP拥塞控制算法在控制端存在快速反馈节点的前提下,采用慢开始、快重传的拥塞控制策略,但是容忍网络中不存在固定的控制端,链路上下带宽不对称,很难建立准确的拥塞回执,因此造成控制效果不佳.为了避免上述缺陷,提出了一种基于网络拥塞状态参数优化的延迟容忍网络中的拥塞避免优化算法.根据TCP协议的数据反馈机制,能够估计延迟容忍网络中的带宽.根据传输数据等待时间差值,能够计算待传输数据长度.利用网络拥塞状态参数优化方法,能够实现延迟容忍网络中的拥塞避免优化.实验结果表明,利用本文算法进行延迟容忍网络拥塞避免优化,能够提高数据传输的效率.     

视频实时传输中的速率控制研究

视频在互联网上的实时传输常因其要求高带宽、低延迟而造成网络拥塞。传统TCP基于窗口的拥塞控制已经不适用于实时传输中的拥塞控制,该文讨论了基于速率的网络拥塞控制方法,它采用自适应码率和分层的视频编码技术,详细说明了基于源端和收端的各种速率控制方法。     

基于NS2的BACnet网络拥塞控制策略研究

BACnet标准没有规范具体的拥塞控制算法,并且不提供端到端的流量控制机制,常规的拥塞控制算法应用于BACnet网络并不合适.提出了一种新的BACnet网络拥塞控制策略,能够根据平均队列长度和报文的优先级计算丢弃概率,分布式地控制各个BACnet网络节点端到端的流量,通过主动拥塞控制机制达到拥塞避免和控制的目的.NS2仿真实验结果表明,该策略减少了平均服务延时,降低了报丈丢失率,提高了网络吞吐量,增强了网络可靠性,为研究基于无连接协议的控制网络拥塞控制算法提供了一种模型和方法.     

基于全局端口状态感知的拥塞控制算法CAGPS

针对传统拥塞控制算法主要依据本地信息进行拥塞判断和丢弃决策的缺陷，本文提出了基于全局端口状态感知的拥塞控制算法CAGPS，更全面地考虑远程转发引擎的拥塞状态信息和远程转发引擎各端口的拥塞信息，以期获得更加合理的流控决策，从而提高路由器的整体吞吐率。本文最后描述了CAGPS在基于网络处理器的核心路由器上的实现方法。     

太比特核心路由器及其关键技术的研究

随着Internet的应用迅猛发展,主干网络上的信息流量急剧增长,对太比特(Terabit,即10^32 bit)核心路由器有迫切的需求,研究和开发太比特核心路由器已成为热点．综述了近年来在太比特核心路由器方面研究的最新成果,介绍了太比特核心路由器的新功能,并对新一代超高速太比特核心路由器的分布式体系结构进行了分析和研究,重点讨论了可扩展的多维交换结构．文中详细叙述了太比特核心路由器的关键技术,其中包括高速背板、高密度接口、路由表查找、数据包分类、资源管理、高性能核心路由器操作系统和核心软件以及QoS保证．最后,对太比特核心路由器技术的发展趋势进行了展望．     

一种基于多阶段资源感知的拥塞控制算法

拥塞控制是组成IPQos的重要部分,传统的拥塞控制算法主要是通过对本地的资源拥塞信息来进行拥塞状态的判定和丢弃决策,而这有可能会导致带宽浪费问题。通过对基于网络处理器的路由器的多阶段拥塞控制时机分析,本文提出一个多阶段资源感知算法CC-AMR,并在路由器上进行了具体的实现和性能测试。结果表明,该算法可以在拥塞发生时有效地提高系统的性能。     

Design and evaluation of a high throughput QoS-aware and congestion-aware router architecture for Network-on-Chip

This paper proposes a novel QoS-aware and congestion-aware Network-on-Chip architecture that not only enables quality-oriented network transmission and maintains a feasible implementation cost but also well balance traffic load inside the network to enhance overall throughput. By differentiating application traffic into different service classes, bandwidth allocation is managed accordingly to fulfill QoS requirements. Incorporating with congestion control scheme which consists of dynamic arbitration and adaptive routing path selection, high priority traffic is directed to less congested areas and is given preference to available resources. Simulation results show that average latency of high priority and overall traffic is improved dramatically for various traffic patterns. Cost evaluation results also show that the proposed router architecture requires negligible cost overhead but provides better performance for both advanced mesh NoC platforms.     

FIAC: a resource discovery-based two-level admission control for differentiated service networks

Differentiated Service (DiffServ) architecture has been proposed as a scalable QoS architecture for Internet. DiffServ, however, could not control its loads under heavy traffic conditions, and it could not provide strong QoS responses for individual traffic flow. This paper introduces at the edges of a DiffServ domain, a novel two-level admission control scheme, the Fair Intelligent Admission Control (FIAC). At per-class level, FIAC admits traffic according their fairshare and usage while preventing possible congestion within the DiffServ core. At per-flow level, FIAC estimates and allocates the fairshare for each flow within a class.

Simulation results demonstrate that FIAC adheres extremely well to the bandwidth requirements of DiffServ classes while preventing congestion within the DiffServ core. With FIAC's per-flow level enabled, FIAC is able to prevent uncontrolled UDP flows from depriving TCP-controlled flows of bandwidth share when they are aggregated to the DiffServ domain.     

Threshold configuration and routing optimization for PCN-based resilient admission control

Pre-Congestion Notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high-priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures.We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.     

Transport-aware IP routers: a built-in protection mechanism to counter DDoS attacks

The lack-of service differentiation and resource isolation by current IP routers exposes their vulnerability to Distributed Denial of Service (DDoS) attacks (Garber, 2000), causing a serious threat to the availability of Internet services. Based on the concept of layer-4 service differentiation and resource isolation, where the transport-layer information is inferred from the IP headers and used for packet classification and resource management, we present a transport-aware IP (tIP) router architecture that provides fine-grained service differentiation and resource isolation among different classes of traffic aggregates. The tIP router architecture consists of a fine-grained Quality-of-Service (QoS) classifier and an adaptive weight-based resource manager. A two-stage packet-classification mechanism is devised to decouple the fine-grained QoS lookup from the usual routing lookup at core routers. The fine-grained service differentiation and resource isolation provided inside the tIP router is a powerful built-in protection mechanism to counter DDoS attacks, reducing the vulnerability of Internet to DDoS attacks. Moreover, the tIP architecture is stateless and compatible with the Differentiated Service (DiffServ) infrastructure. Thanks to its scalable QoS support for TCP control segments, the tIP router supports bidirectional differentiated services for TCP sessions.     

A differentiated services architecture for multimedia streaming in next generation Internet

This paper presents a Differentiated Services (Diffserv or DS) architecture for multimedia streaming applications. Specifically, we define two types of services in the context of Assured Forwarding (AF) per hop behavior (PHB) that are differentiated in terms of reliability of packet delivery: the High Reliable (HR) service and the Less Assured (LA) service. We propose a novel node mechanism called Selective Pushout with Random Early Detection (SPRED) that is capable of simultaneously achieving the following four objectives: (1) a core router does not maintain any state information for each flow (i.e., core-stateless); (2) the packet sequence within each flow is not re-ordered at a node; (3) packets from HR service are delivered more reliably than packets from LA service at a node during congestion; and (4) packets from TCP traffic are dropped randomly to avoid global synchronization during congestion. We show that SPRED is a generalized buffer management algorithm of both tail-dropping and Random Early Detection (RED), and combines the best features of pushout (PO), RED and RED with In/Out (RIO) mechanisms. Simulation results demonstrate that under the same link speed and network topology, network nodes employing our Diffserv architecture have substantial performance improvement over the current Best Effort (BE) Internet architecture for multimedia streaming applications.     

基于差分服务的贪婪流问题解决算法

贪婪流问题是网络拥塞控制范畴的问题，泛指不遵从标准TCP拥塞控制机制的流。贪婪流给网络带来不公平性。提出了一种新的甄别算法，通过对目标流发送窗口随分组丢弃变化关系的分析，对不合规范的流进行检测。算法采用定长列表结构，具有实现简单、扩展性强的特点，提出了一种基于差分服务模式的体系结构，对传统Internet服务哲学进行了扩展，从根本上支持新型流式应用，实现了端到端的流量监管功能。     

Queueing systems with random service rate

We consider a queue with the arrival process, the service time process and the service rate process as regenerative processes. We provide conditions for its stability, rates of convergence, finiteness of moments and functional limit theorems. This queue can model a queue serving ABR and UBR traffic in an ATM switch; a multiple access channel with TDMA or CDMA protocol and fading; a queue holding best effort or controlled and guaranteed traffic in a router in the integrated service architecture (ISA) of IP-based Internet and a scheduler in the router of a differentiated service architecture. In the process we also provide results for a queue with a leaky bucket controlled bandwidth scheduler. This result is of independent interest. We extend these results to feed-forward networks of queues. We also obtain the results when the arrival rate to the queue can be feedback controlled based on the congestion information in the queue (as in ABR service in the ATM networks or in the real time applications controlled by RTCP protocol in the Internet).