综合业务数字网信令系统的性能分析

对于综合业务数字网(ISDN)信令系统的性能分析仍是尚待解决的问题。本文给出ISDN信令系统的排队网模型和近似地分析其性能的方法。借助于GPSS模拟,表明这种方法的计算结果是相当精确的。

综合业务数字网信令系统的性能分析

给出一种ISDN信令系统的排队网模型和近似分析其性能的新的数值计算方法 ,借助于GPSS模拟 ,计算结果相当精确。这种性能分析的数学方法不仅适用于分组交换网 ,也可扩展用来分析电路交换网 ,具有实际应用价值。

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.

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.

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.

Performance Analysis of Integrative QoS Scheme for Routers

This paper proposes an integrative scheme of DiffServ （differentiated service） for the IP-based network. In the scheme, QoS （Quality of Service） is ranked according to the level of both the queuing delay and the drop precedence that base on the relative differentiated service; it does not take the resource reservation problem into consideration for making its implementation more simple and flexible. We will propose an implemented architecture including edge routers and core routers, and the PHB （per-hop-behavior） architecture of the routers is generalized. We adopt ERED （extended random early discard） mechanism for drop precedence and use proportional delay differentiation for queuing delay. In the proportional delay differentiation topic, we propose a new WTP （waiting time priority）-like algorithm. Besides, a new stochastic petri net model of the PHB model is given, and the performance of whole implemented PHB architecture is analyzed, too.

基于LQN模型的租户兴趣浏览路径挖掘

面向云计算环境中多租户应用的租户个性化服务需求,从多租户应用日志记录挖掘出租户兴趣浏览路径受到关注。针对传统的以浏览频度为主体的网络拓扑图研究问题,为了更好地找出租户在云平台网站上的兴趣网页,挖掘租户的兴趣浏览路径,综合租户对网页的浏览时长、接收字节数和浏览频度等多个要素定义租户兴趣度,构造租户执行图,纠正路径交叉状况以消除租户执行图中存在的多余路径,对循环路径中的对等节点进行整合以消除循环嵌套,给出了一种基于分层排队网(layered queue network,LQN)模型的租户兴趣浏览路径挖掘方法,在此基础上,借助广度优先遍历(breadth first search,BFS)算法进行挖掘。实验证明,改造后的LQN模型在租户兴趣浏览路径挖掘方面的效率有所提高。

TRANSIENT QUEUE SIZE DISTRIBUTION SOLUTION OF GEOM/G/1 QUEUE WITH FEEDBACK-A RECURSIVE METHOD

This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from the initial state N（0＋） = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n＋ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n-, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered （being different from the relations given in M/G/I queueing system）. The model discussed in this paper can be widely applied in all kinds of communications and computer network.

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.

Stability of Kumar-Seidman Networks Under Longest Queue First Policy

This paper is concerned with the stability of multiclass queueing networks of 2 stations and4 buffers under the longest queue first served discipline(LQFS).For this network,the service priority of a customer is determined by the length of the queue that customer resides in at that time.The main result includes two parts.Firstly,the corresponding fluid model is established,and then it is shown that the queueing networks under LQFS are stable whenever the traffic intensity is strictly less than one for each station.

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.