LHFS-支持公平服务的CICQ混合调度策略

 针对现有联合输入交叉点排队交换结构(CICQ,Combined Input and Cross-point Queuing)调度策略无法提供基于"流"的服务质量保障,探讨了在CICQ交换结构实施基于流调度的可能性,提出一种能够为到达流提供公平服务的分层混合公平服务调度策略—LHFS(Layered and Hybrid Fair Scheduling).LHFS对每个输入、输出端口可独立地进行变长分组交换,其算法复杂度为O(1),具有良好可扩展特性.理论分析结果表明,LHFS能够为业务流提供时延上限和公平性保障.最后,基于SPES(Switching Performance Evaluation System)仿真系统对LHFS的性能进行了评估.     

MUMF-支持单多播公平服务的调度策略

基于联合输入交叉点排队(CICQ,combined input and cross-point queuing)交换结构探讨了单多播混合调度的公平性问题,提出了能够为单多播业务提供混合公平性的CICQ理想调度模型。基于理想调度模型,提出了逼近理想调度模型的MUMF(mixed uni-and multicast fair)调度算法,MUMF调度算法采用了分级和层次化的公平调度机制,通过输入调度和交叉点调度确保单多播业务混合调度的公平性。MUMF交换机制的每个输入、输出端口可独立地进行分组交换,具有良好可扩展特性。最后,基于SPES(switching performance evaluation system)的性能仿真结果表明MUMF调度算法具有良好的时延、公平性和吞吐量性能。     

基于列生成的毫米波多连接链路配置调度算法

多连接技术允许用户同时建立和保持与多个小区/接入点的连接,通过网络元素之间的协调在吞吐量和可靠性方面大幅提高网络性能。针对毫米波通信中超高频段的链路中断问题,研究了多连接基于链路配置的调度算法,以提高链路调度效率,降低复杂度。首先,在系统模型中采用链路配置作为优化变量;其次,设计了多连接比例公平的调度准则;最后,提出一种基于列生成算法的链路配置调度优化算法,利用Dantzig-Wolfe分解将原问题分解为限制主问题和定价问题,并结合分支定界方法获得最优解。仿真结果表明,所提算法能够在数值上逼近全局最优,并且比现有的毫米波蜂窝网络链路调度方案增益平均提高40%以上。     

基于帧的ATM层次调度机制性能界及其仿真研究

对网络交换节点中所采用的调度机制的研究是网络提供QoS保证的一个重要课题.在本文中,结合基于帧调度器的简单性和GPS(generalized processor sharing)算法的良好性能,提出了一种新颖的基于帧的层次调度算法HFFQ(Hierarchical Frame-based Fair Queueing).HFFQ能同时支持实时业务和非实时业务,另外采用了简单计数的方法来替代复杂的系统虚拟时间的计算过程,大大减少了算法的实现复杂度.最后,用理论分析和仿真的方法,对HFFQ的公平性、服务率等指标的性能进行了论证.结果显示,它和PGPS(Packet-by-packet GPS)相比,在性能上有很大的提高.     

基于物联网的数字档案管理系统设计与实现

为提高基于物联网的大规模数字档案管理效率,在研究了Shamir秘密共享方案基础上,文中设计了一种分布式物联网档案管理系统.该系统由四个部分组成:客户端、调度器、节点管理器和常规节点,可实现文件保存和恢复、连接设置和数据传输及共享机制.此外,文中在Shamir的秘密共享方案中引入多系数多项式和内部填充,实现了数据的可扩展...     

一种低延迟的可扩展调度算法

提出了一种基于阈值的分布式迭代算法。与现有算法不同的是,该算法针对可扩展网络交换调度结构的特点,为处于最高优先级的调度器安排了2次迭代,第1次迭代用阈值方法找出一些较长的VOQ（虚拟输出队列）,并在最高优先级时隙之前的一个时隙完成,以缩短信号的处理时间。仿真结果表明,该算法与现有算法相比,在大流量的uniform流量模式下,延时性能和吞吐率获得了明显的提高。同时,该算法的硬件代价小,有效地实现了性能和复杂度的良好折中。     

RTAI实时调度算法及其调度器的改进

在实时系统中,任务调度策略是内核设计的关键部分.如何进行实时的任务调度,使任务能在特定的周期内完成是实时操作系统领域研究的一个热点问题.文中将一种基于RM算法的改进算法CPSS算法引入到RTAI调度器中,针对RTAI调度器在系统过载情况下出现调度性能下降等缺点,对RTAI调度器进行优化和改进.对改进后的调度器在调度时延方面和调度算法仿真方面进行了测试,实验证明了改进后的调度器能够提高Linux系统的实时性.     

