基于CAN 网的模糊优先级配置策略

利用CAN网的广播特性,提出一种新的闭环模糊优先级配置策略.各节点数据优先级的设定既与其QoS需求有关,又与其节点标识位及前一个传输数据的优先级有关.该策略尽管使用较少的优先级,但仍能保证实时数据较高的可调度性和非实时数据的服务公平性.较少的优先级只占用较少的bit位,这样不仅扩大了CAN网的服务能力,而且提高了CAN网的带宽利用率.     

CAN总线中改进的EDF调度算法可调度性分析

针对于CAN总线的调度问题,因现有的平均分区EDF调度算法在对于优先级反转问题上收效甚微,从而导致消息缺乏一定的可调度性,故提出一种改进的基于幂函数分区的EDF算法;同时借助量化误差的概念,对该调度算法进行可调度性分析,充分论证了在该调度算法下,消息可调度的判定条件;采用CANoe平台进行实验仿真,对比平均分区EDF调度算法和双幂函数分区EDF调度算法,经试验测试验证了双幂函数分区EDF调度算法的可行性和优越性,改善了消息的最坏响应时间,提高了CAN网络通讯的实时性。     

Applications of machine learning approach on multi-queue message scheduling

Due to limited resource contentions and deadline constraints, messages on the controller area network (CAN) are competing for service from the common resources. This problem can be resolved by assigning priorities to different message classes to satisfy time-critical applications. Actually, because of the fluctuation of network traffic or an inefficient use of resources, these static or dynamic priority policies may not guarantee flexibility for different kinds of messages in real-time scheduling. Consequently, the message transmission which cannot comply with the timing requirements or deadlines may deteriorate system performance significantly. In this paper, we have proposed a controller-plant model, where the plant is analogous to a message queue pool (MQP) and the message scheduling controller (MSC) is responsible to dispatch resources for queued messages according to the feedback information from the MQP. The message scheduling controller, which is realized by the radial basis function (RBF) network, is designed with machine learning algorithm to compensate the variations in plant dynamics. The MSC with the novel hybrid learning schemes can ensure a low and stable message waiting time variance (or a uniform distribution of waiting time) and lower transmission failures. A significant emphasis of the MSC is the variable structure of the RBF model to accommodate to complex scheduling situations. Simulation experiments have shown that several variants of the MSC significantly improve overall system performance over the static scheduling strategies and the dynamic earliest-deadline first (EDF) algorithms under a wide range of workload characteristics and execution environments.     

A QoS-Tunable Scheme for ATM Cell Scheduling Using Evolutionary Fuzzy System

In packet switching network such as asynchronous transfer mode (ATM), the switching characteristics is important in delivering the guaranteed QoS (Quality of Service) level of the network. Many methods have been developed to control cell flow for shared bandwidth. The first-in first-out (FIFO), static priority (SPR), dynamically weighted priority scheduling (DWPS) (T. Lizambri, F. Duran, and S. Wakid, 1999) and weighted fair queuing (WFQ) (R. Händel, M.N. Huber, and S. Schröder, c1998) are some of the schemes for managing the shared bandwidth. Due to the diversity of services supported in ATM network, it is typical for the traffic flow pattern to change dramatically. A common trait of these algorithms is that their mechanisms are fixed, and they cannot adapt efficiently for such traffic flow changes. In order to address this, we propose an evolutionary fuzzy system (EFS) scheme to do ATM cell scheduling. With EFS, the fuzzy switching algorithm can be adjusted to track the changes in the pattern of traffic flow in order to maintain the desired level of performance. The desired quality of service (QoS) performance level can be conveniently achieved by tuning the parameters of the fitness function.     

Schedulability analysis for Controller Area Network (CAN) with FIFO queues priority queues and gateways

Controller Area Network (CAN) is widely used in automotive applications. Existing schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. However, in practice, some CAN device drivers implement FIFO rather than priority-based queues invalidating this assumption. In this paper, we introduce response time analysis and optimal priority assignment policies for CAN messages in networks where some nodes use FIFO queues while other nodes use priority queues. We show, via a case study and experimental evaluation, the detrimental impact that FIFO queues have on the real-time performance of CAN. Further, we show that in gateway applications, if it is not possible to implement a priority queue, then it is preferable to use multiple FIFO queues each allocated a small number of messages with similar transmission deadlines.     

