Using multi-class queuing network to solve performance models of e-business sites

Due to e-business' s variety of customers with different navigational patterns and demands, multiclass queuing network is a natural performance model for it. The open multi-class queuing network(QN) models are based on the assumption that no service center is saturated as a result of the combined loads of all the classes. Several formulas are used to calculate performance measures, including throughput, residence time, queue length, response time and the average number of requests. The solution technique of closed multi-class QN models is an approximate mean value analysis algorithm (MVA) based on three key equations, because the exact algorithm needs huge time and space requirement. As mixed multi-class QN models, include some open and some closed classes, the open classes should be eliminated to create a closed multi-class QN so that the closed model algorithm can be applied. Some corresponding examples are given to show how to apply the algorithms mentioned in this article. These examples indicate that multi-class QN is a reasonably accurate model of e-business and can be solved efficiently.

Performance Analysis for Multimedia Communication Systems with a Multilayer Queuing Network Model

Software performance evaluation in multimedia communication systems is typically formulated into a multi-layered client-server queuing network(MLCSQN) problem. However, the existing analytical methods to MLCSQN model cannot provide satisfactory solution in terms of accuracy, convergence and consideration of interlocking effects. To this end, this paper proposes a heuristic solving method for MLCSQN model to boost the performance prediction of distributed multimedia software systems. The core concept of this method is referred to as the basic model, which can be further decomposed into two sub-models: client sub-model and server sub-model. The client sub-model calculates think time for server sub-model, and the server sub-model calculates waiting time for client sub-model. Using a breadthfirst traversal from leaf nodes to the root node and vice versa, the basic model is then adapted to MLCSQN, with net sub-models iteratively resolved. Similarly, the interlocking problem is effectively addressed with the help of the basic model. This analytical solver enjoys advantages of fast convergence, independence on specific average value analysis(MVA) methods and eliminating interlocking effects.Numerical experimental results on accuracy and computation efficiency verify its superiority over anchors.

Effect of quality uncertainty of parts on performance of reprocessing system in remanufacturing environment

Aimed at the problem of stochastic routings for reprocessing operations and highly variable processing times,an open queuing network is utilized to model a typical reprocessing system.In the model,each server is subject to breakdown and has a finite buffer capacity,while repair times,breakdown times and service time follow an exponential distribution.Based on the decomposition principle and the expansion methodology,an approximation analytical algorithm is proposed to calculate the mean reprocessing time,the throughput of each server and other parameters of the processing system.Then an approach to determining the quality of disassembled parts is suggested,on the basis of which the effect of parts quality on the performance of the reprocessing system is investigated.Numerical examples show that there is a negative correlation between quality of parts and their mean reprocessing time.Furthermore,marginal reprocessing time of the parts decrease with the drop in their quality.

An analytical method to calculate station evacuation capacity

The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

RESEARCH ON COMBINATION AND PLANNING OF PROCESSING UNITS UNDER CIMS CONDITION

A method of the rational combinging and planning of the given processing machines into units under the condition of computer integrated manufacturing systems is presented. Here the modelling method is a kind of queuing network model with the change of productivity, which has been checked in the reality and effectivencss by a manufacturing case in China

Malware-Propagative Mobile Ad Hoc Networks:Asymptotic Behavior Analysis

In this paper, the spreading of malicious software over ad hoc networks, where legitimate nodes are prone to propagate the infections they receive from either an attacker or their already infected neighbors, is analyzed. Considering the Susceptible-Infected-Susceptible （SIS） node infection paradigm we propose a probabilistic model, on the basis of the theory of closed queuing networks, that aims at describing the aggregated behavior of the system when attacked by malicious nodes. Because of its nature, the model is also able to deal more effectively with the stochastic behavior of attackers and the inherent probabilistic nature of the wireless environment. The proposed model is able to describe accurately the asymptotic behavior of malware-propagative large scale ad hoc networking environments. Using the Norton equivalent of the closed queuing network, we obtain analytical results for its steady state behavior, which in turn is used for identifying the critical parameters affecting the operation of the network. Finally, through modeling and simulation, some additional numerical results are obtained with respect to the behavior of the system when multiple attackers are present, and regarding the time-dependent evolution and impact of an attack.

SERIES QUEUING NETWORK SCHEDULING APPROACH TO CO-SCHEDULING MODEL OF THREE GORGES-GEZHOU DAM

This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam＇s actual needs, to maximize the total throughput of Three Gorges-Cezhou dam and the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under multiple constraints. This paper proposes a series queuing network （SQN） scheduling algorithm to divide the total ships that intend to pass through the shiplocks into four queues and calculate dynamically the weight of priority for each ship. The SQN scheduling algorithm schedules ships according to their priority weights which is determined by the characteristics of each ship, such as length, width, affiliation, waiting time, and so on. In the process, the operation conditions of Gezhou dam related to the navigable shiplocks and the task balancing among different shiplocks also should be considered. The SQN algorithm schedules ships circularly and optimizes the results step by step. Real operation data from our project shows that our SQN scheduling algorithm outperforms the traditional manual scheduling in which the less computational time is taken, the area utilization ratio of the five shiplocks is increased, the waiting time of high-prioritized ships is shorten, and a better balanced and alternating run-mode is provided for the three shiplocks in the Gezhou dam.

Analytical Results of Server Loads and Network Load in a General Client／Server System

A Macovo queuing network (MQN) based model of a general client/server system with multitype serversand with consideration of the transfer time of the computer network is proposed. The MQN was solved by analyzinga general open MQN with limited clients. In addition, the steady-state probability distribution theorem was proven.Thus, analytical load indices such as queue length at the servers and the server efficiency were obtained. Moreover,the sufficient and necessary conditions for server load balance were found. Finally, a client/server system was analyzed to illustrate the procedure for computing system load indices. The results are not only helpful for analyzing bottlenecks in the client/server system, but are also fundamental to static system configuration design.