نتایج جستجو برای: loss probability

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

Journal: :Water science and technology : a journal of the International Association on Water Pollution Research 2007
C J J Eijgenraam

After the flood disaster in 1953 in the southwestern part of the Netherlands, Van Dantzig tried to solve the economic decision problem concerning the optimal height of dikes. His solution has a fixed probability of flooding after each investment. However, when there is economic growth, not the probability of flooding but the expected yearly loss by flooding is the key variable in the real optim...

2005
VYACHESLAV M. ABRAMOV

The paper studies asymptotic behavior of the loss probability for the GI/M/m/n queueing system as n increases to infinity. The approach of the paper is based on applications of classic results of Takács (1967) and the Tauberian theorem with remainder of Postnikov (1979-1980) associated with the recurrence relation of convolution type. The main result of the paper is associated with asymptotic b...

Journal: :CoRR 2005
Vivek P. Mhatre Catherine Rosenberg

The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet success probability is continuous. Hence, over each hop, for every finite SINR,...

2007
VYACHESLAV M. ABRAMOV

The paper studies asymptotic behavior of the loss probability for the GI/M/m/n queueing system as n increases to infinity. The approach of the paper is based on applications of classic results of Takács (1967) and the Tauberian theorem with remainder of Postnikov (1979-1980) associated with the recurrence relation of convolution type. The main result of the paper is associated with asymptotic b...

1996
Anastasios D. Doulamis Nikolaos D. Doulamis George E. Konstantoulakis George I. Stassinopoulos

This paper intends to study the characteristics of VBR MPEG sources and performs models for their traffic behaviour. Our analysis focuses on long-time MPEG video films, approximately 27 min. Known probability density functions (pdf) are presented which fit well with real the pdf of I, P, B and Group of pictures (GOP) frames. In order to approximate the traffic behaviour, we study the autocovari...

2007
VYACHESLAV M. ABRAMOV

The paper studies asymptotic behavior of the loss probability for the GI/M/m/n queueing system as n increases to infinity. The approach of the paper is based on applications of classic results of Takács (1967) and the Tauberian theorem with remainder of Postnikov (1979-1980) associated with the recurrence relation of convolution type. The main result of the paper is associated with asymptotic b...

1995
Fumio Ishizaki Tetsuya Takine Hiroaki Terada Toshiharu Hasegawa

| This paper studies the cell loss probability approximation of a statistical multiplexer in high speed networks. For this purpose, we consider discrete-time nite-bu er queueing models. We rst propose a simple approximate formula for the cell loss probability in terms of the tail distribution of the queue length in the corresponding in nite-bu er queue. Since the tail distribution has a simple ...

Journal: :CoRR 2011
Md. Asaduzzaman Thierry J. Chaussalet

We develop a generalized loss network framework for capacity planning of a perinatal network in the UK. Decomposing the network by hospitals, each unit is analyzed with a GI/G/c/0 overflow loss network model. A two-moment approximation is performed to obtain the steady state solution of the GI/G/c/0 loss systems, and expressions for rejection probability and overflow probability have been deriv...

2007
Tae Ok Kim Jin Soo Park Kyung Jae Kim Bong Dae Choi

We analyze the MAC performance of the IEEE 802.15.4 LRWPAN non-beacon mode with the piggyback method in non-saturated condition. Our approach is to model a stochastic behavior of one device as a discrete time Markov chain. We propose an analytical model describing the download behavior of a device using piggyback method. We obtain the performance measures such as throughput, packet delay, energ...

Journal: :IEICE Transactions 2008
Masayuki Ueda Takuji Tachibana Shoji Kasahara

In optical burst switching (OBS) networks, burst with different numbers of hops experience unfairness in terms of the burst loss probability. In this paper, we propose a preemptive scheme based on the number of transit hops in OBS networks. In our proposed scheme, preemption is performed with two thresholds; one is for the total number of hops of a burst and the other is for the number of trans...

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

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