نتایج جستجو برای: queue length

تعداد نتایج: 318151  

Journal: :IEEE Access 2022

The rapid development of information technology has promoted the transformation traditional networks into intelligent networks. Huge data traffic is generated by various types services in networks, which can easily lead to network congestion, system instability, and other problems. These problems may incur great requirements pose challenges for queue management algorithms. Most active (AQM) alg...

1998
YANG WOO SHIN CHARLES E. M. PEARCE Yang Woo Shin

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

Journal: :Queueing Syst. 1999
Fumio Ishizaki Tetsuya Takine

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that off-periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a finite...

Journal: :European Journal of Operational Research 2007
Xeung W. Yi Nam K. Kim Bong K. Yoon Kyung C. Chae

In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded M...

1999
Fumio Ishizaki Tetsuya Takine

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that o -periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a nite-bu...

2009
Henry X. Liu Xinkai Wu Wenteng Ma Heng Hu

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic ...

Journal: :CoRR 2015
Rukhsana Ruby Victor C. M. Leung

In this paper, we analyze a scheduling algorithm which is suitable for the heterogeneous traffic network. In the large deviation setting, we are interested to see, how the asymptotic decay rate of maximum queue overflow probability achieved by this algorithm.We first derive an upper bound on the decay rate of the queue overflow probability as the queue overflow threshold approaches infinity. Th...

2017
M.A.A. Boon

In this paper we study a two-queue polling model with zero switch-over times and k-limited service (serve at most ki customers during one visit period to queue i , i = 1, 2) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید