基于马尔可夫网络排队模型的电梯配置

利用马尔可夫网络排队理论建立了电梯交通模型,在此基础上对电梯配置进行分析研究,并开发了电梯配置软件进行仿真计算。利用此软件用户可以根据配置的结果调整电梯配置参数,进而得到符合要求的配置结果,并通过举例说明电梯配置参数的具体计算过程。通过电梯的配置也验证了利用马尔可夫排队论进行建模的有效性和可行性。

基于马尔可夫网络排队论的电梯交通建模及应用

为优化电梯配置,分析了电梯交通流.利用马尔可夫网络排队论对电梯交通流建模,并求解该模型,然后将求解结果应用到电梯配置中,通过实例与传统的电梯配置作比较.根据两种配置结果,分别求得并分析了相应的性能指标.结果表明,基于新模型的电梯配置可有效降低乘客平均候梯时间和电梯平均载荷,从而证明了利用马尔可夫网络排队论建立电梯交通模型的可行性和优越性.

云平台在海岸指挥港口建设中的模型研究

在经济全球化程度不断深入的背景下,港口己经不再是孤立的物流节点,逐渐成为物流中的重要环节。在海岸指挥港口建设过程中,港口除了注重自身的需求和发展,同时也要考虑港口间的协调和互动,为此引入了基于云平台的港口建设模型。本文对网络排队的数学模型进行深入研究,提出一种基于云平台的多港口联动船舶排队算法。

Bottleneck Analysis for Data Acquisition in High-Speed Network Traffic Monitoring

The increasing network throughput challenges the current network traffic monitor systems to have compatible high-performance data processing.The design of packet processing systems is guided by the requirements of high packet processing throughput.In this paper,we depict an in-depth research on the related techniques and an implementation of a high-performance data acquisition mechanism.Through the bottleneck analysis with the aid of queuing network model,several performance optimising methods,such as service rate increasing,queue removing and model simplification,are integrated.The experiment results indicate that this approach is capable of reducing the CPU utilization ratio while improving the efficiency of data acquisition in high-speed networks.

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.

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.

Distributed fair queuing algorithm based on compensation coordination scheduling in WMN

This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods： the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness.

The Efect of Queueing Strategy on Network Trafc

In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based （DIB） queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out （FIFO） queueing strategy, DIB can effectively bMance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems.

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.