High Throughput Scheduling Algorithms for Input Queued Packet Switches

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.

Pedestrian flow through exit:Study focused on evacuation pattern

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.

Bifurcation analysis and control study of improved full-speed differential model in connected vehicle environment

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.

Coordinated Voltage Control of Distribution Network ConsideringMultiple Types of Electric Vehicles

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.

Analysis and Optimization of Validation Procedure in Blockchain-Enhanced Wireless Resource Sharing and Transactions

To ensure the security of resource and intelligence sharing in 6G,blockchain has been widely adopted in wireless communications and applications.Although blockchain can ensure the traceability and non-tamperability of data in the concatenated blocks,it cannot guarantee the honest behaviors of users in the application before the generation of transactions.Thus,additional technologies are required to ensure that the source of blockchain data is reliable.In this paper,the detailed procedure is designed for the application-oriented task validation in the blockchainenhanced computing resource sharing and transactions in ultra dense networks(UDN).The corresponding queuing model is built and analyzed with the consideration of the wireless re-transmission and the probability of malicious deception by users.Based on the analysis results,the UDN deployment is optimized to save network cost while ensuring latency performance.Numerical results verify our analysis,and the optimized system deployment including the number and service capacities of both base stations and mobile edge computing(MEC)servers are also given with various system settings.

EBAKE-SE: A novel ECC-based authenticated key exchange between industrial IoT devices using secure element

Industrial IoT(IIoT)aims to enhance services provided by various industries,such as manufacturing and product processing.IIoT suffers from various challenges,and security is one of the key challenge among those challenges.Authentication and access control are two notable challenges for any IIoT based industrial deployment.Any IoT based Industry 4.0 enterprise designs networks between hundreds of tiny devices such as sensors,actuators,fog devices and gateways.Thus,articulating a secure authentication protocol between sensing devices or a sensing device and user devices is an essential step in IoT security.In this paper,first,we present cryptanalysis for the certificate-based scheme proposed for a similar environment by Das et al.and prove that their scheme is vulnerable to various traditional attacks such as device anonymity,MITM,and DoS.We then put forward an interdevice authentication scheme using an ECC(Elliptic Curve Cryptography)that is highly secure and lightweight compared to other existing schemes for a similar environment.Furthermore,we set forth a formal security analysis using the random oracle-based ROR model and informal security analysis over the Doleve-Yao channel.In this paper,we present comparison of the proposed scheme with existing schemes based on communication cost,computation cost and security index to prove that the proposed EBAKE-SE is highly efficient,reliable,and trustworthy compared to other existing schemes for an inter-device authentication.At long last,we present an implementation for the proposed EBAKE-SE using MQTT protocol.

Multiway Relay Based Framework for Network Coding in Multi-Hop WSNs

In today’s information technology(IT)world,the multi-hop wireless sensor networks(MHWSNs)are considered the building block for the Internet of Things(IoT)enabled communication systems for controlling everyday tasks of organizations and industry to provide quality of service(QoS)in a stipulated time slot to end-user over the Internet.Smart city(SC)is an example of one such application which can automate a group of civil services like automatic control of traffic lights,weather prediction,surveillance,etc.,in our daily life.These IoT-based networks with multi-hop communication and multiple sink nodes provide efficient communication in terms of performance parameters such as throughput,energy efficiency,and end-to-end delay,wherein low latency is considered a challenging issue in next-generation networks(NGN).This paper introduces a single and parallels stable server queuing model with amulti-class of packets and native and coded packet flowto illustrate the simple chain topology and complexmultiway relay(MWR)node with specific neighbor topology.Further,for improving data transmission capacity inMHWSNs,an analytical framework for packet transmission using network coding at the MWR node in the network layer with opportunistic listening is performed by considering bi-directional network flow at the MWR node.Finally,the accuracy of the proposed multi-server multi-class queuing model is evaluated with and without network coding at the network layer by transmitting data packets.The results of the proposed analytical framework are validated and proved effective by comparing these analytical results to simulation results.

Analysis on D2D Heterogeneous Networks with State-Dependent Priority Traffic

In this work,we consider the performance analysis of state dependent priority traffic and scheduling in device to device(D2D)heterogeneous networks.There are two priority transmission types of data in wireless communication,such as video or telephone,which always meet the requirements of high priority(HP)data transmission first.If there is a large amount of low priority(LP)data,there will be a large amount of LP data that cannot be sent.This situation will cause excessive delay of LP data and packet dropping probability.In order to solve this problem,the data transmission process of high priority queue and low priority queue is studied.Considering the priority jump strategy to the priority queuing model,the queuing process with two priority data is modeled as a two-dimensionalMarkov chain.A state dependent priority jump queuing strategy is proposed,which can improve the discarding performance of low priority data.The quasi birth and death process method(QBD)and fixed point iterationmethod are used to solve the causality,and the steady-state probability distribution is further obtained.Then,performance parameters such as average queue length,average throughput,average delay and packet dropping probability for both high and low priority data can be expressed.The simulation results verify the correctness of the theoretical derivation.Meanwhile,the proposed priority jump queuing strategy can significantly improve the drop performance of low-priority data.

Rider Optimization Algorithm Based Optimal Cloud Server Selection in E-Learning

