基于流水线的优先级队列排序的VLSI实现

优先级队列排序是众多队列调度算法硬件实现的主要瓶颈。文章提出了一种基于流水线的优先级队列的硬件快速排序结构。该结构具有O（1）的时间复杂度，支持上万个优先级队列，满足OC-192甚至更高网络传输速率的要求。     

Priority Scheduling in Wireless Ad Hoc Networks

Ad hoc networks formed without the aid of any established infrastructure are typically multi-hop networks. Location dependent contention and hidden terminal problem make priority scheduling in multi-hop networks significantly different from that in wireless LANs. Most of the prior work related to priority scheduling addresses issues in wireless LANs. In this paper, priority scheduling in multi-hop networks is discussed. We propose a scheme using two narrow-band busy tone signals to ensure medium access for high priority source stations. The simulation results demonstrate the effectiveness of the proposed scheme. Xue Yang received the B.E. degree and the M.S. degree from University of Electronic Science and Technology of China. She is currently a Ph.D. candidate at University of Illinois at Urbana-Champaign (UIUC). She is awarded Vodafone-U.S. Foundation Graduate Fellowship from 2003 to 2005. Her current research is in the areas of wireless networking and mobile computing, with the focus on medium access control, quality of service and topology control. Her research advisor is Prof. Nitin Vaidya at UIUC. For more information, please visit Nitin H. Vaidya received the PhD degree from the University of Massachusetts at Amherst. He is presently an Associate Professor of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign (UIUC). He has held visiting positions at Microsoft Research, Sun Microsystems and the Indian Institute of Technology-Bombay. His current research is in the areas of wireless networking and mobile computing. His research has been funded by various agencies, including the National Science Foundation, DARPA, BBN Technologies, Microsoft Research, and Sun Microsystems. Nitin Vaidya is a recipient of a CAREER award from the National Science Foundation. Nitin has served on the program committees of several conferences and workshops, and served as program co-chair for the 2003 ACM MobiCom. He has served as editor for several journals, and presently serves as Editor-in-Chief for IEEE Transactions on Mobile Computing, and as editor-in-chief of ACM SIGMOBILE periodical MC2R. He is a senior member of IEEE and a member of the ACM. For more information, please visit     

一种基于优先级队列的集群动态反馈调度算法

在分析现有面向LVS集群的负载均衡调度算法优缺点的基础上,提出了一种新的调度算法—基于优先级队列的动态反馈调度算法。该算法根据定期采集到的各服务器负载信息动态地调整各服务器的权值,并根据权值建立优先级调度队列借以实现连接的调度。算法可保证良好的负载均衡性,且时间复杂度降低至O(1)。     

基于QoS的优先级队列调度算法

针对无线网络QoS的需求,讨论了3种典型的优先级队列调度算法,即:轮询式的调度算法、保证优先级的调度算法以及比例公平的调度算法。分别对它们各自的工作原理和优缺点进行了研究比较。最后通过计算机仿真验证选取了适合实际使用的算法。     

Enhanced Active Queue Management for Multi-hop Networks

Wireless networks play a very important role in today’s modern world, convincingly surpassing the wired infrastructure in terms of popularity. Hence, it is important to ensure that services which access wired networks should also be accessible using a wireless network without any performance degradation. One of the most common variants in wireless communications is the Wireless Mesh Network (WMNs). WMNs exploit multi-hop wireless communications between wireless access points. Hence, the effective bandwidth decreases as the number of hops increases in a WMN, thus increasing latency and resulting in reduced performance. This may be due to spatial contention, multipath fading, interference or inefficient queuing mechanisms etc. Here we take queuing mechanisms into consideration and study the QMMN algorithm (Queue Management for Multi-hop Networks) which tends to improve throughput, fairness and reduce global synchronization problems. Based on our study, we implement a modified version of the QMMN algorithm, otherwise called the Enhanced QMMN (EQMMN) algorithm. EQMMN can be considered an effective algorithm which solves the problem of fairness between flows (either responsive or unresponsive) and eventually improves TCP throughput at wireless access points. Our experimental results prove that EQMMN algorithms have better performance characteristics such as throughput (TCP) and fairness index compared to QMMN algorithms.     

Contour-Based Priority Scheduling in Optical Burst Switched Networks

Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over dense wavelength division multiplexing links. Although several quality-of-service (QoS) schemes have been proposed for OBS networks, how to provide QoS at the high speed required by the OBS network is still an open question. In this paper, we propose a novel O(1) runtime contour-based priority algorithm that provides complete priority isolation among different priorities. This is the first practical O(1) runtime priority algorithm proposed for OBS, and it is well suited to high-speed hardware implementation.     

基于负载自适应的无线自组网视频传输队列调度算法

