Traffic-based queue-aware scheduling for 3GPP LTE system

Although the medium access control （MAC） signaling has been well-defined in the 3rd generation partnership project （3GPP） long term evolution （LTE） specifications, the scheduling algorithm crucial to guarantee QoS performance, still remains as open issues. In this article, a traffic-based queue-aware scheduling （TQS） algorithm is proposed for evolved nodeB＇s （eNB＇s） MAC scheduler in 3GPP LTE broadband wireless networks. The proposed TQS is divided into three sub-algorithms： firstly, the authors propose a traffic model construction （TMC） algorithm which can construct a discrete-time Markov-modulated Poisson process （dMMPP） to represent each flow. Secondly, a newly traffic state estimation （TSE） algorithm is designed to obtain the queue＇s analytical statistics. Thirdly, based on the derived results of TSE and the channel states, a scheduling action decision （SAD） algorithm is presented that can adaptively allocate bandwidth to flows by considering both queue states and spectrum efficiency. Simulation shows that the TMC and TSE algorithm can capture the fluctuation of traffic and queue accurately. Moreover, compared with a widely accepted traffic-based scheduling algorithm, the proposed TQS has better average queue length and overflow probability performance.     

Study of Test Flow Optimization Method in Radar Fault Isolation

In order to optimize test flow after the default flow is modified by a tester, a new software framework for the radar fault isolation is illustrated. This framework separates all mapping algorithms from test flows so as to modify flow and to insert mapping algorithm dynamically in testing process. Based on this framework, a kind of optimization method of test flow is proposed and studied. By defining an objective function, we can evaluate all candidate test flows so as to get an optimized flow. An example explains how to search the flow from candidate flows.     

Dynamic bandwidth allocation algorithm utilizing full band

A kind of Dynamic Full Bandwidth Utilized （DFBU） allocation algorithm is introduced. This algorithm allows a single link to use bandwidth far beyond its fair share bandwidth in a multi-service packet transporting system. Three important parameters as the bound on maximum and minimum bandwidth, the maximum packet delay and the minimum band width utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system to use all the spare bandwidth （up to full-bandwidth） while the performance of fairness and QoS requirement is still guaranteed.     

Robust Design of Virtual Topology for WDM Networks under Bandwidth Demand Uncertainties

In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing （WDM） networks under bandwidth demand uncertainties. And a bandwidth demand model under uncertainties is presented. The optimization goal of virtual topology design is defined as minimizing the maximum value amongp percentiles of the bandwidth demand distribution on all Hght-paths. Correspondingly, we propose a heuristic algorithm called an improved decreasing multi-hop logical topology design algorithm （ID-MLTDA） that involves with a degree of uncertainties to design virtual topology. The proposed algorithm yields better performance than previous algorithms. Additionally, the simplicity and efficiency of the proposed algorithm can be in favor of the feasibility for topology design of large networks.     

Layered MAP algorithm for MIMO ISI channels

The layered maximum a posteriori （L-MAP） algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output （MIMO） channels. Compared to the optimum MAP detector, the L-MAP algorithm can efficiently identify signal bits, and the complexity grows linearly with the number of input antennas. The basic idea of L-MAP is to operate on each input sub-stream with an optimum MAP sequential detector separately by assuming the other streams are Gaussian noise. The soft output can also be forwarded to outer channel decoder for iterative decoding. Simulation results show that the proposed method can converge with a small number of iterations under different channel conditions and outperforms other sub-optimum detectors for rank-deficient channels.     

采用动态带宽提高技术的用于无源超高频RFID标签的供电系统

This paper presents a voltage regulator system for passive UHF RFID transponders,which contains a rectifier,a limiter,and a regulator.The rectifier achieves power by rectifying the incoming RF energy.Due to the huge variation of the rectified voltage,a limiter at the rectifier output is used to clamp the rectified voltage.In this paper,the design of a limiter circuit is discussed in detail,which can provide a stable limiting voltage with low sensitivity to temperature variation and process dispersion.The key aspect of the voltage regulator system is the dynamic bandwidth boosting in the regulator.By sensing the excess current that is bypassed in the limiter during periods of excess energy,the bias current as well as the bandwidth of the regulator are increased,the output supply voltage can recover quickly from line transients during the periods of no RF energy to a full blast of RF energy.This voltage regulator system is implemented in a 0.18 μm CMOS process.     

Tree-based differential evolution algorithm for QoS multicast routing

