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.展开更多
In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to st...In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to stochastic orderings.Performance measures of such a system are available explicitly,while their forms are cumbersome(these formulas include integrals of Laplace transform,solutions of functional equations,etc.).Therefore,they are not exploitable from the application point of view.To overcome these difficulties,we present stochastic comparison methods in order to get qualitative estimates of these measures.In particular,we prove the monotonicity of the transition operator of the embedded Markov chain.In addition,we establish conditions for which transition operators as well as stationary probabilities,associated with two embedded Markov chains,having the same structure but with different parameters,are comparable relative to the given stochastic orderings.Further,numerical examples are carried out to illustrate the theoretical results.展开更多
高性能同轴电缆网络(High Performance Network Over Coax,HINOC)技术是一种光纤同轴混合接入技术,已发展至第3代。为了实现万兆以太网的接入速率,第3代HINOC引入了多信道绑定机制。但该机制在有效扩展HINOC网络信道带宽的同时易导致HIM...高性能同轴电缆网络(High Performance Network Over Coax,HINOC)技术是一种光纤同轴混合接入技术,已发展至第3代。为了实现万兆以太网的接入速率,第3代HINOC引入了多信道绑定机制。但该机制在有效扩展HINOC网络信道带宽的同时易导致HIMAC(HINOC Medium Access Control)拆帧端接收的数据流失序。针对该问题,文中提出了一种拆帧重排序方法。通过重排序队列缓存管理、入队逻辑地址计算、超时判断及清空以及出队判断等关键技术的设计和实现来解决多信道绑定机制引起的拆帧乱序问题,并对其关键功能点进行仿真验证和板级验证。实验结果表明,所提方法能够有效处理多信道绑定导致的乱序问题,并且能够确保系统在遇到错误情况时稳定运行,具有较强的鲁棒性,满足万兆同轴宽带接入HIMAC 3.0的功能和性能要求。展开更多
In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the di...In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.展开更多
In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliabilit...In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.展开更多
基金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.
文摘In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to stochastic orderings.Performance measures of such a system are available explicitly,while their forms are cumbersome(these formulas include integrals of Laplace transform,solutions of functional equations,etc.).Therefore,they are not exploitable from the application point of view.To overcome these difficulties,we present stochastic comparison methods in order to get qualitative estimates of these measures.In particular,we prove the monotonicity of the transition operator of the embedded Markov chain.In addition,we establish conditions for which transition operators as well as stationary probabilities,associated with two embedded Markov chains,having the same structure but with different parameters,are comparable relative to the given stochastic orderings.Further,numerical examples are carried out to illustrate the theoretical results.
文摘高性能同轴电缆网络(High Performance Network Over Coax,HINOC)技术是一种光纤同轴混合接入技术,已发展至第3代。为了实现万兆以太网的接入速率,第3代HINOC引入了多信道绑定机制。但该机制在有效扩展HINOC网络信道带宽的同时易导致HIMAC(HINOC Medium Access Control)拆帧端接收的数据流失序。针对该问题,文中提出了一种拆帧重排序方法。通过重排序队列缓存管理、入队逻辑地址计算、超时判断及清空以及出队判断等关键技术的设计和实现来解决多信道绑定机制引起的拆帧乱序问题,并对其关键功能点进行仿真验证和板级验证。实验结果表明,所提方法能够有效处理多信道绑定导致的乱序问题,并且能够确保系统在遇到错误情况时稳定运行,具有较强的鲁棒性,满足万兆同轴宽带接入HIMAC 3.0的功能和性能要求。
文摘In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.
基金Supported by the National Natura1 Science Foundation of China(70071042,60073043,60133010)
文摘In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.
