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.

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.

Diffusion approximations for multiclass queueing networks under preemptive priority service discipline

We prove a heavy traffic limit theorem to justify diffusion approximations for multiclass queueing networks under preemptive priority service discipline and provide effective stochastic dynamical models for the systems. Such queueing networks appear typically in high-speed integrated services packet networks about telecommunication system. In the network, there is a number of packet traffic types. Each type needs a number of job classes （stages） of processing and each type of jobs is assigned the same priority rank at every station where it possibly receives service. Moreover, there is no inter-routing among different traffic types throughout the entire network.

RELATIONS BETWEEN PERFORMANCE POTENTIALS AND INFINITESIMAL REALIZATION FACTORS IN CLOSED QUEUEING NETWORKS

In this paper,the concept of the infinitesimal realization factor is extended to the parameter dependent performance functions in closed queueing networks.Then the concepts of realization matrix (its elements are called realization factors) and performance potential are introduced,and the relations between infinitesimal realization factors and these two quantities are discussed.This provides a united framework for both IPA and non IPA approaches.Finally,another physical meaning of the service rate is given.

Open Queueing Network Model of Shanghai Public Transportation Problem

In this paper, the open queueing network model is proposed for solving the problem of public transportation in cities. The vertices of the networks(i.e., the bus stops) are determined by means of the fuzzy clustering method. The arcs (i.e., the paths of the public transportation) can be set up by using the shortest path model in the time sense or the 0 1 integer programming method.Applying the statistics method, we can calculate the parameters(such as the passenger flow's distribution, passenger flow's transition probability, mean waiting time for the bus etc. ) of the public transportation network. In this paper, we suggest to divide the network into two or three stages to implement the public transportation system in the form of ``frog jumping' fast transfer and ``permeation' fast dispersion.Combining the computer simulation and the evaluation of the achievement and effect of public transportation system, we modify the model so as to solve the public transportation problem better.

On Utilizing Model Transformation for the Performance Analysis of Queueing Networks

In this paper, we present an approach for model transformation from Queueing Network Models (QNMs) into Queueing Petri Nets (QPNs). The performance of QPNs can be analyzed using a powerful simulation engine, SimQPN, designed to exploit the knowledge and behavior of QPNs to improve the efficiency of simulation. When QNMs are transformed into QPNs, their performance can be analyzed efficiently using SimQPN. To validate our approach, we apply it to analyze the performance of several queueing network models including a model of a database system. The evaluation results show that the performance analysis of the transformed QNMs has high accuracy and low overhead. In this context, model transformation enables the performance analysis of queueing networks using different ways that can be more efficient.

Major impact of queue-rule choice on the performance of dynamic networks with limited buffer size

We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In our network model,nodes move at each time step.Packets are transmitted by an adaptive routing strategy,combining Euclidean distance and node load by a tunable parameter.Because of this routing strategy,at the initial stage of increasing buffer size,the network density will increase,and the packet loss rate will decrease.Packet loss and traffic congestion occur by these three rules,but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks.If packets are lost and traffic congestion occurs,different dynamic characteristics are shown by these three queue rules.Moreover,a phenomenon similar to Braess’paradox is also found by the LIFO rule and the RIRO rule.

Steady-State Analysis of the Distributed Queueing Algorithm in a Single-Channel M2M Network

The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.

Congestion control scheme in ATM networks based on fast tracing-queue

One of the more challenging and unresolved issues in ATM networks is the congestion control of available bit rate （ABR）. The dynamic controller is designed based on the control theory and the feedback mechanism of explicit rates With the given method of a chosen parameter, it can guarantee the stability of the controller and closed loop system with propagation delay and bandwidth oscillation. It needs less parameters（only one） to be designed. The queue length can converge to the given value in the least steps. The fairness of different connections is considered further. The simulations show better performance and good quality of service（QoS） is achieved.

A neural network algorithm for queue length estimation based on the concept of k-leader connected vehicles

