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.展开更多
This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in parallel.Jobs arrive according to a Poisson process.U...This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in parallel.Jobs arrive according to a Poisson process.Upon each arrival, an admission/routing decision is made, and the accepted job is routed to one of the two servers with each being associated with a queue.After each service completion, the servers have an option of serving a job from its own queue, serving a jockeying job from another queue, or staying idle.The system performance is inclusive of the revenues from accepted jobs, the costs of holding jobs in queues, the service costs and the job jockeying costs.To maximize the total expected discounted return, we formulate a Markov decision process(MDP) model for this system.The value iteration method is employed to characterize the optimal policy as a hedging point policy.Numerical studies verify the structure of the hedging point policy which is convenient for implementing control actions in practice.展开更多
The sharing of operation and management information is required by smart grid.The amount of information transmitted in electric power communication systems will increase greatly in the near future.The integrated infor...The sharing of operation and management information is required by smart grid.The amount of information transmitted in electric power communication systems will increase greatly in the near future.The integrated information transmission technology is an important method for transmitting various kinds of information via the existing broadband channels and networks in power systems.To implement integrated information transmission in power systems,the problem about how to guarantee the quality of service(QoS)of the communication services must be dealt with.展开更多
We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponen...We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.展开更多
The close-in weapon system(CIWS)is a combat system that faces a complex environment full of dynamic and unknown challenges,whose construction and planning require a systematic design method.Multiliving agent(MLA)theor...The close-in weapon system(CIWS)is a combat system that faces a complex environment full of dynamic and unknown challenges,whose construction and planning require a systematic design method.Multiliving agent(MLA)theory is a methodology for the combat system design,which uses the livelihood degree to evaluate the multi-dimensional long-term operational effectiveness of the system;whereas,there is still no uniform quantization framework for the livelihood degree,and the adjustment methods of livelihood degree need to be further improved.In this paper,we propose the uniform quantization framework for the livelihood degree and detailed discuss the methods of livelihood adjustment.Based on the MLA theory,the multi-dimensional operational effectiveness of the missile-gun integrated weapon system(MGIWS)is analyzed,and the long-term combat effectiveness against the saturation attack is assessed.Furthermore,the planning problem of the equipment deployment and configuration is investigated.Two objectives,including the overall livelihood degree and cost-effectiveness(CE),are proposed,and the optimization method based on genetic algorithm(GA)is studied for the planning problem.展开更多
One important mission of the strategic defense is to develop an integrated, layered ballistic missile defense system（BMDS）. Considering the problem of assigning limited defense weapons to incoming ballistic missiles...One important mission of the strategic defense is to develop an integrated, layered ballistic missile defense system（BMDS）. Considering the problem of assigning limited defense weapons to incoming ballistic missiles, we illustrate how defense weapons, ballistic missiles, kill probability and effectiveness of defense（ED） are interrelated and how to understand this relationship for achieving the best allocation plan. Motivated by the queueing theory, in which the available resources are not sufficient to satisfy the demands placed upon them at all times, the layered deployed defense weapon is modeled as a queueing system to shoot Poisson arrived targets. Simultaneously, examples, of optimum intercepts allocation problems under different constraints are presented. The four theorems determine the allocation rules of intercepts to targets that maximize ED or minimize the cost to achieve a required ED.展开更多
This paper introduces the principle of ATM switch, and discusses queueing disciplines and their performances. Authors describe the method of input queueing, output queueing, central queueing, combined input/output que...This paper introduces the principle of ATM switch, and discusses queueing disciplines and their performances. Authors describe the method of input queueing, output queueing, central queueing, combined input/output queuing, combined input/shared queueing, and multistage queueing in detail. They also present the relations between mean waiting time and input load. The queueing disciplines can be used to design the architecture of Asynchronous Transfer Mode (ATM) switch.展开更多
In this paper we carried out a probabilistic analysis for a machine repair system with a general service-time distribution by means of generalized Markov renewal processes. Some formulas for the steady-state performan...In this paper we carried out a probabilistic analysis for a machine repair system with a general service-time distribution by means of generalized Markov renewal processes. Some formulas for the steady-state performance measures. such as the distribution of queue sizes, average queue length, degree of repairman utilization and so on. are then derived. Finally, the machine repair model and a multiple critcria decision-making method are applied to study machine assignment problem with a general service-time distribution to determine the optimum number of machines being serviced by one repairman.展开更多
Mobile cloud computing（MCC） combines mobile Internet and cloud computing to improve the performance of mobile applications. However, MCC faces the problem of energy efficiency because of randomly varying channels. A...Mobile cloud computing（MCC） combines mobile Internet and cloud computing to improve the performance of mobile applications. However, MCC faces the problem of energy efficiency because of randomly varying channels. A scheduling algorithm is proposed by introducing the Lyapunov optimization, which can dynamically choose users to transmit data based on queue backlog and channel statistics. The Lyapunov analysis shows that the proposed scheduling algorithm can make a tradeoff between queue backlog and energy consumption in the channel-aware mobile cloud computing system. The simulation results verify the effectiveness of the proposed algorithm.展开更多
Quick and reliable identification of the traffic state is of critical importance to traffic control systems, especially when spillovers appear. Firstly, a calculation method for the occupancy per cycle under different...Quick and reliable identification of the traffic state is of critical importance to traffic control systems, especially when spillovers appear. Firstly, a calculation method for the occupancy per cycle under different traffic conditions were presented, based on the relationship between the three basic traffic flow parameters, speed, traffic flow and density. Secondly, the times at which the stopping and starting waves approach a loop detector were confirmed using the traffic wave models modified by a kinematic equation. Then, the threshold of occupancy, which characterizes the appearance of spillovers, was determined by the premise that the stopping and starting waves had the same speed. At last, the accuracy and usability of the new method were verified by VISSIM simulation, using the ratio of misjudgment as the evaluation index. The results show that the ratio of misjudgment of the new method is about 11.36% compared to 17.65% of the previous method.展开更多
The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has no...The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has not considered the link capacities between edge routers and connected core routers. When a core router in a two layers’ network experiences congestion, the connected edge routers have no ability to adjust their access data rates. Thus, it is difficult to achieve the congestion control for the large scale network with many edge routers and core routers. To solve these problems, two difffserve AQM algorithms are proposed for the congestion control of multilayer network. One diffserv AQM algorithm implements fair link capacities of edge routers, and the other one implements unequal link capacities of edge routers, but it requires the core routers to have multi-queues buffers and Diffserv AQM to support. The proposed algorithms achieve the network congestion control by operating AQM parameters on the conditions of proposed three theorems for core and edge routers. The dynamic simulation results demonstrate the proposed control algorithms for core and edge routers to be valid.展开更多
Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower pri...Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.展开更多
This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are propos...This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.展开更多
Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfair...Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfairness issue was analyzed in test-bed experiment and NS2 simulation. A dynamic queue management scheme E-QMMN was proposed, which allocates the queue buffer according to the hop distance of every flow. The experimental results show that the proposed scheme can not only increase the hop distance fairness of the legacy scheme at most 50%, but also reduce the average round trip time at least 29% in congested WMN environments.展开更多
文摘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 National Social Science Fund of China (19BGL100)。
文摘This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in parallel.Jobs arrive according to a Poisson process.Upon each arrival, an admission/routing decision is made, and the accepted job is routed to one of the two servers with each being associated with a queue.After each service completion, the servers have an option of serving a job from its own queue, serving a jockeying job from another queue, or staying idle.The system performance is inclusive of the revenues from accepted jobs, the costs of holding jobs in queues, the service costs and the job jockeying costs.To maximize the total expected discounted return, we formulate a Markov decision process(MDP) model for this system.The value iteration method is employed to characterize the optimal policy as a hedging point policy.Numerical studies verify the structure of the hedging point policy which is convenient for implementing control actions in practice.
文摘The sharing of operation and management information is required by smart grid.The amount of information transmitted in electric power communication systems will increase greatly in the near future.The integrated information transmission technology is an important method for transmitting various kinds of information via the existing broadband channels and networks in power systems.To implement integrated information transmission in power systems,the problem about how to guarantee the quality of service(QoS)of the communication services must be dealt with.
基金supported by the National Natural Science Foundation of China(Grant No.11971486)。
文摘We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.
基金the Beijing Natural Science Foundation under contract number L191004the National Natural Science Foundation of China under contract number U1833203.
文摘The close-in weapon system(CIWS)is a combat system that faces a complex environment full of dynamic and unknown challenges,whose construction and planning require a systematic design method.Multiliving agent(MLA)theory is a methodology for the combat system design,which uses the livelihood degree to evaluate the multi-dimensional long-term operational effectiveness of the system;whereas,there is still no uniform quantization framework for the livelihood degree,and the adjustment methods of livelihood degree need to be further improved.In this paper,we propose the uniform quantization framework for the livelihood degree and detailed discuss the methods of livelihood adjustment.Based on the MLA theory,the multi-dimensional operational effectiveness of the missile-gun integrated weapon system(MGIWS)is analyzed,and the long-term combat effectiveness against the saturation attack is assessed.Furthermore,the planning problem of the equipment deployment and configuration is investigated.Two objectives,including the overall livelihood degree and cost-effectiveness(CE),are proposed,and the optimization method based on genetic algorithm(GA)is studied for the planning problem.
基金supported by the Military Graduate Student Foundation of Army
文摘One important mission of the strategic defense is to develop an integrated, layered ballistic missile defense system（BMDS）. Considering the problem of assigning limited defense weapons to incoming ballistic missiles, we illustrate how defense weapons, ballistic missiles, kill probability and effectiveness of defense（ED） are interrelated and how to understand this relationship for achieving the best allocation plan. Motivated by the queueing theory, in which the available resources are not sufficient to satisfy the demands placed upon them at all times, the layered deployed defense weapon is modeled as a queueing system to shoot Poisson arrived targets. Simultaneously, examples, of optimum intercepts allocation problems under different constraints are presented. The four theorems determine the allocation rules of intercepts to targets that maximize ED or minimize the cost to achieve a required ED.
文摘This paper introduces the principle of ATM switch, and discusses queueing disciplines and their performances. Authors describe the method of input queueing, output queueing, central queueing, combined input/output queuing, combined input/shared queueing, and multistage queueing in detail. They also present the relations between mean waiting time and input load. The queueing disciplines can be used to design the architecture of Asynchronous Transfer Mode (ATM) switch.
文摘In this paper we carried out a probabilistic analysis for a machine repair system with a general service-time distribution by means of generalized Markov renewal processes. Some formulas for the steady-state performance measures. such as the distribution of queue sizes, average queue length, degree of repairman utilization and so on. are then derived. Finally, the machine repair model and a multiple critcria decision-making method are applied to study machine assignment problem with a general service-time distribution to determine the optimum number of machines being serviced by one repairman.
基金supported by the National Natural Science Foundation of China(61173017)the National High Technology Research and Development Program(863 Program)(2014AA01A701)
文摘Mobile cloud computing（MCC） combines mobile Internet and cloud computing to improve the performance of mobile applications. However, MCC faces the problem of energy efficiency because of randomly varying channels. A scheduling algorithm is proposed by introducing the Lyapunov optimization, which can dynamically choose users to transmit data based on queue backlog and channel statistics. The Lyapunov analysis shows that the proposed scheduling algorithm can make a tradeoff between queue backlog and energy consumption in the channel-aware mobile cloud computing system. The simulation results verify the effectiveness of the proposed algorithm.
基金Project(2011AA110304) supported by the National High Technology Research and Development Program of China
文摘Quick and reliable identification of the traffic state is of critical importance to traffic control systems, especially when spillovers appear. Firstly, a calculation method for the occupancy per cycle under different traffic conditions were presented, based on the relationship between the three basic traffic flow parameters, speed, traffic flow and density. Secondly, the times at which the stopping and starting waves approach a loop detector were confirmed using the traffic wave models modified by a kinematic equation. Then, the threshold of occupancy, which characterizes the appearance of spillovers, was determined by the premise that the stopping and starting waves had the same speed. At last, the accuracy and usability of the new method were verified by VISSIM simulation, using the ratio of misjudgment as the evaluation index. The results show that the ratio of misjudgment of the new method is about 11.36% compared to 17.65% of the previous method.
基金supported by the Beijing Natural Science Foundation (4102050)NSFC-KOSEF Joint Research Project of China and Korea(60811140343), and the CDSN, GIST.
文摘The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has not considered the link capacities between edge routers and connected core routers. When a core router in a two layers’ network experiences congestion, the connected edge routers have no ability to adjust their access data rates. Thus, it is difficult to achieve the congestion control for the large scale network with many edge routers and core routers. To solve these problems, two difffserve AQM algorithms are proposed for the congestion control of multilayer network. One diffserv AQM algorithm implements fair link capacities of edge routers, and the other one implements unequal link capacities of edge routers, but it requires the core routers to have multi-queues buffers and Diffserv AQM to support. The proposed algorithms achieve the network congestion control by operating AQM parameters on the conditions of proposed three theorems for core and edge routers. The dynamic simulation results demonstrate the proposed control algorithms for core and edge routers to be valid.
基金supported by the National Natural Science Foundation of China (50421703)the National Key Laboratory of Electrical Engineering of Naval Engineering University
文摘Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.
文摘This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.
基金Projects(61163060,61103204,60963022) supported by the National Natural Science Foundation of ChinaProject(D018023) supported by the Natural Science Foundation of Guangxi Province,ChinaPostdoctoral Funding of Central South University,China
文摘Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfairness issue was analyzed in test-bed experiment and NS2 simulation. A dynamic queue management scheme E-QMMN was proposed, which allocates the queue buffer according to the hop distance of every flow. The experimental results show that the proposed scheme can not only increase the hop distance fairness of the legacy scheme at most 50%, but also reduce the average round trip time at least 29% in congested WMN environments.