移动终端多媒体业务的发展目前已经成为终端发展的必然趋势.如何在移动终端构成Ad hoc网络时有效地进行视频传输是无线网络研究的热点之一.提出了一种基于负载状况的跨层优化方案,其基本思想是结合应用层视频编码的特点和接入层的网络负载和资源的情况联合进行优化.在特定的资源下通过概率接入的方法对重要性更高的数据包进行更优先的接入.仿真结果显示,在网络处于高负载、多跳传输等场景下,提出的方案视频传输质量PSNR值提升3 dB以上.相对于传统调度算法,系统时延也可以大幅度降低.     

一种新的语音流队列管理调度机制

本文提出一种新的语音流队列管理调度机制,结合随机早期探测(RED)和主动丢包调度算法实现因特网语音流的队列管理和调度.采用仿真方法分析了新机制的性能特征,并与RED做了性能对比.当网络拥塞时,该算法可有效改善包转发的性能.语音质量测试表明新机制是可行的和有效的.     

无线Mesh网络中的自适应队列调度算法研究

针对无线mesh网络的网络特性,分析了无线网络中的队列调度算法,提出了一种自适应的队列调度算法AQSM,详细讨论了该算法的具体实现过程及参数变化规则,通过仿真验证了该算法在提高网络性能的同时还可以实现对不同业务流的业务区分。     

Active Queue Management for Fair Resource Allocation in Wireless Networks

This paper investigates the interaction between end-to-end flow control and medium access control (MAC)-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading and a scheduler allocates the channel based on channel quality but is subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport-layer flow control of transmission control protocol (TCP) New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users.     

Distributed Priority Scheduling and Medium Access in Ad Hoc Networks

Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms for QoS communication in multi-hop wireless networks. First, we devise distributed priority scheduling, a technique that piggybacks the priority tag of a node's head-of-line packet onto handshake and data packets; e.g., RTS/DATA packets in IEEE 802.11. By monitoring transmitted packets, each node maintains a scheduling table which is used to assess the node's priority level relative to other nodes. We then incorporate this scheduling table into existing IEEE 802.11 priority backoff schemes to approximate the idealized schedule. Second, we observe that congestion, link errors, and the random nature of medium access prohibit an exact realization of the ideal schedule. Consequently, we devise a scheduling scheme termed multi-hop coordination so that downstream nodes can increase a packet's relative priority to make up for excessive delays incurred upstream. We next develop a simple analytical model to quantitatively explore these two mechanisms. In the former case, we study the impact of the probability of overhearing another packet's priority index on the scheme's ability to achieve the ideal schedule. In the latter case, we explore the role of multi-hop coordination in increasing the probability that a packet satisfies its end-to-end QoS target. Finally, we perform a set of ns-2 simulations to study the scheme's performance under more realistic conditions.     

流量管理中队列调度算法研究

介绍了包交换芯片流量管理中队列调度的算法,分析DWRR(Deficit Weighted Round-Robin)算法的优缺点,并提出了一种基于DWRR改进的调度算法.该算法能够根据网络中实时的数据包帧长,来调节每次轮询中向各个队列添加的信用度,能够减少各个队列的时延,同时又增强带宽分配的相对公平性,改善了DWRR算法不能很好满足业务的时延特性.使用NS-2仿真器来对改进的算法进行网络仿真,最终的仿真结果表明改进后的DWRR算法能够有效地降低时延,可以在一定程度上提高QoS.     

Burstification Queue Management in Optical Burst Switching Networks

Among the various issues lying in optical burst switching (OBS) networks, burstification, i.e., assembling multiple IP packets into bursts, is an important one. Between the two important aspects related to burst assembly, the burst assembly algorithm aspect has been extensively studied in the literature. However, as far as we know, there is no research about the burstification queue management (BQM) aspect, which refers to how many burstification queues (BQ) we should set at each OBS edge node and how to manage these BQs. Suppose there are G destinations (egress edge nodes) and the OBS network provides S different quality of service (QoS) classes. Traditionally, it is simply regarded that each ingress edge node needs G· S queues to sort incoming packets, one for each possible destination and QoS class. For simplicity, we call this policy the static dedicate BQM (SDB) policy. The SDB policy, though simple, lacks scalability since we have to add S BQs at each OBS edge node if an extra OBS edge node is added to the OBS network. To solve this problem, we propose in this paper two BQM policies: quasi-static BQM (QSB) policy and dynamic BQM (DB) policy. For the QSB policy, we derive the packet loss probability due to lacking BQs based on a Markov chain, from which we can work out the employed number of BQs for a given packet loss probability. Based on these results, the scalability of the QSB policy is also studied. With the DB policy, we not only can dynamically assign BQs for incoming packets, but also can dynamically allocate buffer capacity for each BQ by using a least-mean-square (LMS)-based linear prediction filter. The performance of the DB policy is investigated by analysis and extensive simulations. We also compared the performance of the QSB policy and the DB policy. Results from analysis and simulation demonstrate that the DB policy is the best.     

无线环境下具有实时约束的主动队列管理机制

