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 bas...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.展开更多
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 ...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.展开更多
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 da...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.展开更多
Data transmission in multimedia WSNs are required high bandwidth and reliable transfer because of large amount of data size. However, some applications of WSNs are required high quality. In this context, main factor i...Data transmission in multimedia WSNs are required high bandwidth and reliable transfer because of large amount of data size. However, some applications of WSNs are required high quality. In this context, main factor in quality of services (QoS) metrics in WSNs becomes longevity of the network and high quality. In sensor nodes, choosing relevant transceiver and microcontroller components plays important role in assembling sensor devices, in which data controls should be designed so that packet loss is minimized. Available QoS metrics based on queuing/buffer management in wired and other wireless networks don’t applicable in WSNs because of its unique characteristics. In this paper the simplest model of QoS model-bufferless system were proposed. In the proposed model, measurement of the probability of blocking of the arrival packets was suggested by using queuing theory in order to increase QoS. Given probability of blocking (PB) illustrates clear picture how system specification should be chosen so that blocking state would be minimized.展开更多
Services provided by internet need guaranteed network performance. Efficient packet queuing and scheduling schemes play key role in achieving this. Internet engineering task force(IETF) has proposed Differentiated Ser...Services provided by internet need guaranteed network performance. Efficient packet queuing and scheduling schemes play key role in achieving this. Internet engineering task force(IETF) has proposed Differentiated Services(Diff Serv) architecture for IP network which is based on classifying packets in to different service classes and scheduling them. Scheduling schemes of today's wireless broadband networks work on service differentiation. In this paper, we present a novel packet queue scheduling algorithm called dynamically weighted low complexity fair queuing(DWLC-FQ) which is an improvement over weighted fair queuing(WFQ) and worstcase fair weighted fair queuing+(WF2Q+). The proposed algorithm incorporates dynamic weight adjustment mechanism to cope with dynamics of data traffic such as burst and overload. It also reduces complexity associated with virtual time update and hence makes it suitable for high speed networks. Simulation results of proposed packet scheduling scheme demonstrate improvement in delay and drop rate performance for constant bit rate and video applications with very little or negligible impact on fairness.展开更多
The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s ...The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s Routers, the load of any algorithm of them over Router’s CPUs and memory usage, the delay occurred between routers when any algorithm has been used and the network application throughput. This comparison explains that, PQ doesn’t need high specification hardware (memory and CPU) but when used it is not fair, because it serves one application and ignore the other application and FIFO mechanism has smaller queuing delay, otherwise PQ has bigger delay.展开更多
In industrial wireless networks,data transmitted from source to destination are highly repetitive.This often leads to the queuing of the data,and poor management of the queued data results in excessive delays,increase...In industrial wireless networks,data transmitted from source to destination are highly repetitive.This often leads to the queuing of the data,and poor management of the queued data results in excessive delays,increased energy consumption,and packet loss.Therefore,a nature-inspired-based Dragonfly Interaction Optimization Algorithm(DMOA)is proposed for optimization of the queue delay in industrial wireless networks.The term“interaction”herein used is the characterization of the“flying movement”of the dragonfly towards damselflies(female dragonflies)for mating.As a result,interaction is represented as the flow of transmitted data packets,or traffic,from the source to the base station.This includes each and every feature of dragonfly movement as well as awareness of the rival dragonflies,predators,and damselflies for the desired optimization of the queue delay.These features are juxtaposed as noise and interference,which are further used in the calculation of industrial wireless metrics:latency,error rate(reliability),throughput,energy efficiency,and fairness for the optimization of the queue delay.Statistical analysis,convergence analysis,the Wilcoxon test,the Friedman test,and the classical as well as the 2014 IEEE Congress of Evolutionary Computation(CEC)on the benchmark functions are also used for the evaluation of DMOA in terms of its robustness and efficiency.The results demonstrate the robustness of the proposed algorithm for both classical and benchmarking functions of the IEEE CEC 2014.Furthermore,the accuracy and efficacy of DMOA were demonstrated by means of the convergence rate,Wilcoxon testing,and ANOVA.Moreover,fairness using Jain’s index in queue delay optimization in terms of throughput and latency,along with computational complexity,is also evaluated and compared with other algorithms.Simulation results show that DMOA exceeds other bio-inspired optimization algorithms in terms of fairness in queue delay management and average packet loss.The proposed algorithm is also evaluated for the conflicting objectives at Pareto Front,and its analysis reveals that DMOA finds a compromising solution between the objectives,thereby optimizing queue delay.In addition,DMOA on the Pareto front delivers much greater performance when it comes to optimizing the queuing delay for industry wireless networks.展开更多
An analytical queuing model is proposed for the classified services of WiMAX network. Simulation model is also developed that corresponds to the Markovian analytical model using Java modeling tool （JMT）. This is a n...An analytical queuing model is proposed for the classified services of WiMAX network. Simulation model is also developed that corresponds to the Markovian analytical model using Java modeling tool （JMT）. This is a new and efficient discrete event tool for queuing network modeling and workload analysis. QoS metrics have been evaluated for the multi-rate traffic in multiple scenari- os. Results obtained from simulation are compared for validation and analysis. Outcomes show that the proposed model is more efficient than the conventional method by improving residence time, re- sponse time, increasing system throughput and efficiency at queuing level with a slight degradation in call acceptance factor.展开更多
A high-speed and effective packet scheduling method is crucial to the performance of Gigabit routers. The paper studies the variable-length packet scheduling problem in Gigabit router with crossbar switch fabric and i...A high-speed and effective packet scheduling method is crucial to the performance of Gigabit routers. The paper studies the variable-length packet scheduling problem in Gigabit router with crossbar switch fabric and input queuing, and a scheduling method based on neural network is proposed. For the proposed method, a scheduling system structure fit for the variable-length packet case is presented first, then some rules for scheduling are given. At last, an optimal scheduling method using Hopfield neural network is proposed based on the rules. Furthermore, the paper discusses that the proposed method can be realized by hardware circuit. The simulation result shows the effectiveness of the proposed method.展开更多
In this paper, we have used the distributed mean value analysis (DMVA) technique with the help of random observe property (ROP) and palm probabilities to improve the network queuing system throughput. In such networks...In this paper, we have used the distributed mean value analysis (DMVA) technique with the help of random observe property (ROP) and palm probabilities to improve the network queuing system throughput. In such networks, where finding the complete communication path from source to destination, especially when these nodes are not in the same region while sending data between two nodes. So, an algorithm is developed for single and multi-server centers which give more interesting and successful results. The network is designed by a closed queuing network model and we will use mean value analysis to determine the network throughput (b) for its different values. For certain chosen values of parameters involved in this model, we found that the maximum network throughput for β≥0.7?remains consistent in a single server case, while in multi-server case for β≥ 0.5?throughput surpass the Marko chain queuing system.展开更多
In cognitive radio networks, the spectrum utilization can be improved by cognitive users opportunistically using the idle channels licensed to the primary users. However, the new arrived cognitive users may not be abl...In cognitive radio networks, the spectrum utilization can be improved by cognitive users opportunistically using the idle channels licensed to the primary users. However, the new arrived cognitive users may not be able to use the channel immediately since the channel usage state is random. This will impose additional time delay for the cognitive users. Excessive waiting delay can make cognitive users miss the spectrum access chances. In this paper, a discrete-time Markov queuing model from a macro point of view is provided. Through the matrix-geometric solution theory, the average sojourn time for cognitive users in the steady state before accessing the spectrum is obtained. Given the tolerant delay of cognitive users, the macro-based throughput is derived and an access control mechanism is proposed. The numerical results show the effects of service completion probability on average sojourn time and throughput. It is confirmed that the throughput can be obviously improved by using the proposed access control mechanism. Finally, the performance evaluations based on users are compared to that based on data packets.展开更多
In this paper, we discuss a discrete time repairable queuing system with Markovian arrival process, where lifetime of server, service time and repair time of server are all discrete phase type random variables. Using...In this paper, we discuss a discrete time repairable queuing system with Markovian arrival process, where lifetime of server, service time and repair time of server are all discrete phase type random variables. Using the theory of matrix geometric solution, we give the steady state distribution of queue length and waiting time. In addition, the stable availability of the system is also provided.展开更多
By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS sy...By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS system is divided into two parts, the gateway installation cost and the data transmission cost. Secondly, through comparing two kinds of different queuing theories, the cost problem of the HEMS is converted into the problem of gateway deployment. Finally, a machine-to-machine（ M2M） gateway configuration scheme is designed to minimize the cost of the system. Simulation results showthat the cost of the HEMS system mainly comes from the installation cost of the gateways when the gateway buffer space is large enough. If the gateway buffer space is limited, the proposed queue algorithm can effectively achieve optimal gateway setting while maintaining the minimal cost of the HEMS at desired levels through marginal analyses and the properties of cost minimization.展开更多
In real complex systems, the limited storage capacity of physical devices often results in the loss of data. We study the effect of buffer size on packet loss threshold in scale-free networks. A new order parameter is...In real complex systems, the limited storage capacity of physical devices often results in the loss of data. We study the effect of buffer size on packet loss threshold in scale-free networks. A new order parameter is proposed to characterize the packet loss threshold. Our results show that the packet loss threshold can be optimized with a relative small buffer size. Meanwhile, a large buffer size will increase the travel time. Furthermore, we propose a Buffered-Shortest-Path-First(BSPF) queuing strategy. Compared to the traditional First-In-First-Out(FIFO) strategy, BSPF can not only increase the packet loss threshold but can also significantly decrease the travel length and travel time in both identical and heterogeneous node capacity cases. Our study will help to improve the traffic performance in finite buffer networks.展开更多
This paper presents mathematics models that describe and optimize the passenger flow at the airport security checkpoints by applying the queuing theory. Firstly, a Poisson process is used to estimate the flow of passe...This paper presents mathematics models that describe and optimize the passenger flow at the airport security checkpoints by applying the queuing theory. Firstly, a Poisson process is used to estimate the flow of passengers waiting for going through the security. Then, the Poisson distribution is combined with a multiple M/M/s model. Following that, an arrival model (passengers’ arriving at the checkpoints preparing for security examination and departure) with Gumbel extreme value estimation is described that predicts the busiest time in the busiest airport. Real case data collected from several major airports worldwide is used for creating a hybrid Poisson model to generate the simulation of passenger volume. At last, Markov Chain theory is applied to the analysis to randomly simulate the flow of enplaned passengers again, and the results of these two simulations are compared and discussed, revealing that the hybrid Poisson model is the more accurate one. After successfully characterizing the passenger flow mathematically, two methods for optimizing the passenger flow are then provided in two different respects: one is bypassing passengers and creating an express pass;while the other one promotes Pre-Check service application.展开更多
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 hig...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.展开更多
Vehicular Ad-hoc Networks(VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is ...Vehicular Ad-hoc Networks(VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is well known that routing is a challenging problem in VANETs due to the fast-changing network typology caused by high mobility at both ends of transmission. Moreover, under urban environment, there are two non-negligible factors in routing protocol design, the non-uniform vehicle distribution caused by traffic lights, and the network congestion due to high traffic demand in rush hours. In this paper, we propose a greedy traffic light and queue aware routing protocol(GTLQR) which jointly considers the street connectivity, channel quality, relative distance, and queuing delay to alleviate the packet loss caused by vehicle clustering at the intersection and balance the traffic load among vehicles. Through performance evaluation, we show that our proposed protocol outperforms both TLRC and GLSR-L in terms of packet delivery ratio and end-to-end delay.展开更多
Aiming at the problems of unreliable data transmission,poor steadiness,nonsupport of complex data types,direct couple between data transmission and exchange,a high-level method based on advanced message queuing protoc...Aiming at the problems of unreliable data transmission,poor steadiness,nonsupport of complex data types,direct couple between data transmission and exchange,a high-level method based on advanced message queuing protocol( AMQP) is proposed to integrate naval distributed tactical training simulation system after serious consideration with current information exchange features of military combat system. Transferring layer in traditional user datagram protocol is implemented by publishing and subscribing scheme of message middleware. By creating message model to standardize message structure,integration architecture is formulated to resolve potential information security risks from inconsistent data type and express data transmission. Meanwhile,a communication model is put forward based on AMQP,which is in the center position of the whole transmission framework and responsible for reliably transferring battlefield data among subsystems. Experiments show that the method can accurately post amounts of data to the subscriber without error and loss,and can get excellent real-time performance of data exchange.展开更多
Introduction: Studies have shown Emergency Department (ED) crowding contributes to reduced quality of patient care, delays in starting treatments, and increased number of patients leaving without being seen. This anal...Introduction: Studies have shown Emergency Department (ED) crowding contributes to reduced quality of patient care, delays in starting treatments, and increased number of patients leaving without being seen. This analysis shows how to theoretically and optimally align staffing to demand. Methods: The ED value stream was identified and mapped. Patients were stratified into three resource-driven care flow cells based on the severity indices. Time observations were conducted for each of the key care team members and the manual cycle times and service rate were calculated and stratified by severity indices. Using X32 Healthcare’s Online Staffing Optimization (OSO) tool, staffing inefficiencies were identified and an optimal schedule was created for each provider group. Results: Lower Severity Indices (higher acuity patient) led to longer times for providers, nurses, patient care assistants, and clerks. The patient length of stay varied from under one hour to over five hours. The flow of patients varied considerably over the 24 hours’ period but was similar by day of the week. Using flow data, we showed that we needed more nurses, more care team members during peak times of patient flow. Eight hour shifts would allow better flexibility. We showed that the additional salary hours added to the budget would be made up for by increased revenue recognized by decreasing the number of patients who leave without being seen. Conclusion: If implemented, these changes will improve ED flow by using lean tools and principles, ultimately leading to timeliness of care, reduced waits, and improved patient experience.展开更多
A new framework for networked control system based on Generalized Predictive Control (GPC) is proposed in this paper. Clock-driven sensors, event-driven controller, and clock-driven actuators are required in this fram...A new framework for networked control system based on Generalized Predictive Control (GPC) is proposed in this paper. Clock-driven sensors, event-driven controller, and clock-driven actuators are required in this framework. A queuing strategy is proposed to overcome the network induced delay. Without redesigning, the proposed framework enables the existing GPC controller to be used in a network environment. It also does not require clock synchronization and is only slightly affected by bad network condition such as package loss. Various experiments are designed over the real network to test the proposed approach, which verify that the proposed approach can stabilize the Networked Control System (NCS) and is robust.展开更多
文摘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.
基金supported by the Application Research of the Remote Sensing Technology on Global Energy Internet(JYYKJXM(2017)011)the National Natural Science Foundation of China(61671332,41701518,41771452,41771454,U1736206)+4 种基金National key R&D Project(2016YFE0202300)Hubei Province Technological Innovation Major Project(2017AAA123)Applied Basic Research Program of Wuhan City(2016010101010025)Basic Research Program of Shenzhen(JCYJ20170306171431656)the Fundamental Research Funds for the Central Universities(2042016gf0033)
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No. 60904074the Natural Science Foundation of Hubei Province of China under Grant No. 2008CDB012the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200804871150
文摘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.
文摘Data transmission in multimedia WSNs are required high bandwidth and reliable transfer because of large amount of data size. However, some applications of WSNs are required high quality. In this context, main factor in quality of services (QoS) metrics in WSNs becomes longevity of the network and high quality. In sensor nodes, choosing relevant transceiver and microcontroller components plays important role in assembling sensor devices, in which data controls should be designed so that packet loss is minimized. Available QoS metrics based on queuing/buffer management in wired and other wireless networks don’t applicable in WSNs because of its unique characteristics. In this paper the simplest model of QoS model-bufferless system were proposed. In the proposed model, measurement of the probability of blocking of the arrival packets was suggested by using queuing theory in order to increase QoS. Given probability of blocking (PB) illustrates clear picture how system specification should be chosen so that blocking state would be minimized.
文摘Services provided by internet need guaranteed network performance. Efficient packet queuing and scheduling schemes play key role in achieving this. Internet engineering task force(IETF) has proposed Differentiated Services(Diff Serv) architecture for IP network which is based on classifying packets in to different service classes and scheduling them. Scheduling schemes of today's wireless broadband networks work on service differentiation. In this paper, we present a novel packet queue scheduling algorithm called dynamically weighted low complexity fair queuing(DWLC-FQ) which is an improvement over weighted fair queuing(WFQ) and worstcase fair weighted fair queuing+(WF2Q+). The proposed algorithm incorporates dynamic weight adjustment mechanism to cope with dynamics of data traffic such as burst and overload. It also reduces complexity associated with virtual time update and hence makes it suitable for high speed networks. Simulation results of proposed packet scheduling scheme demonstrate improvement in delay and drop rate performance for constant bit rate and video applications with very little or negligible impact on fairness.
文摘The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s Routers, the load of any algorithm of them over Router’s CPUs and memory usage, the delay occurred between routers when any algorithm has been used and the network application throughput. This comparison explains that, PQ doesn’t need high specification hardware (memory and CPU) but when used it is not fair, because it serves one application and ignore the other application and FIFO mechanism has smaller queuing delay, otherwise PQ has bigger delay.
基金supported by Priority Research Centers Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education,Science and Technology(2018R1A6A1A03024003)the MSIT(Ministry of Science and ICT),Korea,under the Innovative Human Resource Development for Local Intellectualization support program(IITP-2023-2020-0-01612)supervised by the IITP(Institute for Information&communications TechnologyPlanning&Evaluation).
文摘In industrial wireless networks,data transmitted from source to destination are highly repetitive.This often leads to the queuing of the data,and poor management of the queued data results in excessive delays,increased energy consumption,and packet loss.Therefore,a nature-inspired-based Dragonfly Interaction Optimization Algorithm(DMOA)is proposed for optimization of the queue delay in industrial wireless networks.The term“interaction”herein used is the characterization of the“flying movement”of the dragonfly towards damselflies(female dragonflies)for mating.As a result,interaction is represented as the flow of transmitted data packets,or traffic,from the source to the base station.This includes each and every feature of dragonfly movement as well as awareness of the rival dragonflies,predators,and damselflies for the desired optimization of the queue delay.These features are juxtaposed as noise and interference,which are further used in the calculation of industrial wireless metrics:latency,error rate(reliability),throughput,energy efficiency,and fairness for the optimization of the queue delay.Statistical analysis,convergence analysis,the Wilcoxon test,the Friedman test,and the classical as well as the 2014 IEEE Congress of Evolutionary Computation(CEC)on the benchmark functions are also used for the evaluation of DMOA in terms of its robustness and efficiency.The results demonstrate the robustness of the proposed algorithm for both classical and benchmarking functions of the IEEE CEC 2014.Furthermore,the accuracy and efficacy of DMOA were demonstrated by means of the convergence rate,Wilcoxon testing,and ANOVA.Moreover,fairness using Jain’s index in queue delay optimization in terms of throughput and latency,along with computational complexity,is also evaluated and compared with other algorithms.Simulation results show that DMOA exceeds other bio-inspired optimization algorithms in terms of fairness in queue delay management and average packet loss.The proposed algorithm is also evaluated for the conflicting objectives at Pareto Front,and its analysis reveals that DMOA finds a compromising solution between the objectives,thereby optimizing queue delay.In addition,DMOA on the Pareto front delivers much greater performance when it comes to optimizing the queuing delay for industry wireless networks.
基金Supported by the National Natural Science Foundation of China(60772066)
文摘An analytical queuing model is proposed for the classified services of WiMAX network. Simulation model is also developed that corresponds to the Markovian analytical model using Java modeling tool （JMT）. This is a new and efficient discrete event tool for queuing network modeling and workload analysis. QoS metrics have been evaluated for the multi-rate traffic in multiple scenari- os. Results obtained from simulation are compared for validation and analysis. Outcomes show that the proposed model is more efficient than the conventional method by improving residence time, re- sponse time, increasing system throughput and efficiency at queuing level with a slight degradation in call acceptance factor.
文摘A high-speed and effective packet scheduling method is crucial to the performance of Gigabit routers. The paper studies the variable-length packet scheduling problem in Gigabit router with crossbar switch fabric and input queuing, and a scheduling method based on neural network is proposed. For the proposed method, a scheduling system structure fit for the variable-length packet case is presented first, then some rules for scheduling are given. At last, an optimal scheduling method using Hopfield neural network is proposed based on the rules. Furthermore, the paper discusses that the proposed method can be realized by hardware circuit. The simulation result shows the effectiveness of the proposed method.
文摘In this paper, we have used the distributed mean value analysis (DMVA) technique with the help of random observe property (ROP) and palm probabilities to improve the network queuing system throughput. In such networks, where finding the complete communication path from source to destination, especially when these nodes are not in the same region while sending data between two nodes. So, an algorithm is developed for single and multi-server centers which give more interesting and successful results. The network is designed by a closed queuing network model and we will use mean value analysis to determine the network throughput (b) for its different values. For certain chosen values of parameters involved in this model, we found that the maximum network throughput for β≥0.7?remains consistent in a single server case, while in multi-server case for β≥ 0.5?throughput surpass the Marko chain queuing system.
文摘In cognitive radio networks, the spectrum utilization can be improved by cognitive users opportunistically using the idle channels licensed to the primary users. However, the new arrived cognitive users may not be able to use the channel immediately since the channel usage state is random. This will impose additional time delay for the cognitive users. Excessive waiting delay can make cognitive users miss the spectrum access chances. In this paper, a discrete-time Markov queuing model from a macro point of view is provided. Through the matrix-geometric solution theory, the average sojourn time for cognitive users in the steady state before accessing the spectrum is obtained. Given the tolerant delay of cognitive users, the macro-based throughput is derived and an access control mechanism is proposed. The numerical results show the effects of service completion probability on average sojourn time and throughput. It is confirmed that the throughput can be obviously improved by using the proposed access control mechanism. Finally, the performance evaluations based on users are compared to that based on data packets.
文摘In this paper, we discuss a discrete time repairable queuing system with Markovian arrival process, where lifetime of server, service time and repair time of server are all discrete phase type random variables. Using the theory of matrix geometric solution, we give the steady state distribution of queue length and waiting time. In addition, the stable availability of the system is also provided.
基金The National Natural Science Foundation of China(No.61471031)the Fundamental Research Funds for the Central Universities(No.2013JBZ01)the Program for New Century Excellent Talents in University of Ministry of Education of China(No.NCET-12-0766)
文摘By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS system is divided into two parts, the gateway installation cost and the data transmission cost. Secondly, through comparing two kinds of different queuing theories, the cost problem of the HEMS is converted into the problem of gateway deployment. Finally, a machine-to-machine（ M2M） gateway configuration scheme is designed to minimize the cost of the system. Simulation results showthat the cost of the HEMS system mainly comes from the installation cost of the gateways when the gateway buffer space is large enough. If the gateway buffer space is limited, the proposed queue algorithm can effectively achieve optimal gateway setting while maintaining the minimal cost of the HEMS at desired levels through marginal analyses and the properties of cost minimization.
基金Project supported by the National Key Research and Development Program of China(Grant No.2016YFC0802508)the National Natural Science Foundation of China(Grant Nos.11672289 and 61503355)the support from the Chinese Scholarship Council
文摘In real complex systems, the limited storage capacity of physical devices often results in the loss of data. We study the effect of buffer size on packet loss threshold in scale-free networks. A new order parameter is proposed to characterize the packet loss threshold. Our results show that the packet loss threshold can be optimized with a relative small buffer size. Meanwhile, a large buffer size will increase the travel time. Furthermore, we propose a Buffered-Shortest-Path-First(BSPF) queuing strategy. Compared to the traditional First-In-First-Out(FIFO) strategy, BSPF can not only increase the packet loss threshold but can also significantly decrease the travel length and travel time in both identical and heterogeneous node capacity cases. Our study will help to improve the traffic performance in finite buffer networks.
文摘This paper presents mathematics models that describe and optimize the passenger flow at the airport security checkpoints by applying the queuing theory. Firstly, a Poisson process is used to estimate the flow of passengers waiting for going through the security. Then, the Poisson distribution is combined with a multiple M/M/s model. Following that, an arrival model (passengers’ arriving at the checkpoints preparing for security examination and departure) with Gumbel extreme value estimation is described that predicts the busiest time in the busiest airport. Real case data collected from several major airports worldwide is used for creating a hybrid Poisson model to generate the simulation of passenger volume. At last, Markov Chain theory is applied to the analysis to randomly simulate the flow of enplaned passengers again, and the results of these two simulations are compared and discussed, revealing that the hybrid Poisson model is the more accurate one. After successfully characterizing the passenger flow mathematically, two methods for optimizing the passenger flow are then provided in two different respects: one is bypassing passengers and creating an express pass;while the other one promotes Pre-Check service application.
基金ACKNOWLEDGEMENT This project was supported by the National Natural Science Foundation of China under Grant No. 61170262 the National High Tech- nology Research and Development Program of China （863 Program） under Grants No. 2012AA012506, No. 2012AA012901, No. 2012- AA012903+5 种基金 the Specialised Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20121103120032 the Humanity and Social Science Youth Founda- tion of Ministry of Education of China under Grant No. 13YJCZH065 the Opening Project of Key Lab of Information Network Security of Ministry of Public Security （The Third Re- search Institute of Ministry of Public Security） under Grant No. C13613 the China Postdoc- toral Science Foundation, General Program of Science and Technology Development Project of Beijing Municipal Education Commission of China under Grant No. km201410005012 the Research on Education and Teaching of Beijing University of Technology under Grant No. ER2013C24 the Beijing Municipal Natu- ral Science Foundation, Sponsored by Hunan Postdoctoral Scientific Program, Open Re- search Fund of Beijing Key Laboratory of Trusted Computing.
文摘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.
基金supported by the Beijing University of Posts and Telecommunications project No.500418759the State Key Laboratory of Networking and Switching Technology project No.600118124
文摘Vehicular Ad-hoc Networks(VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is well known that routing is a challenging problem in VANETs due to the fast-changing network typology caused by high mobility at both ends of transmission. Moreover, under urban environment, there are two non-negligible factors in routing protocol design, the non-uniform vehicle distribution caused by traffic lights, and the network congestion due to high traffic demand in rush hours. In this paper, we propose a greedy traffic light and queue aware routing protocol(GTLQR) which jointly considers the street connectivity, channel quality, relative distance, and queuing delay to alleviate the packet loss caused by vehicle clustering at the intersection and balance the traffic load among vehicles. Through performance evaluation, we show that our proposed protocol outperforms both TLRC and GLSR-L in terms of packet delivery ratio and end-to-end delay.
基金Supported by the National Natural Science Foundation of China(No.61401496)
文摘Aiming at the problems of unreliable data transmission,poor steadiness,nonsupport of complex data types,direct couple between data transmission and exchange,a high-level method based on advanced message queuing protocol( AMQP) is proposed to integrate naval distributed tactical training simulation system after serious consideration with current information exchange features of military combat system. Transferring layer in traditional user datagram protocol is implemented by publishing and subscribing scheme of message middleware. By creating message model to standardize message structure,integration architecture is formulated to resolve potential information security risks from inconsistent data type and express data transmission. Meanwhile,a communication model is put forward based on AMQP,which is in the center position of the whole transmission framework and responsible for reliably transferring battlefield data among subsystems. Experiments show that the method can accurately post amounts of data to the subscriber without error and loss,and can get excellent real-time performance of data exchange.
文摘Introduction: Studies have shown Emergency Department (ED) crowding contributes to reduced quality of patient care, delays in starting treatments, and increased number of patients leaving without being seen. This analysis shows how to theoretically and optimally align staffing to demand. Methods: The ED value stream was identified and mapped. Patients were stratified into three resource-driven care flow cells based on the severity indices. Time observations were conducted for each of the key care team members and the manual cycle times and service rate were calculated and stratified by severity indices. Using X32 Healthcare’s Online Staffing Optimization (OSO) tool, staffing inefficiencies were identified and an optimal schedule was created for each provider group. Results: Lower Severity Indices (higher acuity patient) led to longer times for providers, nurses, patient care assistants, and clerks. The patient length of stay varied from under one hour to over five hours. The flow of patients varied considerably over the 24 hours’ period but was similar by day of the week. Using flow data, we showed that we needed more nurses, more care team members during peak times of patient flow. Eight hour shifts would allow better flexibility. We showed that the additional salary hours added to the budget would be made up for by increased revenue recognized by decreasing the number of patients who leave without being seen. Conclusion: If implemented, these changes will improve ED flow by using lean tools and principles, ultimately leading to timeliness of care, reduced waits, and improved patient experience.
文摘A new framework for networked control system based on Generalized Predictive Control (GPC) is proposed in this paper. Clock-driven sensors, event-driven controller, and clock-driven actuators are required in this framework. A queuing strategy is proposed to overcome the network induced delay. Without redesigning, the proposed framework enables the existing GPC controller to be used in a network environment. It also does not require clock synchronization and is only slightly affected by bad network condition such as package loss. Various experiments are designed over the real network to test the proposed approach, which verify that the proposed approach can stabilize the Networked Control System (NCS) and is robust.
