无线城域网中MPEG视频传输的上行调度算法

针对现有无线城域网中MPEG视频传输的实时轮询服务算法的不足，提出了一种更为有效的媒体接入控制上行调度算法。该算法无需基站周期地提供带宽请求机会，而是在视频应用的连接建立以后，主动周期地分配固定带宽来传输视频数据的特定部分，剩余部分的带宽通过携带请求的方式获得，以此保证更好的服务质量。仿真中使用典型的视频测试源，结果表明，新算法在近似现有算法的信道利用率的情况下，具有更小的视频帧延迟和抖动。     

混合任务系统的服务质量保障调度算法

开放式系统中存在大量的客户/服务软件架构,其中大量的混合客户任务（实时任务,非实时任务）请求与作为服务端的任务进行处理交互。传统的非实时调度算法用于服务任务处理请求时不能保障客户任务的服务质量。通过改进GRUB算法（剩余带宽贪婪回收算法）,提出了一种优化的混合任务系统的服务质量保障调度算法,保证客户任务的实时性和系统吞吐率。仿真实验验证了该算法对客户任务的服务质量保障作用。     

网络QoS的分组调度算法仿真研究

随着Internet的不断发展,实时数据的应用对网络提出了更高的服务质量控制要求,分组调度是实现网络服务质量控制的核心技术之一.分组调度按照一定的规则决定队列中分组的发送次序并分配共享链路带宽.文中介绍了一种先进的分组调度和资源管理模型:链路共享模型, 以及两种不同的实现算法:CBQ和HPFQ,分析了它们用于传输实时流的可行性.HPFQ算法为实时数据提供了严格的时延保证和完全意义上的等级链路共享服务.文中使用网络仿真工具NS2,对链路共享模型下实时流传输的服务质量性能进行了仿真分析.     

现场级硬实时网络在线调度

通过对主要周期和非周期硬实时调度算法的深入研究，提出了一种可用于调度链路数据包的在线硬实时调度系统(ARTCS)。该调度器基于单调比率调度算法：RM、风车调度算法Sr和轮询服务器调度算法，能快速判定可调度性，进而自动生成总线表，使调度算法将数据包作为周期数据包进行调度。ARTCS简单、易用，有效地利用了总线带宽。顺序执行总线表，不仅能保证硬实时的性能，而且避免了消息传输中的中断和阻塞，因而较好地满足了现场总线领域中硬实时通信系统的要求。     

基于链路共享的分组调度算法研究及仿真

分组调度管理网络链路带宽,是实现网络服务质量的核心技术之一。介绍了一种先进的分组调度和资源管理模型———链路共享模型;说明了CBQ和H-WF2Q 两种不同的实现算法;分析了它们用于传输实时流的可行性。使用网络仿真工具NS2,对实时流传输的服务质量保证进行了仿真分析。仿真结果表明:该链路共享模型可以为不同的组织、不同的通信类型提供特定的服务质量保证,大大地提高了网络带宽的利用率。     

一种针对混合的实时/非实时业务的无线调度算法

提出一种针对混合的实时/非实时业务的无线调度算法TF-RNS。该算法的目标是在实时和非实时用户提供公平服务时间的基础上,提高用户的服务质量。由于实时和非实时用户具有不同的服务质量要求,TF-RNS采用独立、分级的调度结构：在第一级调度过程中,分别使用M-LWDF和PF算法对实时和非实时用户进行独立的调度判决;而在第二级调度过程中,使用SFQ-CS公平调度算法保证调度的公平性,同时兼顾了用户的信道条件。仿真结果表明,与现有的M-LWDF和DS-PF算法相比,TF-RNS算法能够使实时和非实时用户获得公平的服务时间,从而有效地保证了系统中所有用户的服务质量。     

基于MPLmS的反馈式轮转调度算法

为进一步提高实时话音和视频数据业务传输的服务质量,结合多协议波长标签交换网络的基本原理,通过对标签分配策略进行分析,提出一种改进的反馈式轮转调度算法,在优先为高优先级分组进行调度的同时,可以防止低优先级的分组因长期得不到调度而超时被丢弃。实验结果证明,该算法能够合理分配链路带宽,保证良好的时延性能。     

三类主要网络业务并存的改进EDF算法

