An appointment scheduling problem is studied with the consideration of customer impatience.On the assumption that both the time of leaving queue and the time of service are exponentially distributed,in order to minimi...An appointment scheduling problem is studied with the consideration of customer impatience.On the assumption that both the time of leaving queue and the time of service are exponentially distributed,in order to minimize the joint cost,the optimal appointment schedule of the fixed number of customers is studied.The joint cost function is composed of customers expected delay time and service availability time.The expected delay time of each customer in the queue is recursively computed in terms of customer interarrival time.Furthermore,the effect of impatience on the optimal schedule as well as the total operating cost is studied.The results show that as the impatience rate increases,the optimal interarrival time becomes shorter and the interarrival time of the last few customers gradually approaches that of the customers in the middle.In addition,impatient behaviors can increase the joint cost.展开更多
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 QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservatio...A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservation by assigning suitable finishing tiniest-amps to contending cells. STF can also provide isolation between flows that share a common output, link. Misbehaving flows will be restricted to guarantee the behaving flows' bandwidth. Simulations prove the feasibility of our algorithm.展开更多
A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packe...A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.展开更多
With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and di...With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.展开更多
基金The National Natural Science Foundation of China(No.71671036)the Scientific Innovation Research of Graduate Students in Jiangsu Province(No.KYLX_0211)
文摘An appointment scheduling problem is studied with the consideration of customer impatience.On the assumption that both the time of leaving queue and the time of service are exponentially distributed,in order to minimize the joint cost,the optimal appointment schedule of the fixed number of customers is studied.The joint cost function is composed of customers expected delay time and service availability time.The expected delay time of each customer in the queue is recursively computed in terms of customer interarrival time.Furthermore,the effect of impatience on the optimal schedule as well as the total operating cost is studied.The results show that as the impatience rate increases,the optimal interarrival time becomes shorter and the interarrival time of the last few customers gradually approaches that of the customers in the middle.In addition,impatient behaviors can increase the joint cost.
文摘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.
基金Supported by National Natural Science Foundation of China under Grant No.69896246
文摘A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservation by assigning suitable finishing tiniest-amps to contending cells. STF can also provide isolation between flows that share a common output, link. Misbehaving flows will be restricted to guarantee the behaving flows' bandwidth. Simulations prove the feasibility of our algorithm.
基金National Natural Science Foundation of China ( No.60572157)Sharp Corporation of Japanthe Hi-Tech Research and Development Program(863) of China (No.2003AA123310)
文摘A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.
文摘With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.
