• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.56-63
• /
• 1997

Under most system assumptions, closed form solutions of performance measures for ATM switches with input queueing are not available. In this paper, we present expressions and bounds for the derivatives of cell loss probabilities with respect to the arrival rate evaluated at a zero arrival rate. These bounds are used to give an approximation by Taylor expansion, thereby providing an economical way to estimate cell loss probabilities in light traffic.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.215-217
• /
• 2005

There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2328-2339
• /
• 1994

The PBS(Partial Buffer Sharing) space priority mechanism is one of priority control methods which may improve the performance of a single server queueing system when mixed traffic with different performance requirements is applied to the system. This paper analyzes the cell loss behavior of PBS assuming loss sensitive traffic and delay sensitive traffic are applied to the system. To derive the successive cell loss probabilities. which are an important performance measure of realtime traffic, we develop a recursive algorithm. Performance results show the successive cell loss probabilities obtained by our method are lager than the probabilities derived from an independent cell loss assumption. These results may indicate the limitation of PBS for realtime traffic and the increase of the admissible load with the criterion of quality of service.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1915-1919
• /
• 2003

A practical method of adaptive rate allocation to source and channel codings for an independent loss channel is proposed for Internet video. It is based on the observations that the values of residual loss probabilities at the optimal code rates for different packet loss probabilities are closely clustered to the average residual loss probability for a transmission frame size n in RS(n,k) code and for a total bit rate R. These observations aye then exploited to find the code rate for maximum PSNR. Simulation results demonstrate that the proposed method achieves a near-optimal bit-rate allocation in the joint source-channel coding of H.263 and RS(n,k) codings.

• The Korean Journal of Applied Statistics
• /
• v.29 no.4
• /
• pp.679-688
• /
• 2016

In this paper, we study multiclass loss systems with different server allocation methods. The Markovian states of the systems are defined and their effective representation is investigated. The limiting probabilities are derived based on the Markovian property to determine the performance measures of the systems. The effects of the assignment methods are compared using numerical solutions.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.6
• /
• pp.9-17
• /
• 1994

ATM (Asynchronous Transfer Mode) has a fixed-length packet transport scheme. It is one of the promising proposals in B-ISDN.Since the packet length is fixed, it can be potentially to perform the various service to users. In this paper, a queueing model for an ATM multip`exer loaded by CBR and ON/OFF input sources is considered, and the two-queue system which each type of input sources has a queue with a finite capacity is analyzed. The cell loss probabilities for a performance measures of ATM multiplexer are derived, and are also evaluated through numerical examples. As a result, the cell loss probability of ON/OFF sources for the queue size is rapidly decreased when the multiplexed number and burstiness are increased. Since cells of the CBR source have lower priority than cells of the ON/OFF source, cell loss probabilities of CBR sources are accordingly high independently of CBR cell arrival rate when the number of CBR sources is large.

• International Journal of Reliability and Applications
• /
• v.2 no.1
• /
• pp.49-56
• /
• 2001

In this paper we consider empirical Bayes estimation of the hazard rate and survival probabilities with right censored data under the assumption that the hazard function is constant over the period of observation and the prior distribution is gamma. We provide an estimator of the first derivative of the prior moment generating function that converges at each point to the true value in $L_2$ and use it to obtain, easy to compute, asymptotically optimal estimators under the squared error loss function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.35-46
• /
• 1994

In this paper, the performance of DS/SS acquisition system over frequency nonselective Rician fading channel is analyzed by means of packet loss probability. The power ratio of the fading component to the specular compnent. seccessive constant fadong chips k. and correlation coefficient among k chipe are taken for channel parameters. The false alarm probabilities and detection probabilities are derived, and packet loss probability is evaluated in terms of these probablities in the stats transition diagram. From the results of the performance test, these exists the region of packet loss probability in crease because of autocorrelation sidelobe. As k increases, the packet loss probabolotoes decrease.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.539-557
• /
• 1998

This paper is concerned with the performance evaluation of loss networks. We shall review the Erlang Fixed Point (EFP) method for estimating the blocking probabilities, which is based on an assumption that links are blocked independently. For networks with linear structure, the behaviour of adjacent links can be highly correlated. We shall give particular attention to recently-developed fixed-point methods which specifically account for the dependencies between neighbouring links. For the network considered here, namely a ring network with two types of traffic, these methods produce relative errors typically $10^{-5}$ of that found using the basic EFP approximation.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.284-293
• /
• 2010

For the successful deployment of Mobile Internet, fast handover technologies are essential. For the past few years several handover mechanisms are suggested, and Fast Handover for Proxy Mobile IPv6 (PFMIPv6) is one of the promising schemes for this purpose. In this paper, we propose a novel L2/L3 cross layer handover scheme based on ARIMA prediction model to apply PFMIPv6 to Mobile Internet environment effectively. Performance gains are evaluated in terms of probabilities of predictive-mode operation, handover latencies, packet loss probabilities, and signaling costs. Three mobilities models are used for our simulation: Manhattan Model, Open Area Model, and Freeway Model. Simulation results show that the proposed scheme can increase probabilities of predictive-mode operation and reduce handover latency, packet loss probabilities, and signaling cost.