随着计算机网络和通信技术的发展,在许多网络环境中,除了要上网实现Internet服务外,可能还包括一定数量的实时要求和带宽保证用户,这主要涉及三类主要网络业务：尽力服务、实时和带宽保证业务。如何同时实现多类业务的分组调度来达到QoS控制成为一个值得研究的课题。以最早时限优先（EDF）算法为依据,针对现阶段网络用户的需求,提出了一种基于三类主要网络业务并存的改进EDF调度算法。在这种算法中,提出了基于时间粒度的带宽保证策略,依据三种不同模型对业务流进行调度,并且在SIM网络仿真环境下进行了实验。结果表明改进的调度算法在一定程度上降低了业务流的时延,提高了带宽保证率,总体上来说改善了网络QoS性能。     

以太网无源光网络中的QoS研究

在分析以太网无源光网络系统MAC协议的基础上,研究基于QoS的动态带宽分配机制,提出一种新的支持业务的QoS的动态带宽分配算法。该算法采用限制性带宽分配方法和基于优先级的调度方式,基于业务的通信量特征对各类业务预分配传输带宽。仿真结果表明该算法在时延和吞吐量性能上优于现有算法。     

一种提供延迟保证的多级FIFS队列包调度算法

包调度算法是提供服务质量保证的一个重要部分.传统的每流区分的包调度方法通常不能支持较好的扩展性,不适应当前网络带宽的迅速增长.而非每流区分的方法又不能提供每流的服务保证.动态包状态(dynamic packet state,简称DPS)方法提供了一种在无须维护每流状态下提供保证服务的方法,该方法在保证服务质量的同时大大提高了扩展性.但是它仍然需要每包的调度,其复杂度和包的数量有关.在DPS的基础上提出了一种用多级FIFS队列提供延迟保证的包调度算法,并给出了该算法实现服务保证的约束条件.理论分析和仿真实验结果都表明:该算法可以实现常数时间的包调度复杂性,同时具有和DPS同样的延迟性能.     

Design and simulation of an efficient real-time traffic schedulerwith jitter and delay guarantees

In this paper, we propose a framework for real-time multimedia transmission in asynchronous transfer mode (ATM) networks using an efficient traffic scheduling scheme called multilayer gated frame queueing (MGFQ). MGFQ employs only one set of FIFO queues to provide a wide range of QoS for real-time applications. We also propose special cell formats for real-time multimedia transport and a hybrid design to allow MGFQ to combine its scheduling scheme with Age Priority Packet Discarding scheme. For this hybrid design, the cell level performance as well as the packet level QoS can be improved at the same time, Simulation results show that this hybrid design will be useful for packetized voice and progressive layer-compressed video transmission across the backbone networks. With the presented framework and the MGFQ algorithm, real-time multimedia traffic streams can be much better supported in terms of cell/packet delay and jitter     

High-performance implementation of in-network traffic pacing for small-buffer networks

Demands on data communication networks continue to drive the need for increasingly faster link speeds. Optical packet switching networks promise to provide data rates that are sufficiently high to satisfy the needs of the future Internet core network. However, a key technological problem with optical packet switching is the very small size of packet buffers that can be implemented in the optical domain. Existing protocols, for example the widely used Transmission Control Protocol (TCP), do not perform well in such small-buffer networks. To address this problem, we have proposed techniques for actively pacing traffic at edge networks to ensure that traffic bursts are reduced or eliminated and thus do not cause packet losses in routers with small buffers. We have also shown that this traffic pacing can improve the performance of conventional networks that use small buffers (e.g., to reduce the cost of buffer memory on routers). A key challenge in this context is to develop systems that can perform such packet pacing efficiently and at high data rates. In this paper, we present the design and prototype of a hardware implementation of our packet pacing technique. We discuss and evaluate design trade-offs and present performance results from an prototype implementation based on a NetFPGA fieldprogrammable gate array system. Our results show that traffic pacing can be implemented with few hardware resources and without reducing system throughput. Therefore, we believe that traffic pacing can be deployed widely to improve the operation of current and future networks.     

Application-aware scheduling for VoIP in Wireless Mesh Networks

