数据中心网络中基于传输速率分配算法的TCP协议

传输控制协议(Transmission Control Protocol,TCP)是数据中心网络中常用的传输协议。然而,同一个网络环境下,由于TCP协议的公平共享原则,TCP无法保障不同优先级业务的服务质量。针对该问题,提出了基于传输速率分配算法的TCP(Transmit Rate Allocation based TCP,TRA-TCP)。汇聚节点实时监测记录不同优先级业务的数据传输速率,并为不同优先级的业务流分配不同的传输速率,以保障高优先级业务的QoS。实验表明,与已有协议相比,TRA-TCP协议最高能够将高优先级业务的吞吐量提升50%,并且将高优先级业务的时延保持在0.1秒以下。     

基于IEEE802.11自适应调度的QoS增强机制研究

针对IEEE802.11DCF的QoS问题,提出一种增强型自适应调度的分布式EASDCF机制,并通过最大竞争窗口和重传次数进行区分服务,以较高的概率保证了实时业务优先访问信道,并使得丢包率敏感的业务得到可靠保障。仿真结果表明EASDCF所采用的分级策略具有很好的效果,使无线局域网整体的吞吐性能得到提升,使资源得到更加合理的利用。     

内容中心网络中基于内容感知的QoS保证机理探析

针对目前内容中心网络在QoS保证方面研究不足的问题,提出一种基于内容感知传输机制的内容优先级调度算法。该算法利用内容热度值判决内容数据包的优先级概率决定不同内容的调度顺序,能够根据网络环境动态调整传输队列。仿真结果表明,该机制在高优先级内容流量比例为20%的情况下,平均吞吐量相比于NDN常规传输机制性能提高约35%。     

802.16 Mesh模式下提供QoS保障的调度算法

无线Mesh网络是一种多跳分布式自组织网络。提出了一种IEEE 802.16 Mesh模式下的分布式QoS保障调度算法。该算法充分利用方向性天线带来的空分复用增益,并采用DiffServ机制保证QoS需求。仿真结果表明,所提算法不仅提高吞吐量,而且能够为不同类型的服务提供QoS保障。     

具有任意自由度的B样条非均匀细分*

为了便于工程实际应用,非均匀细分方法现在已经成为计算机图形学和几何建模中的热点问题。本文提出一个具有任意自由度的B样条非均匀细分算法,其实现与B样条均匀细分即Lane–Riesenfeld细分方法相似。该算法包含了非均匀d环结构生成的双重控制点,其中d环相似于d度均匀B样条曲线的Lane-Riesenfeld算法中均匀的d环结构。Lane-Riesenfeld算法是由B样条曲线基函数的连续卷积公式直接得出的,而本文的算法是blossoming方法的一个扩展。对于非均匀B样条曲线来说,本文的节点插入方法比之前的方法更简单更有效。     

Differentiation, QoS guarantee, and optimization for real-time traffic over one-hop ad hoc networks

Nodes having a self-centrically broadcasting nature of communication form a wireless ad hoc network. Many issues are involved to provide quality of service (QoS) for ad hoc networks, including routing, medium access, resource reservation, mobility management, etc. Previous work mostly focuses on QoS routing with an assumption that the medium access control (MAC) layer can support QoS very well. However, contention-based MAC protocols are adopted in most ad hoc networks since there is no centralized control. QoS support in contention-based MAC layer is a very challenging issue. Carefully designed distributed medium access techniques must be used as foundations for most ad hoc networks. In this paper, we study and enhance distributed medium access techniques for real-time transmissions in the IEEE 802.11 single-hop ad hoc wireless networks. In the IEEE 802.11 MAC, error control adopts positive acknowledgement and retransmission to improve transmission reliability in the wireless medium (WM). However, for real-time multimedia traffic with sensitive delay requirements, retransmitted frames may be too late to be useful due to the fact that the delay of competing the WM is unpredictable. In this paper, we address several MAC issues and QoS issues for delay-sensitive real-time traffic. First, a priority scheme is proposed to differentiate the delay sensitive real-time traffic from the best-effort traffic. In the proposed priority scheme, retransmission is not used for the real-time traffic, and a smaller backoff window size is adopted. Second, we propose several schemes to guarantee QoS requirements. The first scheme is to guarantee frame-dropping probability for the real-time traffic. The second scheme is to guarantee throughput and delay. The last scheme is to guarantee throughput, delay, and frame-dropping probability simultaneously. Finally, we propose adaptive window backoff schemes to optimize throughput with and without QoS constraints.     

移动WiMAX网络中的VoIP调度机制