实时流业务的超期丢包率是衡量无线网络传输过程服务质量的常用参数,但是该参数并不能反映出具有不同重要度的数据包对视频质量的影响。该文将实时传输流的数据包重要度与超期丢包率结合,提出加权超期丢包率的概念,更加准确地描述丢包与视频质量的关系,在无线环境下提出基于数据包不同重要度的适用于实时约束流的主动队列管理算法,通过主动丢弃数据包以最小化服务过程中实时流的加权超期丢包率。仿真结果表明,相比于传统的队列管理算法和实时视频流滤波器算法,该超期数据包主动丢弃算法能够有效降低加权超期丢包率,提供更好的服务质量,提高大约0.5~1.5 dB的峰值信噪比(PSNR)增益。     

分组交换网络中队列调度算法的研究及其展望

本文主要讨论分组交换网络中的队列调度算法,对现有的调度算法进行了分类和比较研究,分析了其性能指标和技术特点,最后结合我们的相关研究工作讨论了未来的发展趋势并给出了有待研究的一些课题.     

PRED:一种具有优先级自适应的队列管理新算法

现有的拥塞控制采用以TCP为核心的基于窗口技术的端到端控制,具有丢包、响应速度慢等缺陷.本文提出的基于优先级的队列管理算法(PRED),使路由器更加精确地管理队列,算法的主要参数能够适应网络负载的动态变化,有效地克服了现有拥塞控制的缺陷.实验结果表明,在相同的配置下,采用PRED的网络在降低丢包率、减少队列抖动等性能上均优于端到端拥塞控制.     

Range-Based Sleep Scheduling (RBSS) for Wireless Sensor Networks

Sleep scheduling in a wireless sensor network is the process of deciding which nodes are eligible to sleep (enter power-saving mode) after random deployment to conserve energy while retaining network coverage. Most existing approaches toward this problem require sensor’s location information, which may be impractical considering costly locating overheads. This paper proposes range-based sleep scheduling (RBSS) protocol which needs sensor-to-sensor distance but no location information. RBSS attempts to approach an optimal sensor selection pattern that demands the fewest working (awake) sensors. Simulation results indicate that RBSS is comparable to its location-based counterpart in terms of coverage quality and the reduction of working sensors.

Priority Aware and Spectrum Efficient Scheduling of Co-existing Wireless Body Area Networks

Real-time continuous and remote health monitoring has become widespread due to the developments in Wireless body area networks (WBANs). Based on the criticality of health data to be transmitted, regular healthcare data and critical emergency health data must be provided differential service. In this paper, we consider the beyond WBAN communication in a system comprising multiple WBANs with different quality of service (QoS) requirements and multiple access points (APs), and propose two hybrid approaches for resource allocation. In the first approach, the AP association to the WBANs and channel allocation to the APs are done jointly and is modelled as an optimization problem, which is computationally complex and it also requires global network information. In order to reduce the involvement of APs in making decisions for resource allocations of WBANs, the problem is reformulated as a Stackelberg game with price update, which guarantees QoS of the critical users. A learning based algorithm, namely distributed learning for Pareto optimality, is used by the normal users, in this second approach. The performance of both the proposed approaches are evaluated and compared, in terms of the throughput of the critical and normal users as well as the QoS guarantee of the critical users.

     

Advanced Wavelength Reservation Method Based on Deadline-Aware Scheduling for Lambda Grid Networks

A deadline-aware-scheduling scheme for the lambda grid system is proposed to support a huge computer grid system based on an advanced photonic network technology. The assignment of wavelengths to jobs in order to efficiently carry various services is critical in lambda grid networks. Such services have different requirements such as the job-completion deadlines, and wavelength assignment must consider the job deadlines. The conventional job scheduling approach assigns a lot of time slots to a call within a short period in order to finish the job as quickly as possible. This raises the blocking probability of short deadline calls. Our proposal assigns wavelengths in the lambda grid networks to meet quality-of-services guarantees. The proposed scheme assigns time slots to a call over time according to its deadline, which allows it to increase the system performance in handling short deadline calls, for example, lowering their blocking probability. Computer simulations show that the proposed scheme can reduce the blocking probability by a factor of 100 compared with the conventional scheme under the low load condition in which the ratio of long deadline calls is high. The proposed scheduling scheme can realize more efficient lambda grid networks.     

Design of Active Queue Management System for Scalable TCP in High Speed Networks

The Scalable Transmission Control Protocol (TCP), based on a multiplicative increase, multiplicative decrease congestion avoidance algorithm, has been proposed recently to overcome the inability of Standard TCP to utilize the full bandwidth in high speed networks. This paper employs a novel approach to derive a transfer-function model of Scalable TCP that is then employed in a control-theoretic design of random early detection (RED)-based active queue management (AQM) for such a network. Robust stability of the proposed scheme is established under prescribed conditions, and the design is validated by discrete-event simulations using the ns2 tool. This work was supported by a Gledden Visiting Senior Fellowship for the first author.