An efficient message scheduling algorithm for WDM lightwave networks

Two important issues that need to be addressed when designing medium access control (MAC) protocols for Wavelength Division Multiplexing networks are message sequencing and channel assignment. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted. This problem has been addressed extensively in the literature. On the other hand, message sequencing, which addresses the order in which messages are sent, has rarely been addressed. In this paper, we propose a new reservation-based message scheduling algorithm called RO-EATS that addresses both the channel assignment and message sequencing during its scheduling process. We formulate an analytical model and conduct extensive simulations to evaluate the performance of this algorithm. We compare the performance results of a well-known algorithm which only addresses the channel assignment issue with those of our new algorithm. The comparison shows that our new algorithm gives significant improvement over scheduling algorithms that do not consider message sequencing. As a result, we anticipate that these research results will lead to new approaches to message scheduling on WDM networks.     

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.     

Complexity of minimum length scheduling for precedence constrained messages in distributed systems

Switching networks are the core of many communication and multiprocessor systems. In these systems, a set of entities (communication equipment or processors) communicate through the switching network by exchanging messages. Simultaneous transmission or reception of two 01 more different messages through an input or output port results in the corruption of the messages (also called collision), which are useless and must be retransmitted later. This causes a performance degradation. Collisions can be avoided only by a proper scheduling of the messages. The same problem also arises in single-hop purely optical WDM systems, where simultaneous reception or transmission over the same wavelength channel results in a collision. In this paper, we study the problem of minimum length scheduling of a set of messages subject to precedence constraints. We show that the decision version of the problem is NP-complete even in very restricted cases. This means that the optimization problem cannot be solved in polynomial time, unless P=NP. Since the problem cannot be optimally solved by fast algorithms, we then investigate the existence of polynomial time approximation algorithms, by first proving that approximation algorithms cannot exist with performance ratio bounded by 4/3 or smaller and successively presenting an /spl epsiv/-approximation algorithm with /spl epsiv/<2 for the case of two precedence classes of messages. Finally, we assess the existence of an asymptotically optimal schedule in the general case of an unrestricted number of precedence classes.     

主从交换式以太网中跨多Switch传输消息实时调度研究

针对FTT-SE协议在单Master多交换机的网络扩展结构中存在的消息跨多Switch传输调度问题,给出了消息在每个基本调度周期内到达各交换机输出端口时间的计算方法,提出了单EC内的消息可调度性判定算法,并对算法的可行性进行了证明。在此基础上,设计了基于EDF的消息实时调度算法和准入控制算法。通过确定消息在每个基本调度周期内到达各交换机输出端口时间,所提出的调度算法能针对COTS交换机输出端口的FCFS消息传输机制,实现对单EC内消息传输的精确控制和调度。相对已有的调度算法,仿真实验表明,所提出的算法能更有效地利用网络带宽,提高了主从交换式以太网通信的实时性。     

基于发布/订阅模型的异构网络数据交换方法

消息数据高效传输是混合式网络的一个研究重点. 发布/订阅模型实现了消息发布者和消息订阅者之间解耦的消息传递模式, 适用于混合网络之间的消息数据传输. 通过将发布/订阅模型应用于消息数据交换, 规范了消息数据的格式, 实现了对各类通信设备的灵活管理以及基于消息内容的动态数据路由; 并利用一种基于循环调度的动态负载均衡算法, 对低速率网络和高速率网络之间的性能进行合理调度, 提高了低速率网络的性能. 模拟实验结果表明, 在混合式网络中发布/订阅模型能实现可靠的消息数据交换, 在负载平衡算法下性能更好.     

主从结构交换式以太网中实时消息调度研究

为使交换式以太网能满足实时通信的要求,针对FTT SE网络调度模型,提出了一种同时适用于周期性和非周期性实时消息的链路可调度性判定方法。在证明了消息链路调度优化问题MLSOP为NP complete的同时,针对周期性实时消息的链路调度优化给出了启发式算法LSHA。最后,对于周期性和非周期性实时消息分别设计了基于EDF的调度算法。仿真实验表明,在提高网络链路带宽利用率和减小消息平均延时方面,该算法均较FTT SE有明显的优势。     

Hard real-time communication in multiple-access networks

With the increasing use of distributed hard real-time systems, the ability of computer networks to handle hard real-time message traffic is becoming more important. For traditional networks, maximizing the throughput or minimizing the average message delay is the most important performance criteria. In the hard real-time domain, however, concern focuses on satisfying the time constraints of individual messages. This paper examines recent developments in hard real-time communication in local area multiple-access networks. Two general strategies are used in hard real-time communication: the guarantee strategy and the best-effort strategy. In the former, messages are guaranteed to meet their deadlines during normal operation of the network. In the best-effort strategy, the network will attempt to send messages before their deadlines, but no guarantees are given. Real-time message traffic can be distinguished according to whether it is best suited for the guarantee strategy or the best-effort strategy. Although this paper concentrates on multiple-access networks, many of the concepts presented and lessons learned are also applicable to other types of networks.     