移动微波存取全球互通(WiMAX)网络使用了5种调度机制来保证服务质量,其中的3种被设计用于实时性业务。但是,这3种调度机制都缺乏公平性。在资源不足的时候,通过丢弃新用户的请求来保证旧用户的服务质量(QoS)。为此,针对WiMAX中的因特网语音(VoIP)服务提出了一种基于优先权的新调度机制。该机制中,不同用户的业务请求将被赋予不同的优先权。新旧用户同时请求资源时,新用户的请求拥有更高的优先权;资源分配中心再根据优先权的高低为用户分配资源,从而在最大限度上保证了资源分配的公平性。仿真结果显示,新调度机制可以将网络中的因特网语音服务的连接数和总吞吐量分别提高15%和11%左右。     

An efficient scheduling algorithm for radio resource reuse in IEEE 802.16j multi-hop relay networks

The IEEE 802.16j standard for WiMAX introduced the concept of relay station in order to increase the service area and decrease the deployment cost of the network. In this paper, we have proposed an efficient scheduling scheme for IEEE 802.16j networks, which maximizes the number of connections that are scheduled in a particular time slot. The proposed scheme schedules the connections based on their priority, which is decided by the quality of service (QoS) requirement of the connections. A selected connection can be scheduled in the current timeslot only if it is not having interference with any of the already scheduled connections. Our algorithm considers scheduling of lower priority connections even if any higher priority connection is not scheduled due to interference. Thus, the delay for lower priority connections is reduced without increasing the delay for higher priority connections. In addition, our algorithm achieves higher frame utilization and higher system throughput by reducing the length of the schedule.     

FLEXIBLE FUZZY PRIORITY SCHEDULING OF THE CAN BUS

With the increasing complexity of distributed real‐time systems, the need for improved CAN bus performance is continually increasing. Normally, a scheduling scheme with static‐priority has low network schedulability/utilization; while using dynamic priority will improve the QoS of the network at the cost of a narrow service range or a high overhead, compared with the fixed priority scheduling schemes. Actually, because of the fluctuation of network traffic, these priority policies may not guarantee flexibility for different kinds of messages. Based on the broadcast nature of the CAN bus, a closed‐loop fuzzy scheduling scheme is proposed in this paper. Compared with the dynamic priority schemes, this fuzzy scheduling scheme uses fewer bits to encode fewer priority levels, which widens the service range of the network without increasing overhead. Based on game theory, a fuzzy parameter updating algorithm for the fuzzy scheme is developed to improve the adaptation of the scheme, which guarantees the required QoS of the network even with traffic fluctuation. Simulation results well demonstrate the abilities of the fuzzy scheme to guarantee high schedulability for real‐time messages, as well as the fairness and the same QoS for non‐real‐time messages in networks.     

An opportunistic resource allocation approach for mixed QoS and non-QoS connections in OFDMA wireless networks

An opportunistic resource allocation approach is proposed to guarantee both fair resource allocation and high system throughput under combinations of QoS and non-QoS connections in OFDMA networks. This approach features dynamic connection classification and packet prioritization based on real-time network conditions and QoS constraints. A classifier is first employed to prioritize QoS connections by observing the channel state of each subscriber station and the utilization of network resources. It performs a finite-horizon Markov decision process with dynamic rules affected by system load. The transmission order of packets is then determined by an opportunistic multiservice scheduler according to the QoS requirements of connections and the output of the classifier. Having the scheduling result, an allocator assigns slots to the scheduled packets, and its output is linked back to the connection classifier through a resource usage observer for all subscriber stations. The sub-channel allocation problem is also solved by cooperation between the slot allocator and the packet scheduler. Results of numerical analysis and NS2 simulation confirm the advantages claimed above. The same conclusion can also be drawn from the comparison with several existing approaches in terms of system throughput, service successful ratio, average spectral efficiency, and system revenue.     

远程NCS的QoS调度策略研究

由于Internet只提供尽力而为服务,其随机、不确定的延时,不能保证基于Internet的远程NCS实时性等QoS要求,使得控制系统的稳定性很差.在IP网传统分布式QoS路由策略的基础上,提出一种基于数据优先级机制和指令推测技术的远程NCS的QoS调度策略.通过NS2仿真实验表明,在网络负载不过大时,该QoS调度策略能有效保证远程NCS的系统延时,有助于提高网络的带宽接纳率和控制系统的可靠性.     

MHWSN中保证混合业务QoS的跨层调度算法

针对中高速传感器网络中混合业务QoS（Quality of Service）要求,跨层考虑物理层和数据链路层参数,提出了一种保证混合业务服务质量的调度算法AM-LWDF。该算法同时考虑时延优先级和吞吐量优先级,在满足实时业务QoS约束的前提下,以最大化系统吞吐量为目标建立了相应的优化模型,对实时业务能够满足时延较小的要求,对非实时业务满足吞吐量较大的要求。仿真结果表明,该调度算法可以灵活地在时延和吞吐量之间取得满意的折衷,并保证不同类型业务用户间的公平性。     

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

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

一种基于WiMAX mesh网络的区分服务调度方案

