EPON中一种基于QoS的MAC协议设计

提出了一种新的EOPN利用动态带宽分配算法来保证服务质量的MAC协议。该协议使得高优先级数据的延时和抖动减小;当网络对新接入的ONU进行初始化时对高优先级数据没有影响;同时,通过OLT控制中优先级数据的接入量保证其带宽分配的公正性。确保网络的QoS。     

基于优先级的CHOKe算法仿真与性能分析

为将区分服务(DiffServ)网络架构中的优先级服务与网络拥塞控制相结合,提出一种应用于DiffServ架构核心路由器的CHOKe算法(CHOKeW)。针对不同优先级别的数据流进行带宽分区,为高优先级的数据流分配高带宽,并且当发生网络拥塞时通过限制高速非响应流占用的带宽,达到保护响应流的同时兼顾相同优先级数据流公平性的目的。实验使用NS-2建立仿真模型,分析CHOKeW算法、加权公平队列算法、RIO算法的不同优先级混合流的带宽公平分配情况,结果表明,CHOKeW算法能够有效提高网络性能,保证网络服务质量,并且较好地解决基于公平性和优先级的带宽分配问题     

媒体服务器中保证服务质量的技术研究

在分析VOD系统的构成和工作过程的基础上,考虑到不同客户对视频服务质量的要求不一样,提出了一种能提供不同级别服务的VOD系统的实现方案。服务器端通过为不同的客户分配不同的带宽来提供不同的视频服务质量。本文详细阐述了使用准入控制、速率控制和差错控制如何保证不同客户的服务质量。     

无线Mesh网络中基于业务价值的组播带宽分配方案

高延迟及低效益是无线Mesh网络中开展流媒体业务面临的主要问题。为解决该问题,首先赋予组播业务价值,该值反映了业务的网络优先级及效益优先级,并提出一个基于组播价值优先级的组播带宽分配方案。该方案第一阶段实施基于价值优先级的不区分业务类型的静态分配,通过对高价值业务的优先调度,实现了组播价值最大化及带宽效益最大化。在拥塞时,实施第二阶段的基于业务带宽需求调整及抢占的动态分配,保证了低时延约束业务的服务质量。仿真与常见算法的比较表明,所提出的方案在保证业务网络服务质量的同时,能实现带宽效益最大化。     

一种新的基于业务区分的接入控制算法

鉴于IEEE802.11e EDCA接入控制机制在高背景负载条件下无法保证高优先级数据流的服务质量,提出了一种利用自适应的、连续的、变次数的RTS请求,以提高高优先级业务的接入成功概率,并减少高优先级业务之间碰撞的算法。理论分析和仿真结果表明,该算法能有效地提高高优先级数据的接入成功概率,保护其端到端吞吐量,减少分组重传次数和分组时延,从而保证高优先级数据流的服务质量。     

基于多队列切换的SDN拥塞控制

由于传统网络缺乏对转发队列的直接控制,并且难以保证链路利用率和服务质量(QoS),针对这一问题,本文提出基于多队列的SDN拥塞控制算法。该算法对链路数据流量设置多个阈值,当某一链路流量突增达到设定阈值时,控制器立即启动相应的拥塞控制机制。根据数据流的优先级,自适应增加高优先级队列的带宽,适当减小低优先级数据队列的带宽,保障高优先级数据顺利传送。实验结果表明,该方法能有效减少网络拥塞,优化数据流的QoS。     

网络控制系统Web服务器服务质量管理方案的研究

提出一种基于Web的自适应内容传输管理方案,为不同网络客户提供不同优先级的性能服务,并且各种服务相互独立,同时能基于请求率和传输带宽共享系统资源。这种方案在传统的允入控制基础上改善了服务性能,根据网络负载情况和服务质量需求自适应选择传输内容,满足了客户对网络传输服务质量需求。该管理方案可以在三层模型的中间层实施,便于修改和维护,给出的实验结果显示了该方案的有效性。     

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

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

实时企业服务总线的研究与设计