Wireless Mesh Networks (WMNs) are seen as a means to provide last mile connections in Next Generation Networks (NGNs). Because of their auto-configuration capabilities and the low deployment cost WMNs are considered to be an efficient solution for the support of multiple voice, video and data services in NGNs. This paper looks at the optimal provision of resources in WMNs for Voice over IP (VoIP) traffic, which has strict performance requirements in terms of delay, jitter and packet loss. In WMNs, because of the challenges introduced by wireless multi-hop transmissions and limited resources, providing performance quality for VoIP comparable to the voice quality in the traditional circuit-switched networks is a major challenge.This paper analyses different scheduling mechanisms for TDMA-based access control in mesh networks as specified in the IEEE 802.16-2004 WiMAX standard. The performance of the VoIP applications when different scheduling mechanisms are deployed is analysed on a variety of topologies using ns-2 simulation and mathematical analysis. The paper concludes that on-demand scheduling of VoIP traffic – typically deployed in 802.11-based WMNs – is not able to provide the required VoIP quality in realistic mesh WiMAX network scenarios and is therefore not optimal from a network operator’s point of view. Instead, it is shown, that continuous scheduling is much better suited to serve VoIP traffic. The paper then proposes a new VoIP-aware resource coordination scheme and shows, through simulation, that the new scheme is scalable and provides good quality for VoIP service in a wide range of network scenarios. The results shown in the paper prove that the new scheme is resilient to increasing hop count, increasing number of simultaneous VoIP sessions and the background traffic load in the network. Compared to other resource coordination schemes the VoIP-aware scheduler significantly increases the number of supported calls.     

Uplink Scheduling for Supporting Real Time Voice Traffic in IEEE 802.16 Backhaul Networks

In this paper we propose simple enhancements to the bandwidth （BW） request messages in IEEE 802.16 for supporting real-time packet voice traffic. Three different BW request formats are proposed, each requiring a different amount of latency information about the buffered packets at the SS. On this basis, packet scheduling schemes are proposed for the BS to make resource allocations for real-time traffic. Our results show that the proposed BW request and scheduling schemes achieve significantly lower packet loss probability than the standard IEEE 802.16 BW request with round robin scheduling. The results further show that there is an optimum point about how much delay information the SS should report to the BS in order to best utilize the uplink resources while the SS provides satisfactory real-time performance for the voice traffic.     

多路径网络中流量均衡的优化算法

在向下一代互联网络演进的过程中,多路径网络已经成为提高网络性能及可靠性的有效手段.在网络中,可选用的多条路径提供了流量流向的通路,然而如何有效地均衡各条路径的流量,提高网络的性能,是多路径网络必须解决的一个重要问题.针对丢包率比较敏感的应用需求,如VOIP,将预测思想与最优化理论相结合,研究了在多路径网络环境下的流量均衡问题.流量均衡算法首先预测每条路径的丢包率,并以减少所有路径丢包率之和及达到最优的资源利用率为目标,将流量均衡问题转化为最优问题.理论分析及仿真实验表明,该算法能有效地降低网络丢包率,提高网络性能.     

Scheduling of wireless control networks based on IEEE 802.15.4 networks: Mixed traffic environment

This paper describes a scheduling method of wireless control networks for factory automation using IEEE 802.15.4 networks. The superframe of IEEE 802.15.4 is used for the transmission of real-time mixed data for wireless control systems. The schedulability of real-time data is defined, and scheduling algorithms are proposed for the efficient transmission of real-time mixed traffic. Simulation results show enhancements in the average network utilization and packet drop rate for real-time data.     

基于网络处理器的防火墙流量控制技术

分析了流量控制机制中现有的缓冲管理和分组调度算法,提出一种适合防火墙流量控制特点和网络处理器特点的自适应抢夺式流量控制算法,并给出基于网络处理器IXP2400的具体设计实现。     

基于RTCP的闭环码率调控和流量整形策略

网络监控系统中的实时视频质量容易受网络带宽影响。针对此问题,提出了一种基于RCTP控制报文的闭环码率调控策略,即通过分析RTCP接收者报包(Receiver Report, RR)的反馈信息,调整编码器码率,以自适应网络承载能力;又进一步针对H. 264码流传输的高突发性,提出了码流流量整形策略,用以抑制数据突发,从而避免因突发引起的瞬时网络阻塞,减小网络丢包。实验结果表明,本策略有效地降低了码流的传输丢包率,提高了实时视频质量。