Differential evolution(DE)algorithm has attracted more and more attention due to its fast optimization performance and good stability.When DE algorithm is applied into multi-constrained multicast routing optimization problem,a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node.This method maybe obtains the better result,but it can consume a lot of computational time.To solve the problem,a tree-based DE algorithm is introduced in this paper.The central operations of the algorithm are realized with tree structure.This method saves the time of finding paths and integrating them to construct a multicast tree.The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.     

测量大功率LDMOS晶体管特性的TRL校准方法研究

The impedance and output power measurements of LDMOS transistors are always a problem due to their low impedance and lead widths.An improved thru-reflect-line(TRL) calibration algorithm for measuring the characteristics of L-band high power LDMOS transistors is presented.According to the TRL algorithm,the individual two-port S parameters of each fixture half can be obtained.By de-embedding these S parameters of the test fixture,an accurate calibration can be made.The improved TRL calibration algorithm is successfully utilized to measure the characteristics of an L-band LDMOS transistor with a 90 mm gate width.The impedance of the transistor is obtained,and output power at 1 dB compression point can reach as much as 109.4 W at 1.2 GHz, achieving 1.2 W/mm power density.From the results,it is seen that the presented TRL calibration algorithm works well.     

A Virtual Network Mapping Algorithm Based on Time

As one of the challenges for network virtu- alization, virtual network embedding which maps Virtual network （VN） to the substrate network and allocates re- sources according to the requirements of VN in an efficient way has gained great attention. Existing algorithms gener- ally make their decision according to the present available substrate network resource, especially bandwidth. This paper proposes a time-based VN embedding algorithm. A probability model is formulated to obtain the maximum probability that the available resources of substrate net- work can be used by succeeding VN requests. The prob- ability is set as the weight of the node and the greedy algorithm is employed to embed the virtual node. The reciprocal of the probability is set as the weight of the link and the shortest path algorithm is employed to em- bed the virtual link. Simulation experiments show that the proposed algorithm increases the acceptance rate and the revenue compared to the existing algorithms.     

自适应SICKF及在目标跟踪中的应用

针对容积卡尔曼滤波（CKF) 估计精度在系统状态或参数突变时下降的问题,结合均方根嵌入式容积卡尔曼滤波(SICKF)和强跟踪滤波(STF)思想,提出了一种自适应SICKF(ASICKF)方法。在SICKF获得高估计精度的同时引入STF条件,根据系统输出残差获得自适应渐消因子,将其引入系统输出协方差均方根阵和互协方差阵中对滤波增益进行实时修正,强迫系统输出残差序列始终正交,从而使SICKF算法具备强跟踪能力。为验证所提ASICKF算法性能,利用数值仿真将其应用于存在突变情况的目标跟踪问题中。仿真结果表明,ASICKF在系统状态突变时仍能保持较高的估计精度,算法稳定性和适应能力较好。     

Measurement-Based Admission Control at Edge Routers

It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data traffic is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, admission decision is made for each flow at the edge (ingress) routers, but it is scalable because per-flow states are not maintained and the admission algorithm is simple. In the proposed admission control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a threshold for admission control, and thus, it is very important to accurately estimate the admissible bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.     

区分服务中AF类的一种调度算法

该文根据区分服务中确保转发(Assured Forwarding,AF)类的特点,设计了一种新的调度算法公平加权轮循(Fair、Weighted Round Robin,FWRR)算法。 FWRR是一种基于轮循、工作保持型、适于变长分组的调度算法.它的实现简单,算法复杂度为O(1).仿真实验和数学分析表明,FWRR算法不仅能够提供保证最小带宽的服务,而且能够按比例分配剩余带宽,适合用来调度区分服务中的AF类.     

无线IP网络中DRSVP的一种业务流拒绝机制

针对无线网络可用带宽范围不断变化的特定,DRSV采用随机拒绝业务流的方式来保证其服务质量。针对DRSVP这种随机拒绝业务流方式的缺陷,提出一种新的业务流拒绝机制。阐述了该机制的具体实现,并且经过数值分析和仿真计算,证明该机制的可行性。该机制能够保护高优先级的业务流,减少被拒绝的业务流的数目,并在一定程度上改善信道的带宽利用率。     

Distributed fair scheduling in a wireless LAN

Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows sharing the channel. This paper presents a fully distributed algorithm for fair scheduling in a wireless LAN. The algorithm can be implemented without using a centralized coordinator to arbitrate medium access. The proposed protocol is derived from the Distributed Coordination Function in the IEEE 802.11 standard. Simulation results show that the proposed algorithm is able to schedule transmissions such that the bandwidth allocated to different flows is proportional to their weights. An attractive feature of the proposed approach is that it can be implemented with simple modifications to the IEEE 802.11 standard.     