Linux下多媒体业务差分IPv6测试平台的设计与实现

为了在无线网络中保证实时多媒体业务的服务质量(QoS),基于IPv6在无线局域网中设计并实现了差分QoS测试平台,实验测试各种支持QoS调度策略。测试平台核心部件为实现差分QoS调度的IPv6路由器。路由器由Linux操作系统来实现,采用可加载内核模块编程,使用Netfilter中钩子函数截获网络数据包,根据业务的不同优先级进行调度,合理分配网络资源,保证实时业务的服务质量。在此平台上,进行了多媒体业务差分QoS的演示和测试。实验表明,测试平台运行稳定,可以为QoS研究提供一个开放式开发测试环境。     

数据流处理中确定性QoS的保证方法

与以往尽最大努力的查询服务提供方式不同,讨论了数据流处理中确定性QoS的保证问题以网络演算为理论基础,提出了一种数据流处理中的QoS建模和QoS保证方法.系统运行前验证所有查询在满足各自的QoS前提下的可调度性.在运行时为通过QoS可调度性验证的每个查询分配代表其QoS需求的服务曲线,从而保证各查询期望的QoS.为了提高查询处理效率,还讨论了保证QoS的批调度和查询共享.实验结果表明,该QoS保证方法能够有效地为数据流上的连续查询提供确定性的QoS保证.     

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.     

动态分布式消息调度方法研究

提出一种适用于CAN总线网络的动态分布式消息调度方法,该方法能使消息在设定的生命期内成功地发送到目的节点,并且能实现公平地分配网络带宽。在这种方法中,消息帧的标识符段被重构,重构后的标识符的二进制值与消息的生命期、消息的等待时间等建立起对应关系,消息等待时间越长或生命期越短,消息的优先级越高。同时也从理论上分析了基于该方法的网络中所有消息完全可调度必须满足的条件,并实验验证该条件的正确性和消息调度方法的有效性。     

Genetic algorithm-based neural fuzzy decision tree for mixed scheduling in ATM networks

Future broadband integrated services networks based on asynchronous transfer mode (ATM) technology are expected to support multiple types of multimedia information with diverse statistical characteristics and quality of service (QoS) requirements. To meet these requirements, efficient scheduling methods are important for traffic control in ATM networks. Among general scheduling schemes, the rate monotonic algorithm is simple enough to be used in high-speed networks, but does not attain the high system utilization of the deadline driven algorithm. However, the deadline driven scheme is computationally complex and hard to implement in hardware. The mixed scheduling algorithm is a combination of the rate monotonic algorithm and the deadline driven algorithm; thus it can provide most of the benefits of these two algorithms. In this paper, we use the mixed scheduling algorithm to achieve high system utilization under the hardware constraint. Because there is no analytic method for schedulability testing of mixed scheduling, we propose a genetic algorithm-based neural fuzzy decision tree (GANFDT) to realize it in a real-time environment. The GANFDT combines a GA and a neural fuzzy network into a binary classification tree. This approach also exploits the power of the classification tree. Simulation results show that the GANFDT provides an efficient way of carrying out mixed scheduling in ATM networks.     

QoS-TEOS: QoS Guaranteed Throughput-Efficiency Optimal Distributed Scheduling in WiMAX Mesh Networks

WiMAX distributed scheduling can be modeled as two procedures: three-way handshaking procedure and data subframe scheduling procedure. Due to manipulating data transmission directly, data subframe scheduling has a closer relationship with user Quality of Service (QoS) satisfaction, and has more severe impact on network performance, compared with handshaking procedure. A QoS guaranteed Throughput-Efficiency Optimal distributed data subframe Scheduling scheme, named as QoS-TEOS, is proposed. QoS-TEOS achieves QoS guarantee through modeling services into different ranks and assigning them with corresponding priorities. A service with higher priority is scheduled ahead of that with lower priority and offered with high QoS quality. Same kinds of services that request similar QoS quality are classified into one service set. Different service sets are scheduled with different strategies. QoS-TEOS promotes network performance through improving network throughput and efficiency. Theoretical analysis shows that the scheduled data transmission should balance data generation rate from upper layer and transmission rate of physical layer, to avoid network throughput and efficiency declining. Simulation results show that QoS-TEOS works excellently to achieve throughput-efficiency optimization and guarantee a high QoS.     

