نتایج جستجو برای: moments of queue size

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

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :Operations Research 1997
Sidney Resnick Gennady Samorodnitsky

We discuss how long range dependence can innuence the characteristics of a single server queue. We take the analogue of the G/M/1 queue except that the input stream is altered to exhibit long range dependence. The equilibrium queue size and equilibrium waiting time distributions each have heavy tails. By suitably selecting the parameters of the inputs, the queue size or waiting time can be made...

Journal: :Journal of Applied Probability 2008

1996
W. K. Tsai Yan Ge G. Huang

The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. This paper shows that this protocol is only marginally stable: once a queue is congested, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induc...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز 1389

in reality, most structures involved in geotechnical engineering are three dimensional in nature, and although in many, plane strain or axisymmetric approximations are reasonable, there are some, for which 3-d treatment is required. the quantity of data, and the size of the various vectors and matrices involved in such analysis, increase dramatically. this has sever implications for computer r...

1997
Wei Kang Tsai Y. Ge Garng M. Huang

The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. Even though the EPRCA has been adopted by the ATM forum as the standard for ABR congestion control, we show that this protocol is only marginally stable. The stability analysis presented in this paper does not consider interactions among network...

2008
Eitan Altman B. J. Prabhu

Several Active Queue Management (AQM) techniques for routers in the Internet have been proposed and studied during the past few years. One of the widely studied proposals, Random Early Detection (RED), involves dropping an incoming packet with some probability based on the estimated average queue length at the router. The analytical approaches to obtaining average drop probabilities in a RED en...

Journal: :international journal of mathematical modelling and computations 0
r. kalyanaraman professor of mathematics, annamalai university india professor of mathematics 3rd v. suvitha annamalai university india research student,annamalaiuniversity

a single server queue with bernoulli vacation has been considered. in addition the admission to queue is based on a bernoulli process and the server gives two type of services. for this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. some performance measures are calculated. ...

Bita Alipasandi Neda Alipasandi Shahram Jamali,

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

2013
Eitan Altman Tania Jiménez

We consider both a cooperative as well as non-cooperative admission into an M/M/1 queue. The only information available is a signal that sais whether the queue size is smaller than some L or not. We first compute the globally optimal and the Nash equilibrium stationary policy as a function of L. We compare the performance to that of full information on the queue size. We identify the L that opt...

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

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