نتایج جستجو برای: overflow

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

2006
Pisai Setthawong Surat Tanterdtid

Resilient Packet Ring (RPR) is a dual-ring network, also known as the IEEE 802.17 Standard. As with other IEEE 802 networks, multiple RPR networks can be bridged together to form a bridged network when necessary. However, further research is necessary on additional issues that arise from bridging RPR networks. In this paper, we place emphasize on two of these issues; that is, fairness for inter...

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...

Journal: :IEEE Trans. Vehicular Technology 2002
Kunmin Yeo Chi-Hyuck Jun

We present an analytic model for the performance evaluation of hierarchical cellular systems, which can provide multiple routes for calls through overflow from one cell layer to another. Our model allows the case where both the call time and the cell residence time are generally distributed. Based on the characterization of the call time by a hyper-Erlang distribution, the Laplace transform of ...

2003
Wilfred W.K. Lin Allan K.Y. Wong

A novel FLC (Fuzzy Logic Controller) for eliminating buffer overflow at the user level is proposed. It tunes the buffer size in a dynamic manner to ensure that the buffer length always covers the queue length by the given safety margin ∆ . The FLC operation is based on the objective function: 2 } , 0 { ∆ . Our timing analysis shows that the FLC requires very short execution time for its control...

Journal: :Inf. Sci. 1992
Yannis Manolopoulos N. Fistas

Variable-length records are very frequent in database environments. This work gives a set of algorithms for maintaining a new model of static hashed files designed to accommodate variable-length records. Two special techniques for variable-length records are used. First, records are ordered by length and not by key value, e.g., the shortest (longest) records are stored in the main (overflow) bl...

Journal: :Neuroscience letters 1994
M Kudernatsch B Sutor

Stimulus-evoked dopamine overflow in rat neostriatal slices was determined using fast cyclic voltammetry. The dopamine efflux induced by intrastriatal stimulation increased with stimulus intensity and was found to be enhanced by more than 100% upon application of the dopamine uptake inhibitor nomifensine. The acetylcholine esterase inhibitor eserine concentration-dependently and reversibly depr...

2006
ANDRZEJ CHYDZINSKI

– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the dist...

Journal: :Inf. Syst. 1989
Stavros Christodoulakis Yannis Manolopoulos Per-Åke Larson

Although files with variable length records are very frequent in actual databases due to variable length fields, missing attribute values, multiple values of an attribute and compression, little has been reported in the literature about file structures appropriate for variable length records. In this paper we describe and analyze several overflow handling techniques for the case when records ar...

Journal: :CoRR 2010
Jose H. Blanchet Kevin Leder Yixi Shi

We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in [8] that a subsolution to the Isaacs equation guarantees that a subexponential number of function evaluations (in n) suffice to estimate such overflow probabilities within a given relat...

Journal: :IEICE Transactions 2005
Chien Trinh Nguyen Shinji Sugawara Tetsuya Miki

A new expression for cell/packet loss probability in an ATM and packet switched queue system with a finite buffer is presented. Cell and packet loss analysis is based on the new concept of a “buffer overflow cluster” and the overflow probability for a queue with an infinite buffer. This approach holds for a wide variety of long-range dependent traffic sources typical of wide-area networks, as w...

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

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