Delivering relative differentiated services in future high-speed networks using hierarchical dynamic deficit round robin

With the increasing deployment of real-time audio/video services over the Internet, provision of quality of service (QoS) has attracted much attention. When the line rate of future networks upgrades to multi-terabits per second, if routers/switches intend to deliver differentiated services through packet scheduling, the reduction of computational overhead and elimination of bottleneck resulting from memory latency will both become important factors. In addition, the decrease of average queueing delay and provision of small delays for short packets are two further critical factors influencing the delivery of better QoS for real-time applications. The advanced waiting time priority (AWTP) is a timestamp-based packet scheduler which is enhanced from the well-known WTP. Although AWTP considers the effect of packet size, the latency resulting from timestamp access and a great quantity of computational overhead may result in bottlenecks for AWTP being deployed over high-speed links. Many existing schedulers have the same problems. We propose a multi-level hierarchical dynamic deficit round-robin (MLHDDRR) scheduling scheme which is enhanced from the existing dynamic deficit round-robin scheduler. The new scheme can resolve these issues and efficiently provide relative differentiated services under a variety of load conditions. Besides, MLHDDRR can also protect the highest priority traffic from significant performance degradation due to bursts of low-priority traffic. We compare the performance of AWTP with the proposed scheme. Extensive simulation results and complexity analysis are presented to illustrate the effectiveness and efficiency of MLHDDRR.     

Schedulability analysis and efficient scheduling of rate constrained messages in the TTEthernet protocol

Over time, cyber‐physical systems are becoming mixed criticality systems. As the complexity and the size of these systems grow, computation/communication resources should be more efficient than with traditional systems. TTEthernet is a communication infrastructure that enables the use of a single physical communication infrastructure for distributed mixed criticality applications while providing timely determinism. TTEthernet distinguishes between two traffic categories: the standard event triggered and the time triggered. The latter, for which higher priority is granted, is subject to strong timing guarantees because of strict periodicity constraint that fixes start‐time cycles of time‐triggered messages. In addition, event‐triggered traffic includes rate‐constrained messages that are of lower priority and have a minimum time interval between their transmission. The paper proposes both an on‐line efficient scheduling algorithm and a necessary and sufficient schedulability condition based on the worst case response time computation for rate‐constrained messages while taking into account time‐triggered messages transmission. Copyright © 2017 John Wiley & Sons, Ltd.     

一种无抖动的分布式多媒体任务调度算法

在分布式多媒体系统中,资源的管理和分配算法是保证应用的服务质量（ＱｏＳ）的关键问题,而资源管理中,ＱｏＳ协商和确认都和多媒体任务调芳算法有关,任务调度算法是资源管理的重要内容。现有的调度算法ＥＤＦ,ＲＭ,ＤＳｒ适用在分布式多媒体系统中,有局限性。本文基于风车调度模型,提出了一种无抖动调度的逐步消除候选项的并行算法ＤＭＳｒ,能达到分布系统中多媒体任务周期调度的无抖动特点,并讨论了算法的计算复杂度,证     

SCHEDULING AND CONTROL CO‐DESIGN FOR DELAY COMPENSATION IN THE NETWORKED CONTROL SYSTEM

The networked control system (NCS) is currently receiving increasing attention from researchers. Researches on this subject, however, have not considered the co‐design of network quality of service (QoS) and control quality of performance (QoP). This paper proposes a novel NCS design framework based on scheduling and control co‐design to compensate for random network‐induced delays. In the framework, a scheduling algorithm used to find the optimal sampling regions of control loops performs rough adjustment and guarantees the network QoS, while a novel adaptive fuzzy PID controller is designed to perform accurate adjustment to guarantee the control QoP. Practical application results obtained with a multi‐loop NCS show that the framework can ensure satisfactory performance due to its robustness against network uncertainty.     

