Design and Implementation of an Adaptive Feedback Queue Algorithm over Open Flow Networks

The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Recently, several proposals for fulfilling the quality of service(QoS) guarantees have been presented. However, they can only support coarse-grained QoS with no guarantee of throughput, jitter, delay or loss rate for different applications. To address these more challenging problems, an adaptive scheduling algorithm for Parallel data Processing with Multiple Feedback(PPMF) queues based on software defined networks(SDN) is proposed in this paper, which can guarantee the quality of service of high priority traffic in multimedia applications. PPMF combines the queue bandwidth feedback mechanism to realise the automatic adjustment of the queue bandwidth according to the priority of the packet and network conditions, which can effectively solve the problem of network congestion that has been experienced by some queues for a long time. Experimental results show PPMF significantly outperforms other existing scheduling approaches in achieving 35--80% improvement on average time delay by adjusting the bandwidth adaptively, thus ensuring the transmission quality of the specified traffic and avoiding effectively network congestion.

AN M/G/1 RETRIAL QUEUE WITH SECOND MULTI-OPTIONAL SERVICE,FEEDBACK AND UNRELIABLE SERVER

An M/G/1 retrial queue with two-phase service and feedback is studied in this paper, where the server is subject to starting failures and breakdowns during service. Primary customers get in the system according to a Poisson process, and they will receive service immediately if the server is available upon arrival. Otherwise, they will enter a retrial orbit and are queued in the orbit in accordance with a first-come-first-served （FCFS） discipline. Customers are allowed to balk and renege at particular times. All customers demand the first “essential” service, whereas only some of them demand the second “multi-optional” service. It is assumed that the retrial time, service time and repair time of the server are all arbitrarily distributed. The necessary and sufficient condition for the system stability is derived. Using a supplementary variable method, the steady-state solutions for some queueing and reliability measures of the system are obtained.

Effects of pooling,specialization,and discretionary task completion on queueing performance

Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.

A Maintenance Service Improvement Approach Based on Queue Networks: Application

The quest to increase the performance of production systems that have become complex leads to the transfer to the maintenance function of the responsibility of guaranteeing the availability of such systems. Also, we will never stop saying that maintenance must integrate into all of the company’s initiatives, to affirm its role, which is to ensure greater availability and sustainability of the means of production. The objective of this paper is to evaluate the reliability and availability of a system without knowing the distribution law of the operating times. Among the methods for evaluating dependability criteria (Fault Trees, Petri Nets, etc.), we are interested in queues that have the advantage of taking into account functional dependencies, thus allowing a quantified optimization of maintenance. Indeed, queues make it possible to model parallel or sequential processes, implementing operations taking place at the same time or one after the other, meeting the needs of modeling production systems. The main result of this paper is the study of the influence of availability on the reliability of a multi-state production system.

LabVIEW中Queue技术在发电机监测系统中的应用

介绍了基于虚拟仪器的在线监测系统的基本组成,其采用PCI总线仪器和LabVIEW可视化的虚拟仪器系统开发平台,把传统仪器的所有功能模块集成在一台计算机中,用户可以通过修改虚拟仪器的软件改变其功能与规模。该系统有效地利用了LabVIEW提供的同步控制Queue技术实现了发电机在现场运行环境下运行状态的监测显示,体现出了其一定的优势。

基于Message Queue技术的医疗信息交换与共享集成平台研究

对目前医院信息系统集成方式进行了分析,简单介绍了IBM Message Queue的技术特点,通过介绍重症监护系统(ICU系统)和HIS系统之间的集成方案,阐述了基于消息机制构建医疗信息交换与共享集成平台的思路和方法。

基于IP Queue的实时网页过滤系统的设计与实现

在分析了IP Queue机制的实现技术、HTTP请求报文和响应报文,以及IP数据包的相关特征的基础上,实现了基于IP地址、URL的请求报文过滤以及基于关键词的响应报文过滤的实时网页过滤系统。该系统同时运行于一个具体的网关计费系统,提高了网关的监控能力,为增强同类产品的网络安全尤其是在用户态防火墙和网关监控等方面提供了有益的参考。

THE TRANSIENT SOLUTION FOR M/G/1 QUEUEWITH SERVER VACATIONS

In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.

Tele-Network Design Based on Queue Competition Algorithm

In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.

基于Netfilter框架和IP Queue机制的轻量级网络防火墙实现

一般而言,要在Linux下开发防火墙的程序,需要对内核协议栈有深入的理解,并掌握内核协议栈代码的细节。这对普通开发者是非常有难度的。Netfilter是一个支持数据报过滤、数据报处理、NAT等功能的内核子系统框架。以Linux 2.6内核为基础。IP Queue机制是Linux内核在Netfilter框架的基础上提供的,是应用层上的机制,通过NetLink和内核进行交互,这使得开发一些用户态的防火墙应用成为可能。在此基础上,同时实现了一种基于Netfilter框架和IP Queue机制的轻量级防火墙。通过对比测试表明,由于设计清晰的模块架构、较强的可扩展性,本文实现的轻量级防火墙能够很好地达到实际要求,容易开发出更专业防火墙程序。