针对现有企业服务总线在不同类型业务流竞争有限带宽资源时产生系统拥塞的问题,提出一种实时企业服务总线模型.对JBI标准进行了改进,增加了业务优先级和业务时间约束的语义,并加入流量控制和带宽分配组件.系统运行时能根据不同类型业务流带宽需求,按照业务类型优先级从高到低动态分配服务总线的业务流量带宽.仿真实验结果表明,该方法可以保证高优先级业务的带宽需求,减少因业务拥塞导致的服务质量下降,并进而提升系统整体的吞吐能力.     

无线自组网络QoS流的准入控制和流量控制

作者曾提出一个QoS路由和准入控制机制－QDSR,并且在小规模实时视频传输实验床上实现了这些方案。虽然QDSR的准入控制只保证每个节点有足够的可用带宽给准入的所有流使用,但并不保证每个流在较小的时间尺度上得到请求的带宽。为此,作者对QDSR的准入控制机制进行了改进并增加了流量控制机制,以满足实时应用的QoS需求。在NS2仿真环境中实现了QDSR以及对QDSR的改进。仿真结果表明,改进机制改善了QDSR的视频流的传输质量,较好地提高了视频流的吞吐率和投递率,减小了数据包的端到端延迟,并且能很好地满足包括视频传输在内的多种业务的传输需要。     

Harmonic proportional bandwidth allocation and scheduling for service differentiation on streaming servers

To provide ubiquitous access to the proliferating rich media on the Internet, scalable streaming servers must be able to provide differentiated services to various client requests. Recent advances of transcoding technology make network-I/O bandwidth usages at the server communication ports controllable by request schedulers on the fly. In this article, we propose a transcoding-enabled bandwidth allocation scheme for service differentiation on streaming servers. It aims to deliver high bit rate streams to high priority request classes without overcompromising low priority request classes. We investigate the problem of providing differentiated streaming services at application level in two aspects: stream bandwidth allocation and request scheduling. We formulate the bandwidth allocation problem as an optimization of a harmonic utility function of the stream quality factors and derive the optimal streaming bit rates for requests of different classes under various server load conditions. We prove that the optimal allocation, referred to as harmonic proportional allocation, not only maximizes the system utility function, but also guarantees proportional fair sharing between classes with different prespecified differentiation weights. We evaluate the allocation scheme, in combination with two popular request scheduling approaches, via extensive simulations and compare it with an absolute differentiation strategy and a proportional-share strategy tailored from relative differentiation in networking. Simulation results show that the harmonic proportional allocation scheme can meet the objective of relative differentiation in both short and long timescales and greatly enhance the service availability and maintain low queueing delay when the streaming system is highly loaded.     

Admission control for media on demand services

Admission control software is used to make accept or deny decisions about incoming service requests to avoid overload. Existing media streaming software includes only limited support for admission control by allowing for predefined static rules. Such rules limit for example the number of requests that are allowed to enter the system during a certain time or define thresholds concerning the utilization level of a single resource such as network bandwidth. In media streaming applications, however, the bottleneck resource (CPU, Disk I/O, network bandwidth, etc.) might change over time depending on the current demand for different types of audio or video files. This paper proposes a model for adaptive admission control in the presence of multiple scarce resources. Opportunity costs for a service request are determined at the moment of an incoming request and compared to the revenue of a request in order to make an accept/deny decision. Opportunity costs are based on resource utilization, service resource requirements, expected future demand for services, and the revenue per accepted service. The model allows rejection of service requests early to reserve capacity required to perform future service requests with higher revenues. We describe a number of experiments to illustrate the benefits of adaptive admission control models over static admission control rules.     

Web服务器集群系统QoWS研究

请求负载的增加常常导致Web服务器系统性能降低,用户期望的服务质量得不到保证,这是服务级Web系统所面临和必须解决的问题。文章提出了一种Web服务器集群环境下的负载分配策略,通过对用户请求分类、将不同类别的请求进行响应性能隔离、优先为高级别请求提供服务以及请求许可控制等手段,对不同类别的Web请求提供不同质量的服务,保证了服务级用户的服务质量。同时采用最迟分配原则,改善系统的负载均衡能力,缩短系统平均响应时间。最后通过仿真实验,验证了该策略的正确性和有效性。     