基于CROSSBAR的iSLIP调度算法及其硬件实现

iSLIP是一种高效的队列调度算法,并且易于硬件实现.该文主要介绍基于CROSSBAR交换结构的调度算法iSLIP原理和及其在硬件中的实现;给出了iSLIP算法和算法的性能分析;并在结构上实现了一个16×16的交换仲裁器.     

OBS数据信道分群调度机制在波带交换中的应用

介绍了光突发交换(OBS)网络中的数据信道分群调度策略,并将此信道分群调度策略引入多粒度光交换网络中,提出了一种新的基于OBS信道分群的负载平衡波带分配策略.分析表明,该调度策略能达到改善网络性能的目的.     

基于有限波长变换器的多播调度算法研究

多播调度算法是DWDM多播光交换网的核心、关键技术.通过选择一组无冲突的多播连接请求实现点对多点的数据传输,在网络中同时调度最大数目的此类连接请求是一个非确定的多项式难题.为此,文章提出了一种基于输出光纤共享有限波长变换器的光交换结构的新近似调度算法,通过仿真证明该算法与现有算法相比,提高了网络的吞吐量.     

Analysis of Radio Resource Allocation in LTE Uplink

Long term evolution (LTE) uses orthogonal frequency division multiple access (OFDMA) and single carrier frequency division multiple access (SC-FDMA) as the downlink and uplink transmission schemes respectively. The Quality of Service (QoS) provision to users is one of the key objectives of the wireless network operators. This paper analyses an uplink LTE radio scheduler, called bandwidth and QoS aware (BQA) scheduler and evaluates its QoS performance. The BQA uplink scheduler is designed to provide efficient and fair allocation of the radio resources to users according to: the QoS of various traffic classes and the instantaneous channel conditions. The scheduler functionality is divided into time domain packet scheduling (TDPS) and frequency domain packet scheduling (FDPS). In this paper, an innovative feature, that is user QoS provisioning with dynamic QoS weights, is employed for the BQA scheduler along with multi-bearer users support. The QoS performance of the BQA scheduler is analyzed in several simulation scenarios using heterogeneous traffic environment. The results show that the BQA scheduler guarantees provision of QoS to users.     

ORCA-MRT: an optimization-based approach for fair scheduling in multirate TDMA wireless networks

This paper presents an optimization-based approach to solve the wireless fair scheduling problem under a multirate time division multiple access (TDMA)-based medium access control (MAC) framework. By formulating the fair scheduling problem as an assignment problem, the authors propose the optimal radio channel allocation for multirate transmission (ORCA-MRT) algorithm for fair bandwidth allocation in wireless data networks that support MRT at the radio link level. The key feature of ORCA-MRT is that while allocating transmission rate to each flow fairly, it keeps the interaccess delay bounded under a certain limit. The authors investigate the performance of the proposed ORCA-MRT scheduler in comparison to another recently proposed multirate fair scheduling algorithm. They also propose two channel prediction models and perform extensive simulations to investigate the performance of ORCA-MRT for different system parameters such as channel state correlation, number of flows, etc.     

User Selection Criteria for Uplink Spatial Multiplexing MIMO Systems

We study in this paper multiuser uplink scheduling algorithms for Multiple-Input Multiple-Output (MIMO) systems, where the multiusers compete for the MIMO Channel and the scheduler selects one user at a time based on a certain criterion. Then the selected user spatially multiplexes his data over the transmit antennas. This spatial multiplexing (SM) scheme provides high data rates while the multiuser diversity obtained from scheduling improves the performance of the uplink system. At the receiver, the Vertical-Bell-Labs LAyered Space Time architecture (V-BLAST) is used to detect the information layers. The main contribution of this paper is proposing and comparing the performance of several scheduling criteria for MIMO uplink scheduling. In addition, novel V-BLAST capacity bounds based on random matrix theory is presented. Furthermore, we investigate suboptimal schedulers and compare their performance. The main results of this study show that the scheduler that maximizes the optimal MIMO capacity doesn’t work well for a V-BLAST system. Instead, the optimal scheduler that maximizes the V-BLAST capacity is derived and analyzed. In addition, we look into scheduling for SM with sphere decoding and we find that in this case, using MIMO capacity as the scheduling criterion performs the best.     

Proportional fair scheduling with reduced feedback

