The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms...The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.展开更多
This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adap...This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.展开更多
The progress of modern industry has given rise to great requirements for network transmission latency and reliability in domains such as smart grid and intelligent driving.To address these challenges,the concept of Ti...The progress of modern industry has given rise to great requirements for network transmission latency and reliability in domains such as smart grid and intelligent driving.To address these challenges,the concept of Time-sensitive networking(TSN)is proposed by IEEE 802.1TSN working group.In order to achieve low latency,Cyclic queuing and forwarding(CQF)mechanism is introduced to schedule Timetriggered(TT)flows.In this paper,we construct a TSN model based on CQF and formulate the flow scheduling problem as an optimization problem aimed at maximizing the success rate of flow scheduling.The problem is tackled by a novel algorithm that makes full use of the characteristics and the relationship between the flows.Firstly,by K-means algorithm,the flows are initially partitioned into subsets based on their correlations.Subsequently,the flows within each subset are sorted by a new special criteria extracted from multiple features of flow.Finally,a flow offset selecting method based on load balance is used for resource mapping,so as to complete the process of flow scheduling.Experimental results demonstrate that the proposed algorithm exhibits significant advantages in terms of scheduling success rate and time efficiency.展开更多
Experiments are conducted on the evacuation rate of pedestrians through exits with queued evacuation pattern and random evacuation pattern. The experimental results show that the flow rate of pedestrians is larger wit...Experiments are conducted on the evacuation rate of pedestrians through exits with queued evacuation pattern and random evacuation pattern. The experimental results show that the flow rate of pedestrians is larger with the random evacuation pattern than with the queued evacuation pattern. Therefore, the exit width calculated based on the minimum evacuation clear width for every 100 persons, which is on the assumption that the pedestrians pass through the exit in one queue or several queues, is conservative. The number of people crossing the exit simultaneously is greater in the random evacuation experiments than in the queued evacuation experiments, and the time interval between the front row and rear row of people is shortened in large-exit conditions when pedestrians evacuate randomly. The difference between the flow rate with a queued evacuation pattern and the flow rate with a random evacuation pattern is related to the surplus width of the exit, which is greater than the total width of all accommodated people streams. Two dimensionless quantities are defined to explore this relationship. It is found that the difference in flow rate between the two evacuation patterns is stable at a low level when the surplus width of the exit is no more than 45% of the width of a single pedestrian stream. There is a great difference between the flow rate with the queued evacuation pattern and the flow rate with the random evacuation pattern in a scenario with a larger surplus width of the exit. Meanwhile, the pedestrians crowd extraordinarily at the exit in these conditions as well, since the number of pedestrians who want to evacuate through exit simultaneously greatly exceeds the accommodated level. Therefore, the surplus width of exit should be limited especially in the narrow exit condition, and the relationship between the two dimensionless quantities mentioned above could provide the basis to some extent.展开更多
In recent years, the traffic congestion problem has become more and more serious, and the research on traffic system control has become a new hot spot. Studying the bifurcation characteristics of traffic flow systems ...In recent years, the traffic congestion problem has become more and more serious, and the research on traffic system control has become a new hot spot. Studying the bifurcation characteristics of traffic flow systems and designing control schemes for unstable pivots can alleviate the traffic congestion problem from a new perspective. In this work, the full-speed differential model considering the vehicle network environment is improved in order to adjust the traffic flow from the perspective of bifurcation control, the existence conditions of Hopf bifurcation and saddle-node bifurcation in the model are proved theoretically, and the stability mutation point for the stability of the transportation system is found. For the unstable bifurcation point, a nonlinear system feedback controller is designed by using Chebyshev polynomial approximation and stochastic feedback control method. The advancement, postponement, and elimination of Hopf bifurcation are achieved without changing the system equilibrium point, and the mutation behavior of the transportation system is controlled so as to alleviate the traffic congestion. The changes in the stability of complex traffic systems are explained through the bifurcation analysis, which can better capture the characteristics of the traffic flow. By adjusting the control parameters in the feedback controllers, the influence of the boundary conditions on the stability of the traffic system is adequately described, and the effects of the unstable focuses and saddle points on the system are suppressed to slow down the traffic flow. In addition, the unstable bifurcation points can be eliminated and the Hopf bifurcation can be controlled to advance, delay, and disappear,so as to realize the control of the stability behavior of the traffic system, which can help to alleviate the traffic congestion and describe the actual traffic phenomena as well.展开更多
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.展开更多
Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and...Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.展开更多
The couple between the power network and the transportation network(TN)is deepening gradually with the increasing penetration rate of electric vehicles(EV),which also poses a great challenge to the traditional voltage...The couple between the power network and the transportation network(TN)is deepening gradually with the increasing penetration rate of electric vehicles(EV),which also poses a great challenge to the traditional voltage control scheme.In this paper,we propose a coordinated voltage control strategy for the active distribution networks considering multiple types of EV.In the first stage,the action of on-load tap changer and capacitor banks,etc.,are determined by optimal power flow calculation,and the node electricity price is also determined based on dynamic time-of-use tariff mechanism.In the second stage,multiple operating scenarios of multiple types of EVs such as cabs,private cars and buses are considered,and the scheduling results of each EV are solved by building an optimization model based on constraints such as queuing theory,Floyd-Warshall algorithm and traffic flow information.In the third stage,the output power of photovoltaic and energy storage systems is fine-tuned in the normal control mode.The charging power of EVs is also regulated in the emergency control mode to reduce the voltage deviation,and the amount of regulation is calculated based on the fair voltage control mode of EVs.Finally,we test the modified IEEE 33-bus distribution system coupled with the 24-bus Beijing TN.The simulation results show that the proposed scheme can mitigate voltage violations well.展开更多
The “Internet of Things” (IoT) refers to a set of intelligent “objects” that can communicate with each other directly or through a network. The IoT is the embodiment of the idea that everything can be connected an...The “Internet of Things” (IoT) refers to a set of intelligent “objects” that can communicate with each other directly or through a network. The IoT is the embodiment of the idea that everything can be connected anywhere and at any time. The concept can be applied to sectors such as e-health, e-government, automotive, geographic information systems, remote sensing, home networking, e-commerce and climate change mitigation. Unlike the Internet, the IoT has its own constraints, notably those linked to heterogeneity. This divergence is linked to different protocols, technologies and algorithms implemented in these connected objects for their interconnection. It should be noted that IoT devices can communicate with each other using different protocols and dedicated M2M (Machine to Machine) communication technologies. The aim of this work is to find solutions for optimising energy consumption during data exchanges between connected objects, with respect to certain constraints by using firstly this exchange for only Message Queuing Telemetry Transport (MQTT) and secondly the combination of the MQTT protocol and the Constrained Application Protocol (CoAP) protocol to check the quantity of the energy optimized. The MQTT protocol, for example, is one of the most widely used protocols for connected objects. Admittedly, this protocol consumes less energy, but in the situation of a very large number of users, the problem of saturation inevitably arises. In this article, we propose a solution of optimising energy consumption by combining the MQTT protocol with the CoAP protocol which can allow to use the standby mode contrary to the use of MQTT where the broker is always being turning. This solution has not yet been implemented but is being discussed. In this article, we’re going to use the joulemeter which is an application developed by Microsoft to measure and estimate the energy consumption of computers and applications. In our case, we take the example of the “Service Broker for network connections” of the Windows’s 10 Operating System, in my own computer to show the difference between the consumption of energy without the standby mode and with standby mode, because with the MQTT, the Broker’s MQTT is always on. Now, with the combination MQTT and CoAP, it is possible that we have standby mode and to compare these two cases in term of consumption of an energy. And to do it, we must use the joulemeter that we installed in our computer to simulate it. This is achieved by using the CoAP protocol combined with the MQTT protocol. The aim of our work is to reduce energy consumption in order to solve the problem of saturation of the MQTT by linking it to CoAP protocol by using Joulemeter mentioned above.展开更多
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 subje...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.展开更多
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.展开更多
This paper deals with a type of servicing machines model, which service station has a life time of the kth Er-langian distribution and can be repaired just like a new one. The cyclic time and the inefficiency quantiti...This paper deals with a type of servicing machines model, which service station has a life time of the kth Er-langian distribution and can be repaired just like a new one. The cyclic time and the inefficiency quantities of this system in equilibrium are obtained.展开更多
A Single-Buffered （SB） router is a router where only one stage of shared buffering is sandwiched between two interconnects in comparison of a Combined Input and Output Queued （CIOQ） router where a central switch f...A Single-Buffered （SB） router is a router where only one stage of shared buffering is sandwiched between two interconnects in comparison of a Combined Input and Output Queued （CIOQ） router where a central switch fabric is sandwiched between two stages of buffering. The notion of SB routers was firstly proposed by the High-Performance Networking Group （HPNG） of Stanford University, along with two promising designs of SB routers： one of which was Parallel Shared Memory （PSM） router and the other was Distributed Shared Memory （DSM） router. Admittedly, the work of HPNG deserved full credit, but all results presented by them appeared to relay on a Centralized Memory Management Algorithm （CMMA） which was essentially impractical because of the high processing and communication complexity. This paper attempts to make a scalable high-speed SB router completely practical by introducing a fully distributed architecture for managing the shared memory of SB routers. The resulting SB router is called as a Virtual Output and Input Queued （VOIQ） router. Furthermore, the scheme of VOIQ routers can not only eliminate the need for the CMMA scheduler, thus allowing a fully distributed implementation with low processing and commu- nication complexity, but also provide QoS guarantees and efficiently support variable-length packets in this paper. In particular, the results of performance testing and the hardware implementation of our VOIQ-based router （NDSC~ SR1880-TTM series） are illustrated at the end of this paper. The proposal of this paper is the first distributed scheme of how to design and implement SB routers publicized till now.展开更多
The Statistical Priority-based Multiple Access Protocol(SPMA)is the de facto standard for Tactical Target Network Technology(TTNT)and has also been implemented in ad hoc networks.In this paper,we present a non-preempt...The Statistical Priority-based Multiple Access Protocol(SPMA)is the de facto standard for Tactical Target Network Technology(TTNT)and has also been implemented in ad hoc networks.In this paper,we present a non-preemptive M/M/1/K queuing model to analyze the performance of different priorities in SPMA in terms of average packet loss rate and delay.And based on this queuing model,we designed a percentile scoring system combined with Q-learning algorithm to optimize the protocol parameters.The simulation results show that our theoretical model is closely matched with the reality,and the proposed algorithm improves the efficiency and accuracy in finding the optimal parameter set of SPMA protocol.展开更多
The data processing mode is vital to the performance of an entire coalmine gas early-warning system, especially in real-time performance. Our objective was to present the structural features of coalmine gas data, so t...The data processing mode is vital to the performance of an entire coalmine gas early-warning system, especially in real-time performance. Our objective was to present the structural features of coalmine gas data, so that the data could be processed at different priority levels in C language. Two different data processing models, one with priority and the other without priority, were built based on queuing theory. Their theoretical formulas were determined via a M/M/I model in order to calculate average occupation time of each measuring point in an early-warning program. We validated the model with the gas early-warning system of the Huaibei Coalmine Group Corp. The results indicate that the average occupation time for gas data processing by using the queuing system model with priority is nearly 1/30 of that of the model without priority.展开更多
文摘The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.
基金Supported by the National Natural Science Foundation of China (No.60472057).
文摘This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.
基金supported by Science and Technology Project of State Grid Corporation Headquarters under Grant 5108-202218280A-2-170-XG(Development and Application of Power Time-Sensitive Network Switching Chip。
文摘The progress of modern industry has given rise to great requirements for network transmission latency and reliability in domains such as smart grid and intelligent driving.To address these challenges,the concept of Time-sensitive networking(TSN)is proposed by IEEE 802.1TSN working group.In order to achieve low latency,Cyclic queuing and forwarding(CQF)mechanism is introduced to schedule Timetriggered(TT)flows.In this paper,we construct a TSN model based on CQF and formulate the flow scheduling problem as an optimization problem aimed at maximizing the success rate of flow scheduling.The problem is tackled by a novel algorithm that makes full use of the characteristics and the relationship between the flows.Firstly,by K-means algorithm,the flows are initially partitioned into subsets based on their correlations.Subsequently,the flows within each subset are sorted by a new special criteria extracted from multiple features of flow.Finally,a flow offset selecting method based on load balance is used for resource mapping,so as to complete the process of flow scheduling.Experimental results demonstrate that the proposed algorithm exhibits significant advantages in terms of scheduling success rate and time efficiency.
基金Project supported by the Special Funds for Basic Operating Expenses of the Centre University of China (Grant No.23ZYJS006)。
文摘Experiments are conducted on the evacuation rate of pedestrians through exits with queued evacuation pattern and random evacuation pattern. The experimental results show that the flow rate of pedestrians is larger with the random evacuation pattern than with the queued evacuation pattern. Therefore, the exit width calculated based on the minimum evacuation clear width for every 100 persons, which is on the assumption that the pedestrians pass through the exit in one queue or several queues, is conservative. The number of people crossing the exit simultaneously is greater in the random evacuation experiments than in the queued evacuation experiments, and the time interval between the front row and rear row of people is shortened in large-exit conditions when pedestrians evacuate randomly. The difference between the flow rate with a queued evacuation pattern and the flow rate with a random evacuation pattern is related to the surplus width of the exit, which is greater than the total width of all accommodated people streams. Two dimensionless quantities are defined to explore this relationship. It is found that the difference in flow rate between the two evacuation patterns is stable at a low level when the surplus width of the exit is no more than 45% of the width of a single pedestrian stream. There is a great difference between the flow rate with the queued evacuation pattern and the flow rate with the random evacuation pattern in a scenario with a larger surplus width of the exit. Meanwhile, the pedestrians crowd extraordinarily at the exit in these conditions as well, since the number of pedestrians who want to evacuate through exit simultaneously greatly exceeds the accommodated level. Therefore, the surplus width of exit should be limited especially in the narrow exit condition, and the relationship between the two dimensionless quantities mentioned above could provide the basis to some extent.
基金Project supported by the National Natural Science Foundation of China(Grant No.72361031)the Gansu Province University Youth Doctoral Support Project(Grant No.2023QB-049)。
文摘In recent years, the traffic congestion problem has become more and more serious, and the research on traffic system control has become a new hot spot. Studying the bifurcation characteristics of traffic flow systems and designing control schemes for unstable pivots can alleviate the traffic congestion problem from a new perspective. In this work, the full-speed differential model considering the vehicle network environment is improved in order to adjust the traffic flow from the perspective of bifurcation control, the existence conditions of Hopf bifurcation and saddle-node bifurcation in the model are proved theoretically, and the stability mutation point for the stability of the transportation system is found. For the unstable bifurcation point, a nonlinear system feedback controller is designed by using Chebyshev polynomial approximation and stochastic feedback control method. The advancement, postponement, and elimination of Hopf bifurcation are achieved without changing the system equilibrium point, and the mutation behavior of the transportation system is controlled so as to alleviate the traffic congestion. The changes in the stability of complex traffic systems are explained through the bifurcation analysis, which can better capture the characteristics of the traffic flow. By adjusting the control parameters in the feedback controllers, the influence of the boundary conditions on the stability of the traffic system is adequately described, and the effects of the unstable focuses and saddle points on the system are suppressed to slow down the traffic flow. In addition, the unstable bifurcation points can be eliminated and the Hopf bifurcation can be controlled to advance, delay, and disappear,so as to realize the control of the stability behavior of the traffic system, which can help to alleviate the traffic congestion and describe the actual traffic phenomena as well.
基金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.
文摘Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.
基金supported by the Science and Technology Project of North China Electric Power Research Institute,which is“Research on Key Technologies for Power Quality Evaluation and Improvement of New Distribution Network Based on Collaborative Interaction of Source-Network-Load-Storage”(KJZ2022016).
文摘The couple between the power network and the transportation network(TN)is deepening gradually with the increasing penetration rate of electric vehicles(EV),which also poses a great challenge to the traditional voltage control scheme.In this paper,we propose a coordinated voltage control strategy for the active distribution networks considering multiple types of EV.In the first stage,the action of on-load tap changer and capacitor banks,etc.,are determined by optimal power flow calculation,and the node electricity price is also determined based on dynamic time-of-use tariff mechanism.In the second stage,multiple operating scenarios of multiple types of EVs such as cabs,private cars and buses are considered,and the scheduling results of each EV are solved by building an optimization model based on constraints such as queuing theory,Floyd-Warshall algorithm and traffic flow information.In the third stage,the output power of photovoltaic and energy storage systems is fine-tuned in the normal control mode.The charging power of EVs is also regulated in the emergency control mode to reduce the voltage deviation,and the amount of regulation is calculated based on the fair voltage control mode of EVs.Finally,we test the modified IEEE 33-bus distribution system coupled with the 24-bus Beijing TN.The simulation results show that the proposed scheme can mitigate voltage violations well.
文摘The “Internet of Things” (IoT) refers to a set of intelligent “objects” that can communicate with each other directly or through a network. The IoT is the embodiment of the idea that everything can be connected anywhere and at any time. The concept can be applied to sectors such as e-health, e-government, automotive, geographic information systems, remote sensing, home networking, e-commerce and climate change mitigation. Unlike the Internet, the IoT has its own constraints, notably those linked to heterogeneity. This divergence is linked to different protocols, technologies and algorithms implemented in these connected objects for their interconnection. It should be noted that IoT devices can communicate with each other using different protocols and dedicated M2M (Machine to Machine) communication technologies. The aim of this work is to find solutions for optimising energy consumption during data exchanges between connected objects, with respect to certain constraints by using firstly this exchange for only Message Queuing Telemetry Transport (MQTT) and secondly the combination of the MQTT protocol and the Constrained Application Protocol (CoAP) protocol to check the quantity of the energy optimized. The MQTT protocol, for example, is one of the most widely used protocols for connected objects. Admittedly, this protocol consumes less energy, but in the situation of a very large number of users, the problem of saturation inevitably arises. In this article, we propose a solution of optimising energy consumption by combining the MQTT protocol with the CoAP protocol which can allow to use the standby mode contrary to the use of MQTT where the broker is always being turning. This solution has not yet been implemented but is being discussed. In this article, we’re going to use the joulemeter which is an application developed by Microsoft to measure and estimate the energy consumption of computers and applications. In our case, we take the example of the “Service Broker for network connections” of the Windows’s 10 Operating System, in my own computer to show the difference between the consumption of energy without the standby mode and with standby mode, because with the MQTT, the Broker’s MQTT is always on. Now, with the combination MQTT and CoAP, it is possible that we have standby mode and to compare these two cases in term of consumption of an energy. And to do it, we must use the joulemeter that we installed in our computer to simulate it. This is achieved by using the CoAP protocol combined with the MQTT protocol. The aim of our work is to reduce energy consumption in order to solve the problem of saturation of the MQTT by linking it to CoAP protocol by using Joulemeter mentioned above.
文摘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.
文摘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.
文摘This paper deals with a type of servicing machines model, which service station has a life time of the kth Er-langian distribution and can be repaired just like a new one. The cyclic time and the inefficiency quantities of this system in equilibrium are obtained.
基金the National High-Tech Research and De-velopment Program of China (863 Program) (2003AA103510, 2004AA103130, 2005AA121210).
文摘A Single-Buffered （SB） router is a router where only one stage of shared buffering is sandwiched between two interconnects in comparison of a Combined Input and Output Queued （CIOQ） router where a central switch fabric is sandwiched between two stages of buffering. The notion of SB routers was firstly proposed by the High-Performance Networking Group （HPNG） of Stanford University, along with two promising designs of SB routers： one of which was Parallel Shared Memory （PSM） router and the other was Distributed Shared Memory （DSM） router. Admittedly, the work of HPNG deserved full credit, but all results presented by them appeared to relay on a Centralized Memory Management Algorithm （CMMA） which was essentially impractical because of the high processing and communication complexity. This paper attempts to make a scalable high-speed SB router completely practical by introducing a fully distributed architecture for managing the shared memory of SB routers. The resulting SB router is called as a Virtual Output and Input Queued （VOIQ） router. Furthermore, the scheme of VOIQ routers can not only eliminate the need for the CMMA scheduler, thus allowing a fully distributed implementation with low processing and commu- nication complexity, but also provide QoS guarantees and efficiently support variable-length packets in this paper. In particular, the results of performance testing and the hardware implementation of our VOIQ-based router （NDSC~ SR1880-TTM series） are illustrated at the end of this paper. The proposal of this paper is the first distributed scheme of how to design and implement SB routers publicized till now.
基金supported by national fundamental research key project (No. JCKY2017203B082)
文摘The Statistical Priority-based Multiple Access Protocol(SPMA)is the de facto standard for Tactical Target Network Technology(TTNT)and has also been implemented in ad hoc networks.In this paper,we present a non-preemptive M/M/1/K queuing model to analyze the performance of different priorities in SPMA in terms of average packet loss rate and delay.And based on this queuing model,we designed a percentile scoring system combined with Q-learning algorithm to optimize the protocol parameters.The simulation results show that our theoretical model is closely matched with the reality,and the proposed algorithm improves the efficiency and accuracy in finding the optimal parameter set of SPMA protocol.
基金Project 70533050 supported by the National Natural Science Foundation of China
文摘The data processing mode is vital to the performance of an entire coalmine gas early-warning system, especially in real-time performance. Our objective was to present the structural features of coalmine gas data, so that the data could be processed at different priority levels in C language. Two different data processing models, one with priority and the other without priority, were built based on queuing theory. Their theoretical formulas were determined via a M/M/I model in order to calculate average occupation time of each measuring point in an early-warning program. We validated the model with the gas early-warning system of the Huaibei Coalmine Group Corp. The results indicate that the average occupation time for gas data processing by using the queuing system model with priority is nearly 1/30 of that of the model without priority.