HFC接入网MAC层QoS系统架构研究与实现

针对HFC(Hybrid Fiber-Coax)接入网络服务质量保证问题,通过对DOCSIS(Data-over-Cable Service Interface Specifi-cations)QoS(Quality of Service)标准进行深入研究,采用多种QoS技术并对其进行有针对性的改进从时延、带宽等方面保证了不同调度业务的服务质量,从而给出了一种适用于HFC网络接入设备的QoS系统解决方案.网络仿真结果显示采用该QoS系统架构提高了信道带宽利用率,保证了高优先级调度业务对带宽、时延等要求,尽量级联的级联策略使上行带宽利用率提高了大约25%.此外,该QoS系统架构已经成功应用于符合EuroDOCSIS1.1规范的支持双向有线电视点播平台中,通过了功能验证并表现出良好的稳定性.     

一种基于度量的Web服务质量机制

提出了一种简单、准确和高效的带宽调节算法，该算法对每一个服务请求设置一个带宽标准，同时根据对服务请求的分类和Web服务器系统的有效带宽，来分配及调节每一个服务请求的实际带宽，构成一种基于度量的Web服务质量机制，使Web服务器系统能为不同类型的客户请求提供有区分的和有服务质量的Web服务。     

基于请求响应控制机制的数据调度策略

现有P2P流媒体系统的调度策略大多在请求端进行数据调度,在响应端则采用简单的先来先服务或最小时限优先响应的响应策略,其缺点是优先级较高的请求在响应时未必被优先响应。为此,综合考虑数据块的紧迫性、稀缺性以及请求节点的带宽,提出一种基于请求响应控制机制的数据调度策略(DSBRC)。与现有的数据调度策略相比,DSBRC提高系统上行带宽利用率,同时缩短节点启动时延和提高节点播放质量。     

基于QoS的磁盘调度策略

随着视频点播、视频会议、视频监控、数字图书馆等流媒体应用的普及，流媒体服务器存储资源管理成为制约服务质量的瓶颈之一。根据多媒体服务器的性能要求，提出了一种支持QoS的磁盘调度策略。它由三个主要部分组成：探测模块、负载监测模块和自适应管理模块。探测模块，负责判断当前的资源情况能否满足服务请求；自适应模块，根据负载监删模块检测到的负载变化情况，动态调整服务周期在实时请求和尽力服务请求之间的分配。实验表明此磁盘调度策略能在保证实时请求无抖动执行的同时，明显减少了非实时请求的响应时间。     

On applying fair queuing discipline to schedule requests at access gateway for downlink differential QoS

Scheduling packets is a usual solution to allocate the bandwidth on a bottleneck link. However, this solution cannot be used to manage the downlink bandwidth at the user-side access gateway, since the traffic is queued at the ISP-side gateway but not the user-side gateway. An idea is scheduling the requests at the user-side gateway to control the amount of the responses queued in the ISP-side gateway. This work first investigates the possibility of applying the class-based fair queuing discipline, which was widely and maturely used in scheduling packets, to schedule requests. However, we found that simply applying this discipline to schedule requests would encounter the timing and ordering problems at releasing requests and may not satisfy high-class users. Thus, we propose a minimum-service first request scheduling (MSF-RS) scheme. MSF-RS always selects the next request from the class receiving the minimum service to provide user-based weighted fairness, which ensures more bandwidth for high-class users. Next, MSF-RS uses a window-based rate control on releasing requests to maintain full link utilization and reduce the user-perceived latency. The results of analysis, simulation and field trial demonstrate that MSF-RS provides fairness while reducing 23–30% of user-perceived latency on average. Besides, a MSF-RS gateway can save 25% of CPU loading.     

Presentation planning for distributed VoD systems

A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.