IEEE 802.16支持多种不同类型的调度服务,并将服务质量支持机制引入媒体接入控制层,却没有规定相应的调度算法。在IEEE 802.16定义的mesh模式下,针对不同类型服务,提出了一种区分服务的调度方案,该方案采用集中式和分布式混合调度。仿真结果表明:该方案下系统平均时延和用户满意度均有所改善。     

基于跨层的中高速传感器网络多元参数调度与资源自适应分配算法

针对中高速传感器网络中不同业务对QoS(quality of scrvice)的不同要求,跨层考虑物理层和数据链路层参数,提出了一种适合混合业务的多元参数调度算法和资源分配算法。该算法根据不同的业务动态调整时延补偿因子和吞吐量补偿因子两个参数,在满足实时业务QoS约束的前提下,以最大化系统吞吐量为目标建立了相应的优化模模型,对于实时业务能满足时延较小的要求,对于非实时业务能满足吞吐量较大的要求。仿真结果表明,该调度算法可以灵活地在系统功率效率和用户服务质量满意度之间取得折衷,并保证不同类型业务用户间的公平性。     

智能配电网通信多信道调度策略

为了有效提高基于无线传感网的配电网服务质量,进一步增强配电网中数据实时性,减少延迟,提出了一种基于优先级的多信道调度策略。首先,根据实时的信道链路状态信息,提出了基于最小跳数生成树的链路路由算法（LB-MHST）,克服了无线射频干扰,保证智能电网的服务质量;然后,针对配电网中不同数据包对于延迟要求的不同,考虑了数据优先级传输,有效地提高了感知节点的数据传输效率,进一步满足了配电网中的QoS性能要求。实验结果表明,与最小跳数生成树（MHST）算法相比,尤其是在多信道延迟感知传输中,提出算法在单信道、8信道和16信道时分别将高负载流量延迟性能提高了12%,15.2%和18%。     

LTE系统中提高TCP性能的资源调度算法研究

LTE可以提供真正无处不在基于IP的移动宽带业务,但随着承载网的IP化,网络拥塞、丢包、抖动、延时等质量问题将影响到LTE业务层的QoS质量.作为LTE无线资源管理的核心,研究并设计一个良好的资源调度算法是提高数据业务的性能和终端用户的体验是一个亟待解决的重要任务.本文通过借鉴LTE对VoIP数据分组的半持续调度算法的思想,提出了一种LTE的无线资源调度的改进方案.方案将TCP确认包映射到具有更高优先级的空闲逻辑信道,从而降低了ACK包在无线信道中发生丢弃和拥塞的概率,避免了TCP拥塞控制机制的频繁开启.仿真结果表明,本文提出的TCP确认包映射转换方案在RTT时延、吞吐量等方面均有一定的提升,具有一定的稳定性和性能优势.     

无线Mesh网络中VOIP的QoS性能分析

针对VoIP(Voice over IP)业务在无线Mesh网上进行传输时存在服务质量(QoS)需求难以保证、带宽利用率低的问题,介绍了VoIP的QoS影响因素,分析了端到端时延、时延抖动和丢包率等几个重要参数,并对VoIP在无线Mesh网中的传输性能进行了论述。提出了基于无线Mesh网络的QoS保证机制,可以为端到端的数据传输公平的分配带宽,并能在保证QoS下实现大规模的实时任务的多跳转发。仿真试验表明能有效降低端到端时延,有着更好的QoS性能。     

基于TDMA的空中自组网MAC层资源调度算法研究

空中移动无线自组织网络是一种拓扑结构快速变化,有自组织性的多跳无中心网络;针对传统时隙分配算法资源利用率低、吞吐量不足、通信距离近等问题,采用引入分配系数的混合时隙分配模式,通过节点业务优先级和流量预测相结合,设计了一种基于TDMA定向分布式资源动态调度算法（M-TDMA）;对比分析了节点数量、传输速率、分配系数以及不同拓扑等多个维度对算法传输时延、吞吐量以及丢包率的影响;最后通过仿真实验对资源调度算法进行验证;仿真结果表明,在20个网络节点时,网络的最大传输时延小于600 ms,网络吞吐量可以达到4.5 Mbps以上, M-TDMA算法通过高效的资源调度,有效降低了网络传输时延并提高了网络吞吐量;     

一种基于IEEE 802.16j网络的带宽调度方案*

针对IEEE 802.16j网络,提出了一种上行业务的动态联合带宽资源调度方案。根据该网络系统树状拓扑结构,在基站BS和中继站RS间采用分级分布式资源调度体制,从而既保障了业务的带宽需求,又提升了上行带宽利用率,同时还提出了针对不同类型业务采用不同的调度算法,改善了调度的公平合理性。仿真结果表明,提出的动态联合调度方案相比严格优先级调度更具灵活性,能够在兼顾用户速率公平的条件下有效地保证各种服务的QoS要求,同时也可获得较高的带宽资源利用率。