Currently,e-learning is one of the most prevalent educational methods because of its need in today’s world.Virtual classrooms and web-based learning are becoming the new method of teaching remotely.The students experience a lack of access to resources commonly the educational material.In remote loca-tions,educational institutions face significant challenges in accessing various web-based materials due to bandwidth and network infrastructure limitations.The objective of this study is to demonstrate an optimization and queueing tech-nique for allocating optimal servers and slots for users to access cloud-based e-learning applications.The proposed method provides the optimization and queue-ing algorithm for multi-server and multi-city constraints and considers where to locate the best servers.For optimal server selection,the Rider Optimization Algo-rithm(ROA)is utilized.A performance analysis based on time,memory and delay was carried out for the proposed methodology in comparison with the exist-ing techniques.The proposed Rider Optimization Algorithm is compared to Par-ticle Swarm Optimization(PSO),Genetic Algorithm(GA)and Firefly Algorithm(FFA),the proposed method is more suitable and effective because the other three algorithms drop in local optima and are only suitable for small numbers of user requests.Thus the proposed method outweighs the conventional techniques by its enhanced performance over them.

Information freshness optimization of multiple status update streams in Internet of things:Generation rate control and service rate reservation

The Internet of things(IoT)has become a key infrastructure providing up-to-date and fresh information for policy analysis and decision-making of upper-layer applications.However,there are limited sensing and communication resources in IoT devices,which significantly affects the timeliness and freshness of the updated status.This work proposes two schemes,namely,the generation rate control and service rate reservation schemes,to improve the overall information freshness of multiple status update streams at the receiver.Specifically,using the recently proposed Age of Information(AoI)as the metric for evaluating information freshness,we characterized the overall information freshness,i.e.,the overall average AoI at the receiver for both schemes,by considering the urgency difference of status update and streams.Both schemes for status updates and streams,respectively,were formulated as two optimization problems.We proved that both problems are convex and the optimal generation and service rates for different streams are found by the standard convex optimization algorithm.Moreover,we proposed both approximate optimal generation and approximate optimal service rate for fast deployment in heavy and light load cases.Numerical results verify the theoretical findings and accuracy of the proposed approximate solutions,guiding the design and deployment of IoT.

Performance Assessment and Configuration Analysis in the Study of SCADA System (Supervisory Control and Data Acquisition)

Queuing models are used to assess the functionality and aesthetics of SCADA systems for supervisory control and data collection.Here,the main emphasis is on how the queuing theory can be used in the system’s design and analysis.The analysis’s findings indicate that by using queuing models,cost-performance ratios close to the ideal might be attained.This article discusses a novel methodology for evaluating the service-oriented survivability of SCADA systems.In order to evaluate the state of service performance and the system’s overall resilience,the framework applies queuing theory to an analytical model.As a result,the SCADA process is translated using the M^(X)/G/1 queuing model,and the queueing theory is used to evaluate this design’s strategy.The supplemental variable technique solves the queuing problem that comes with the subsequent results.The queue size,server idle time,utilization,and probabilistic generating factors of the distinct operating strategies are estimated.Notable examples were examined via numerical analysis using mathematical software.Because it is used frequently and uses a statistical demarcation method,this tactic is completely acceptable.The graphical representation of this perspective offers a thorough analysis of the alleged limits.

一种维序的基于组合输入输出排队的并行交换结构

提出一种按序排队(in-order queuing,简称IOQ)PPS体系结构,通过在分流控制器引入固定尺寸的缓冲区,实现负载在每个交换平面的均匀分配;中间层组合输入输出排队(combined input-and-output queuing,简称CIOQ)交换平面受控于中央调度器,在每个时间槽(timeslot),中央调度器将同一种匹配实施到每一个交换平面,称之为同步调度策略.可以证明,在该体系结构下,轮询(round robin)分派算法配合同步调度策略可以保证同一条流的信元按序从交换平面读出.进一步提出了严格最长队列优先同步调度算法,极大地减少了中央调度器需要维护的状态信息和信元重定序开销.与目前主流的PPS设计相比,IOQPPS(in-order queuing parallel packet switch)实现机制简单,易于硬件实现.模拟结果表明,IOQPPS具有最优的延迟性能.

在无线网络中一种分组公平调度的混合策略

设计了一个集中式和分布式的分组公平排队混合机制来解决无线分组网络中的资源公平调度问题.集中式公平控制采用了传统算法WFQ和SBFA的混合策略;分布式公平控制是在通信协议IEEE802.11中分布式协调功能(DCF)的基础上,加载公平调度机制来实现.混合调度策略可以保证在无线分组网络中,对多个移动主机上的多个分组流,在短期和长期、局部和全局的范围内信道资源的公平使用和共享.

Modeling and Parameter Optimization of Statistical Priority-Based Multiple Access Protocol

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.

Optimization Scheme of Large Passenger Flow in Huoying Station,Line 13 of Beijing Subway System

This paper focuses on the distribution of passenger flow in Huoying Station,Line 13 of Beijing subway system.The transformation measures taken by Line 13 since operation are firstly summarized.Then the authors elaborate the facilities and equipment of this station,especially the node layout and passenger flow field.An optimization scheme is proposed to rapidly distribute the passenger flow in Huoying Station by adjusting the operation time of the escalator in the direction of Xizhimen.The authors adopt Queuing theory and Anylogic simulation software to simulate the original and the optimized schemes of Huoying Station to distribute the passenger flow.The results of the simulation indicate that the optimized scheme could effectively alleviate the traffic congestion in the hall of Huoying Station,and the pedestrian density in other places of the hall is lowered;passengers could move freely in the hall and no new congestion points would form.The rationality of the scheme is thus proved.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

Traffic dynamics considering packet loss in finite buffer networks

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.

Application of the Queuing Theory in Characterizing and Optimizing the Passenger Flow at the Airport Security

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.

Integration of naval distributed tactical training simulation system based on advanced message queuing protocol

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.

Using Poisson Modeling and Queuing Theory to Optimize Staffing and Decrease Patient Wait Time in the Emergency Department

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.