Scheduling Time-Constrained Communication in Linear Networks

Abstract. We study the problem of centrally scheduling multiple messages in a linear network, when each message has both a release time and a deadline. We show that the problem of transmitting optimally many messages is NP-Hard, both when messages may be buffered in transit and when they may not be. For either case, we present efficient algorithms that produce approximately optimal schedules. In particular, our bufferless scheduling algorithm achieves throughput that is within a factor of 2 of optimal. We show that buffering can improve throughput in general by a logarithmic factor (but no more), but that in several significant special cases, such as when all messages can be released immediately, buffering can help by only a small constant factor. Finally, we show how to convert any of our centralized, offline bufferless schedules to a fully distributed online buffered schedule of equal throughput. Most of our results extend readily to ring-structured networks.     

CAN报文实时性分析及在线评估

结合CAN总线的位填充机制和最坏情况下的报文延迟时间的数学模型,针对周期性报文,提出基于主节点的报文调度方式,给出了该调度方式下的报文响应时间数学模型．通过CAN总线系统实验平台,对CAN报文的实际长度进行检测和分析,并对符合SAE标准的报文实时性进行了分析和评估．实验表明,基于主节点的调度方式保证了CAN报文的实时性,使得系统具有可调度性．     

Optimal scheduling with strict deadlines

The problem of dynamic scheduling of customers (messages) in time-critical environments is discussed. A single station (communication node) is considered, and it is assumed that each customer (message) must begin service (transmission) by an individually varying extinction time or else it is lost. Interest is in minimizing, in the sense of stochastic order, the number of messages lost over any time interval. A variety of results is proved that establishes the optimality of the shortest-time-to-extinction policy under rather general conditions. Similar results are found when messages have constraints on their complete transmission times. A network of M stations in tandem is considered under the hypothesis that a message is never lost and is scheduled irrespective of whether its extinction time (also called due date in this case) has expired or not. Under fairly general assumptions on the arrivals, deadlines, and services, it is shown that the earliest-due-date policy minimizes a form of average tardiness incurred over a finite operating horizon among all non-idling nonpreemptive policies. These problems are formulated in the context of stochastic dominance, and simple interchange arguments are used to establish all results     

Proposal and evaluation of dynamic assignment of priorities in CAN

The paper deals with the scheduling of information flow in a CAN ISO IS-11898 communication system. It mainly features a bus access arbitration protocol based on a priority assigned to each message to be transmitted; if two or more messages are transmitted at the same time by different communication nodes, only the message with the highest priority continues to be transmitted, the other being stopped. In real-time applications, messages contain information which must be transmitted within strict time constraints; according to the CAN ISO IS-11898 bus arbitration protocol, respect of real-time constraints of time critical information depends on the priority assigned to the message conveying it. The aim of the paper is to propose a procedure for dynamic assignment of priorities to messages to be transmitted, in such a way the real-time requirements of the information conveyed are fulfillled. Although many other approaches can be found in literature, the proposal is original as It is based on standard full CAN communication stacks.     

Dynamic service-level-agreement aware shared-path protection in WDM mesh networks

The notion of service level agreements (SLA) has been proposed to capture qualitatively and quantitatively defined performance contracts between service providers and their customers. How to provision satisfiable connections for customers according to their SLA parameters to avoid penalty as well as minimizing cost is one of the main concerns for a service provider. Connection reliability and restoration time are two important SLA parameters for a customer, and should be carefully considered in survivable wavelength-division-multiplexing (WDM) networks. A sound scheme should guarantee customers’ reliability and reduce restoration time while benefiting a service provider in resource efficiency. Under the SLA constraints and the assumption of single link failure, we first investigate a partial link-disjoint protection (PLDP) and analyze its availability and average restoration time. We then propose a dynamic constraint shared path protection (DCSP) algorithm in WDM mesh networks. Based on the basic ideas of the K-shortest path algorithm and PLDP, DCSP can provide differentiated services for customers according to their SLA parameters while being favorable for reducing average restoration time and optimizing resource utilization. Simulation results show that DCSP can efficiently guarantee the specific SLA requirements of customers with a slight increase in the blocking probability while still achieving spare resource sharing and restoration time optimizations.     

Network access protocol for hard real-time communication systems