This paper presents a novel method to estimate queue length at signalised intersections using connected vehicle(CV)data.The proposed queue length estimation method does not depend on any conventional information such as arrival flow rate and parameters pertaining to traffic signal controllers.The model is applicable for real-time applications when there are sufficient training data available to train the estimation model.To this end,we propose the idea of “k-leader CVs” to be able to predict the queue which is propagated after the communication range of dedicated short-range communication(the communication platform used in CV system).The idea of k-leader CVs could reduce the risk of communication failure which is a serious concern in CV ecosystems.Furthermore,a linear regression model is applied to weigh the importance of input variables to be used in a neural network model.Vissim traffic simulator is employed to train and evaluate the effectiveness and robustness of the model under different travel demand conditions,a varying number of CVs(i.e.CVs'market penetration rate)as well as various traffic signal control scenarios.As it is expected,when the market penetration rate increases,the accuracy of the model enhances consequently.In a congested traffic condition(saturated flow),the proposed model is more accurate compared to the undersaturated condition with the same market penetration rates.Although the proposed method does not depend on information of the arrival pattern and traffic signal control parameters,the results of the queue length estimation are still comparable with the results of the methods that highly depend on such information.The proposed algorithm is also tested using large size data from a CV test bed(i.e.Australian Integrated Multimodal Ecosystem)currently underway in Melbourne,Australia.The simulation results show that the model can perform well irrespective of the intersection layouts,traffic signal plans and arrival patterns of vehicles.Based on the numerical results,20%penetration rate of CVs is a critical threshold.For penetration rates below 20%,prediction algorithms fail to produce reliable outcomes.

Computational analysis of(MAP_1,MAP_2)/(PH_1,PH_2)/N queues with finite buffer in wireless cellular networks

This paper studies a queueing model with the finite buffer of capacity K in wireless cellular networks, which has two types of arriving calls--handoff and originating calls, both of which follow the Markov arriving process with different rates. The channel holding times of the two types of calls follow different phase-type distributions. Firstly, the joint distribution of two queue lengths is derived, and then the dropping and blocking probabilities, the mean queue length and the mean waiting time from the joint distribution are gotten. Finally, numerical examples show the impact of different call arrival rates on the performance measures.

Design of ATM Networks Congestion Controller Based on the Virtual Queue

The single bottleneck node of ATM networks is considered. The virtual queue mechanism and the method of proportion-integral-differential(PID) control are adopted in the congestion control. The sufficient condition of the considered system’s stability is given. The method of determining the PID parameters is given further. To quicken the speed of startup and remove the congestion rapidly, the factors of increase and decrease are set according to the length of queue. The result of simulation shows that the system, given an appropriate group of parameters, can acquire good robustness and dynamic performance, and guarantees the quality of service at the same time.

Analytical Modeling of a Multi-queue Nodes Network Router

This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.

A Multi-Stage Queue Approach to Solving Customer Congestion Problem in a Restaurant

The multistage queue model was developed for a situation where parallel and unrelated queues exist at the first stage only. These queues merged into single queues at the remaining stages. The parallel queues offer services that are different from one another and customers arrive to join the queue that offer services that they need. The mathematical model was developed assuming an M/M/1 queue system and the measures of effectiveness were derived. The model was applied to solve the problem of customer congestion in a restaurant in the city of Ibadan, Nigeria that serves three different local delicacies. The three local delicacies constitute three different queues at the first stage. The second stage consists of only one queue which is for purchase of drinks and the third stage which is the last stage is for payment. Every customer in the restaurant passes through the three stages. Utilization factors for the five queues were determined and found to range from 70% to 97%. The average time spent by customers in the system was found to be 543.04 minutes. A simulation study using what-if scenario analysis was performed to determine the optimum service configuration for the system. The optimum configuration reduced average time for customers in the system from 543.04 minutes to 13.47 minutes without hiring new servers.

Distributed Packet-Aware Routing Scheme Based on Dynamic Network Coding

In this paper, we study transmission of packets with time constraints in cooperative 5G wireless networks. As we know, the packets which are transmitted with large delay become useless and have to be dropped. In order to minimize packet dropping probability, we consider multiple transmission methods and integrate packet scheduling with adaptive network coding method selection. Firstly we introduce queue length to obtain the gain of network. Based on this, we present the dynamic coding-aware routing metric, which can increase potential coding opportunities. Moreover, we propose a distributed packet-aware transmission routing scheme based on the above routing metric, which can discover the available paths timely and efficiently. Simulation results show that the proposed method can reduce average packet dropping probability with lower computational complexity.

Stochastic Design of Enhanced Network Management Architecture and Algorithmic Implementations

The paper is focused on available server management in Internet connected network environments. The local backup servers are hooked up by LAN and replace broken main server immediately and several different types of backup servers are also considered. The remote backup servers are hooked up by VPN (Virtual Private Network) with high-speed optical network. A Virtual Private Network (VPN) is a way to use a public network infrastructure and hooks up long-distance servers within a single network infrastructure. The remote backup servers also replace broken main severs immediately under the different conditions with local backups. When the system performs a mandatory routine maintenance of main and local backup servers, auxiliary servers from other location are being used for backups during idle periods. Analytically tractable results are obtained by using several mathematical techniques and the results are demonstrated in the framework of optimized networked server allocation problems. The operational workflow give the guidelines for the actual implementations.

The Impact of Vehicular Networks on Urban Networks

The objective of this paper is to study the impact of a vehicular network on a physical (road) network consisting of several intersections controlled by traffic lights. The vehicular network is considered to be a random graph superimposed on a regular Hamiltonian graph. The two graphs are connected by hyperlinks. The evolution of traffic at intersections given the existence of vehicular networks is measured by the method of reflective triangles.

Research of improving the dynamic scheduling algorithm in the CAN bus control networks

Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.

COCM: Class Based Optimized Congestion Management Protocol for Healthcare Wireless Sensor Networks

Wireless Sensor Networks (WSNs) consist of numerous sensor nodes which can be used in many new emerging applications like healthcare. One of the major challenges in healthcare environments is to manage congestion, because in applications, such as medical emergencies or patients remote monitoring, transmitted data is important and critical. So it is essential in the first place to avoid congestion as much as possible and in cases when congestion avoidance is not possible, to control the congestion. In this paper, a class based congestion management protocol has been proposed for healthcare applications. We distinguish between sensitive, non-sensitive and control traffics, and service the input traffics based on their priority and quality of service requirements (QoS). The proposed protocol which is called COCM avoids congestion in the first step using multipath routing. The proposed AQM algorithm uses separate virtual queue's condition on a single physical queue to accept or drop the incoming packets. In cases where input traffic rate increases and congestion cannot be avoided, it mitigates congestion by using an optimized congestion control algorithm. This paper deals with parameters like end to end delay, packet loss, energy consumption, lifetime and fairness which are important in healthcare applications. The performance of COCM was evaluated using the OPNET simulator. Simulation results indicated that COCM achieves its goals.

Dynamic Handoff Priority Adjustment Based on Mobility-Awareness in Multimedia Cellular Networks

In multimedia cellular networks, when a Mobile Host requests multimedia services, it may experience hand-offs to several cells before the request is completely served. If a target cell cannot provide adequate bandwidth for a service request, instead of directly dropping the request, the MH is put into the handoff queue and hopefully the requested bandwidth can be satisfied by later released bandwidth. Obviously, it is important to properly assign priorities for queued handoff of MHs based on their inborn dynamics to avoid unnecessary dropping. In this paper, we present a dynamic handoff priority adjustment scheme which applied a handoff queuing scheme to dynamically adjust handoff priority based on receiving signal strength, service class, and mobility of Mobile Hosts. In addition, idle bandwidth reserved by inactive MHs is reallocated to urgent handoff MHs to reduce the call dropping probability. The goal of the proposed dynamic handoff priority adjustment scheme is to further reduce call dropping probability while still maintaining high bandwidth utilization and acceptable call blocking probability on multimedia cellular networks.