A FUZZY-LOGIC CONTROL ALGORITHM FOR ACTIVE QUEUE MANAGEMENT IN IP NETWORKS

Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its average queue length is closely related to the load level. This paper proposes an effective fuzzy congestion control algorithm based on fuzzy logic which uses the pre- dominance of fuzzy logic to deal with uncertain events. The main advantage of this new congestion control algorithm is that it discards the packet dropping mechanism of RED, and calculates packet loss according to a preconfigured fuzzy logic by using the queue length and the buffer usage ratio. Theo- retical analysis and Network Simulator (NS) simulation results show that the proposed algorithm achieves more throughput and more stable queue length than traditional schemes. It really improves a router's ability in network congestion control in IP network.

Cycle-by-Cycle Queue Length Estimation for Signalized Intersections Using Multi-Source Data

In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is presented for estimating vehicular queue length using data from both point detectors and probe vehicles. The methodology applies the shockwave theory to model queue evolution over time and space. Using probe vehicle locations and times as well as point detector measured traffic states,analytical formulations for calculating the maximum and minimum( residual) queue length are developed. The proposed methodology is verified using ground truth data collected from numerical experiments conducted in Shanghai,China. It is found that the methodology has a mean absolute percentage error of 17. 09%,which is reasonably effective in estimating the queue length at traffic signalized intersections. Limitations of the proposed models and algorithms are also discussed in the paper.

TRANSIENT SOLUTION FOR QUEUE-LENGTH DISTRIBUTION OF Geometry/G/1 QUEUEING MODEL

In this paper, the Geometry/G/1 queueing model with inter-arrival times generated by a geometric（parameter p） distribution according to a late arrival system with delayed access and service times independently distributed with distribution {gj }, j≥ 1 is studied. By a simple method （techniques of probability decomposition, renewal process theory） that is different from the techniques used by Hunter（1983）, the transient property of the queue with initial state i（i ≥ 0） is discussed. The recursion expression for u -transform of transient queue-length distribution at any time point n^＋ is obtained, and the recursion expression of the limiting queue length distribution is also obtained.

A NEW AND DIRECT METHOD OF ANALYSIS THE DEPARTURE PROCESSES OF SINGLE SERVER QUEUEING SYSTEMS

In this paper, using the stochastic decomposition and renewal theory we provide the direct method for analysis the departure process of single sever M/G/1 queueing system, and further discuss the departure process of GI/G/1 queueing system. The method provided in this paper is new and concise, which make us see dearly the structure of the departure process of a single server queueing system.

The queueing model for quantum key distribution network

This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.

Another Fast and Simple DEM Depression-Filling Algorithm Based on Priority Queue Structure

Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planchon and Darboux works very quickly compared to other published methods.Despite its simplicity and deli-cacy,this algorithm remains difficult to understand due to its three complex subroutines and its recursive execution.Another fast algorithm is presented in this article.The main idea of this new algorithm is as follows:first,the DEM dataset is viewed as an island and the outer space as an ocean;when the ocean level increases,the DEM cells on the island's boundary will be inundated;when a cell is inundated for the first time,its elevation is increased to the ocean level at that moment;after the ocean has inun-dated the entire DEM,all of the depressions are filled.The depression-removing processing is performed using a priority queue.Theoretically,this new algorithm is a fast algorithm despite the fact that it runs more slowly than Planchon and Darboux's method.Its time-complexity in both the worst case and in an average case is O(8nlog 2 (m)),which is close to O(n).The running speed of this algorithm depends mainly on the insertion operation of the priority queue.As shown by the tests,the depres-sion-filling effects of this algorithm are correct and valid,and the overall time consumption of this algorithm is less than twice the time consumed by Planchon & Darboux's method for handling a DEM smaller than 2500×2500 cells.More importantly,this new algorithm is simpler and easier to understand than Planchon and Darboux's method This advantage allows the correct program code to be written quickly.

THE QUEUE-LENGTH DISTRIBUTION FOR M^x/G/1 QUEUE WITH SINGLE SERVER VACATION

This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient queue-length distribution is derived. Furthermore, the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are obtained. Especially some results for the single-arrival M/G/1 queue with single server vacation and bulk-arrival M-x/G/1 queue but with no server vacation can be derived directly by the results obtained in this paper.

FUNCTIONAL ANALYSIS METHOD FOR THE M/G/1 QUEUEING MODEL WITH OPTIONAL SECOND SERVICE

By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.

Active Queue Management Exploiting the Rate Information in TCP-IP Networks

In this paper, we propose a new mechanism called explicit rate notification(ERN) to be used in end-to-end communications. The ERN scheme encodes in the header of transmission control protocol(TCP) packets information about the sending rate and the round trip time(RTT) of the flows. This new available information to the intermediate nodes(routers) is used to improve fairness, increase utilization, decrease the number of drops, and minimize queueing delays. Thus, it induces a better management of the queue. A comparison of our scheme with preexistent schemes, like the explicit congestion notification scheme, shows the effectiveness of the proposed mechanism.

High Throughput Scheduling Algorithms for Input Queued Packet Switches

The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.