一种基于RED分组丢弃历史的带宽均衡分配算法

针对目前Internet中的响应流和非响应流带宽分配不均衡的问题,该文提出了一种基于RED分组丢弃历史的算法,该算法可以发现高速率的数据流并对其到达分组按概率作优先丢弃,以避免这些流对带宽的过度占用,多个仿真实验从不同的角度验证了该算法的有效性。     

Deficit round-robin scheduling for input-queued switches

We address the problem of fair scheduling of packets in Internet routers with input-queued switches. The goal is to ensure that packets of different flows leave a router in proportion to their reservations under heavy traffic. First, we examine the problem when fair queuing is applied only at output link of a router, and verify that this approach is ineffective. Second, we propose a flow-based iterative deficit-round-robin (iDRR) fair scheduling algorithm for the crossbar switch that supports fair bandwidth distribution among flows, and achieves asymptotically 100% throughput under uniform traffic. Since the flow-based algorithm is hard to implement in hardware, we finally propose a port-based version of iDRR (called iPDRR) and describe its hardware implementation.     

On Throughput Guarantee of Aloha-Like Multi-Hop Wireless Networks

Providing Quality of Service (QoS) is one of significant issues for multimedia traffic. One approach to achieve the requested QoS is to characterize the traffic flows and guarantee their committed throughput. In a typical multi-hop wireless ad hoc network, determining the feasibility for a given set of flow characteristics is challenging due to the multi-user interference problem. To that end, this paper presents the following contributions. First, we describe a simple Aloha-like Medium Access Control (MAC) protocol that enables each flow to maintain its requested bandwidth, and thus is suitable for multimedia traffic. Second, we propose a bandwidth feasibility algorithm based on the Variable Elimination (VE) technique. The bandwidth feasibility algorithm determines whether or not a given network can support a set of flows of certain bit rates. Simulations indicate that our solution can precisely control the bit rates over all hosts while providing the throughput guarantees.     

Entropy Based Adaptive Flow Aggregation

Internet traffic flow measurement is vitally important for network management, accounting and performance studies. Cisco's NetFlow is a widely deployed flow measurement solution that uses a configurable static sampling rate to control processor and memory usage on the router and the amount of reporting flow records generated. But during flooding attacks the memory and network bandwidth consumed by flow records can increase beyond what is available. Currently available countermeasures have their own problems: 1) reject new flows when the cache is full - some legitimate new flows will not be counted; 2) export not-terminated flows to make room for new ones - this will exhaust the export bandwidth; and 3) adapt the sampling rate to traffic rate - this will reduce the overall accuracy of accounting, including legitimate flows. In this paper, we propose an entropy based adaptive flow aggregation algorithm. Relying on information-theoretic techniques, the algorithm efficiently identifies the clusters of attack flows in real time and aggregates those large number of short attack flows into a few metaflows. Compared to currently available solutions, our solution not only alleviates the problem in memory and export bandwidth, but also significantly improves the accuracy of legitimate flows. Finally, we evaluate our system using both synthetic trace file and real trace files from the Internet.     

A stateless fairness-driven active queue management scheme for efficient and fair bandwidth allocation in congested Internet routers

Fair bandwidth sharing is important for the Internet architecture to be more accommodative of the heterogeneity. The Internet relies primarily on the end-systems to cooperatively deploy congestion control mechanisms for achieving high network utilization and some degree of fairness among flows. However, the cooperative behavior may be abandoned by some end-systems that act selfishly to be more competitive through bandwidth abuse. The result can be severe unfairness and even congestion collapse. Fairness-driven active queue management, thus, becomes essential for allocating the shared bottleneck bandwidth fairly among competing flows. This paper proposes a novel stateless active queue management algorithm, termed CHOKeH, to enforce fairness in bottleneck routers. CHOKeH splits the queue into dynamic regions at each packet arrival and treats each region differently for performing matched-drops using a dynamically updated drawing factor, which is based on the level of queue occupancy and the buffer size. In this way, CHOKeH can effectively identify and restrict unfair flows from dominating the bandwidth by discarding more packets from these flows. The performance of CHOKeH is studied through extensive simulations. The results demonstrate that CHOKeH is well suited for fair bandwidth allocation even in the presence of multiple unresponsive flows and across a wider range of buffer sizes. The results also show the ability of CHOKeH to provide inter-protocol and intra-protocols fairness and protection for short-lived flows. With a low per-packet-processing complexity, CHOKeH is amenable to implementation in core routers to offer an effective incentive structure for end-systems to self-impose some form of congestion control.