An analytical QoS service model for delay-based differentiation

The increased need for Quality of Service (QoS) in today’s IP networks has concentrated a lot of research and implementation efforts. Carefully designed and managed priority services are essential for quality-demanding traffic, especially in large-scale IP-based environments where aggregation of flows is extensive and a variety of traffic types co-exist. Although individual mechanisms have been widely investigated, not much related work exists on integrated approaches to QoS provisioning that are also feasible to implement. This work presents a thorough approach to the design, dimensioning and provisioning of a high-priority service for high-quality-demanding traffic over an IP network. Our approach employs efficient scheduling and a dynamic admission control scheme while demonstrating an outstanding performance in terms of the quality offered to QoS-demanding traffic. A novel feature is also introduced: while other existing schemes only focus on provisioning of service rate guarantees, ours achieves in addition differentiation of the end-to-end delay perceived by IP flows.     

基于服务质量需求的存储系统动态优先权调度策略

多媒体应用要求存储系统提供保证服务质量的数据访问服务,响应时间超过延迟上限的访问请求必须小于一定的比例．基于服务质量需求的动态优先权调度策略（QADPS）根据多媒体应用接受存储系统服务的历史信息,计算多媒体应用的服务质量失败距离;并为失败距离较小的多媒体应用分配较高的调度优先权．QADPS根据多媒体应用的不同服务质量需求,实现了有差别的调度：多媒体应用的服务质量需求越严格,它的访问请求被调度的机会越高．QADPS能够在保证服务质量的前提下,支持更多的并发多媒体应用．     

多路路由算法及其在QoS路由中的应用

提出一个分布式服务质量路由算法,以求在不影响已存在连接的服务质量的前提下,寻找满足服务质量要求的可行路,该算法根据网络运营状况不同,改变寻路范围,当网络资源很充裕,寻路花费可忽略,可行路的存在性是首要问题时,寻路范围可以是整个网络,使得只要存在可行路,就一定能找到;当网络资源匮乏,寻路信息应尽可能少时,寻路范围将减少,直至每点只向一个邻点发送寻路信息,但其接通率不少于最短路算法。     

Link-level traffic scheduling for providing predictive QoS in wireless multimedia networks

A set of centralized burst-level cell scheduling schemes, namely, First Come First Served with Frame Reservation (FCFS-FR), FCFR-FR+, Earliest Deadline First with Frame Reservation (EDF-FR), EDF-FR+, and Multitraffic Dynamic Reservation (MTDR), are investigated for transmission of multiservice traffic over time division multiple access (TDMA)/time division duplex (TDD) channels in wireless ATM (WATM) networks. In these schemes, the number of time slots allocated to a virtual circuit (VC) during a frame-time is changed dynamically depending on the traffic type, system traffic load, the time of arrival (TOA)/time of expiry (TOE) value of the data burst and data burst length. The performances of these schemes are evaluated by computer simulation for realistic voice, video and data traffic models and their quality-of-service (QoS) requirements in a wireless mobile multimedia network. Both the error-free and the correlated fading channel conditions are considered. Simulation results show that the EDF-FR+ and MTDR schemes outperform the other schemes and can provide high channel utilization with predictive QoS guarantee in a multiservice traffic environment even in the presence of bursty channel errors. The EDF-FR+ scheme is found to provide better cell multiplexing performance than the MTDR scheme, Such a scheme would be easy to implement and would also result in a power conservative TDMA/TDD medium access control (MAC) protocol for broadband wireless access. Burst-level cell scheduling schemes such as EDF-FR+ can be easily adapted as MAC protocols in the emerging differentiated services (DS) enhanced wireless Internet protocol (IP) networks.     

分时EDF算法及其在多媒体操作系统中的应用

提出了一种新的CPU调度算法－－分时EDF（Earliest Deadine First)算法,该算法能保证硬实时任务不丢失死线,并易于在分时系统中实现。以分时EDF算法为基础,提出一种新的CPU层次调度算法－－HRFSFQ,该算法用于多媒体操作系统时能保证各类任务的QoS。最后通过大量实验证明了上述算法的有效性和正确性。