Distributed hard real-time systems are characterized by communication messages associated with timing constraints, typically in the form of deadlines. A message should be received at the destination before its deadline expires. Carrier sense multiple access with collision detection (CSMA/CD) appears to be one of the most common communication network access schemes that can be used in distributed hard real-time systems. In this paper, we propose a new real-time network access protocol which is based on the CSMA/CD scheme. The protocol classifies the messages into two classes as ‘critical’ and ‘noncritical’ messages. The messages close to their deadlines are considered to be critical. A critical message is given the right to access the network by preempting a noncritical message in transmission. Extensive simulation experiments have been conducted to evaluate the performance of the protocol. It is shown that the protocol can provide considerable improvement over the virtual time CSMA/CD protocol proposed for hard real-time communication by Zhao et al.¹.     

Disseminating data with time constraint based on multichannel over ubiquitous computing environments

Time-constrained service plays an important role in ubiquitous services. However, the resource constraints of ubiquitous computing systems make it difficult to satisfy timing requirements of supported strategies. In this study, we study scheduling strategies for mobile data program with timing constraints in the form of deadlines. Unlike previously proposed scheduling algorithms for mobile systems which aim to minimize the mean access time, our goal is to identify scheduling algorithms for ubiquitous systems that ensure requests meet their deadlines. We present a study of the performance of traditional real-time strategies, and demonstrate that traditional real-time algorithms do not always perform the best in a mobile environment. We propose an efficient scheduling algorithm, called scheduling priority of mobile data with time constraint(SPMT), which is designed for timely delivery of data to mobile clients. The experimental results show that our approach outperforms other approaches over performance criteria.     

Self-scaling cooperative discovery of service compositions in unstructured P2P networks

We propose an efficient technique for improving the performance of automatic and cooperative compositions in unstructured Peer-to-Peer networks during service discovery. The technique exploits a probabilistic forwarding algorithm that uses different sources of knowledge, such as network density and service grouping, to reduce the amount of messages exchanged in the network. The technique, analysed in several network configurations by using a simulator to observe resolution time, recall and message overhead, presents good performance especially in dense and large-scale service networks.     

时间触发光纤通道调度算法确定性分析

光纤通道以其优良性能,成为下一代航电系统的必然选择。但是基于事件触发的消息调度形式限制了对航电系统性能的分析,为提高消息在网络中传输时间确定性,在时间触发协议的基础上,针对光纤通道提出一种时间触发的消息调度算法。通过对交换式网络建模,采用理论和仿真相结合的方法,对先来先服务调度策略和时间触发调度策略进行分析,结果表明时间触发调度算法可以很好地提高网络消息传输的确定性,满足航电系统安全关键消息的传输要求。     

一种增强任务关键无线网络可信性的消息调度策略

任务关键无线网络面临实时和安全等可信因素的挑战,而已有的消息调度算法忽略了安全因素。提出一种安全感知的实时调度算法(SAMS)。在不违背关键消息的实时约束和安全约束的前提下,该算法能最大化提升系统的安全服务质量。仿真结果显示SAMS的有效性和健壮性。     

A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters

We develop a message scheduling scheme for efficiently realizing all-to-all personalized communication (AAPC) on Ethernet switched clusters with one or more switches. To avoid network contention and achieve high performance, the message scheduling scheme partitions AAPC into phases such that 1) there is no network contention within each phase and 2) the number of phases is minimum. Thus, realizing AAPC with the contention-free phases computed by the message scheduling algorithm can potentially achieve the minimum communication completion time. In practice, phased AAPC schemes must introduce synchronizations to separate messages in different phases. We investigate various synchronization mechanisms and various methods for incorporating synchronizations into the AAPC phases. Experimental results show that the message scheduling-based AAPC implementations with proper synchronization consistently achieve high performance on clusters with many different network topologies when the message size is large     

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

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

Joint Algorithm of Message Fragmentation and No-Wait Scheduling for Time-Sensitive Networks

Time-sensitive networks(TSNs)support not only traditional best-effort communications but also deterministic communications,which send each packet at a deterministic time so that the data transmissions of networked control systems can be precisely scheduled to guarantee hard real-time constraints.No-wait scheduling is suitable for such TSNs and generates the schedules of deterministic communications with the minimal network resources so that all of the remaining resources can be used to improve the throughput of best-effort communications.However,due to inappropriate message fragmentation,the realtime performance of no-wait scheduling algorithms is reduced.Therefore,in this paper,joint algorithms of message fragmentation and no-wait scheduling are proposed.First,a specification for the joint problem based on optimization modulo theories is proposed so that off-the-shelf solvers can be used to find optimal solutions.Second,to improve the scalability of our algorithm,the worst-case delay of messages is analyzed,and then,based on the analysis,a heuristic algorithm is proposed to construct low-delay schedules.Finally,we conduct extensive test cases to evaluate our proposed algorithms.The evaluation results indicate that,compared to existing algorithms,the proposed joint algorithm improves schedulability by up to 50%.