An opportunistic feedback technique is proposed for proportional fair (PF) scheduling in a downlink multi-user system. This technique requires each mobile station, the scheduling metric of which is higher than a threshold, to send one-bit feedback for PF scheduling. The scheduler determines the optimal modulation and coding scheme for a scheduled user based on channel quality indicator (CQI) update, which is sent on a longer period than the scheduling period. The simulation results indicate that PF scheduling with the proposed update scheme can achieve similar performance as PF scheduling with full CQI feedback. The feedback overhead can be reduced in comparison with typical PF scheduling provided that an optimal CQI update period is chosen.     

Scheduling with accurate communication delay model and scheduler implementation for multiprocessor system-on-chip

In multiprocessor system-on-chip, tasks and communications should be scheduled carefully since their execution order affects the performance of the entire system. When we implement an MPSoC according to the scheduling result, we may find that the scheduling result is not correct or timing constraints are not met unless it takes into account the delays of MPSoC architecture. The unexpected scheduling results are mainly caused from inaccurate communication delays and or runtime scheduler’s overhead. Due to the big complexity of scheduling problem, most previous work neglects the inter-processor communication, or just assumes a fixed delay proportional to the communication volume, without taking into consideration subtle effects like the communication congestion and synchronization delay, which may change dynamically throughout tasks execution. In this paper, we propose an accurate scheduling model of hardware/software communication architecture to improve timing accuracy by taking into account the effects of dynamic software synchronization and detailed hardware resource constraints such as communication congestion and buffer sharing. We also propose a method for runtime scheduler implementation and consider its performance overhead in scheduling. In particular, we introduce efficient hardware and software scheduler architectures. Furthermore, we address the issue of centralized implementation versus distributed implementation of the schedulers. We investigate the pros and cons of the two different scheduler implementations. Through experiments with significant demonstration examples, we show the effectiveness of the proposed approach.     

Two-dimensional round-robin schedulers for packet switches withmultiple input queues

Presents a new scheduler, the two-dimensional round-robin (2DRR) scheduler, that provides high throughput and fair access in a packet switch that uses multiple input queues. We consider an architecture in which each input port maintains a separate queue for each output. In an N×N switch, our scheduler determines which of the queues in the total of N² input queues are served during each time slot. We demonstrate the fairness properties of the 2DRR scheduler and compare its performance with that of the input and output queueing configurations, showing that our scheme achieves the same saturation throughput as output queueing. The 2DRR scheduler can be implemented using simple logic components, thereby allowing a very high-speed implementation     

Earliest Deadline First Scheduling with Active Buffer Management for Real-Time Traffic in the Internet

We studied the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework was deployed to separate QoS metrics. Due to its desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling was adopted to provide the in-class scheduling for the time-sensitive traffic. We employed an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for real-time applications. Simulation results showed that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Served (FCFS) scheduling with the drop-tail buffer management which is commonly deployed in traditional IP routers.     

Credit-based slot allocation for multimedia mobile ad hoc networks

This paper studies resource management for multimedia mobile ad hoc networks (MANET). In particular, we focus on providing fair scheduling with quality-of-service (QoS) support for MANET. We consider two types of flows: guaranteed and best effort flows. The goal is to satisfy the QoS requirements of guaranteed flows and to provide global fairness for best effort flows. In this paper, a credit-based fair scheduling mechanism called credit-based slot allocation protocol (CSAP) is proposed. In CSAP, nodes are logically grouped into clusters, each with a scheduler. Each scheduler assigns time slots to nodes in its cluster based on the first tier algorithm. The node scheduled to send at the next time slot then in turn assigns the time slot to a relayed flow determined by the second-tier algorithm. Each multihop flow is treated as multiple single-hop flow segments. These segments are then correlated such that a downstream segment will not be allocated a slot unless the upstream segments have all been allocated. We evaluate the performance of CSAP by simulations. The results show that CSAP meets the QoS requirements of guaranteed flows, provides global fairness for best effort flows, and improves overall system throughput.     

基于TD-LTE系统的无线资源调度策略分析与实现

MAC层调度是TD-LTE系统最核心的部分,其目的是充分利用无线信道的时变特性,得到多用户的分集增益.针对不同系统容量与吞吐量的设计目标原则,调度策略按照轮询、最大载干比、比例公平3种方法实现.通过系统实现与实测表明,最大载干比算法以牺牲系统容量为代价在系统吞吐量上有明显增益;比例公平算法则很好地兼顾了系统容量与吞吐量,相比于最大载干比算法在容量上有显著提升.