• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.274-285
• /
• 2022

Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.47-61
• /
• 1996

An ATM switch must deal with various kinds of input sources having different traffic characteristics and it must guarantee very small value of cel loss probability, about 10$^{8}$ -10$^{12}$ , to deal with loss-sensitive traffics. In order to estimate such a rate event probability with simulation procedure, a variance reduction technique is essential for obtaining an appropriate level of precision with reduced cost. In this paper, we propose a hybrid simulation technique to achieve reduction of variance of cell loss probability estimator, where hybrid means the combination of analytical method and simulation procedure. A discrete time queueing model with multiple input sources and a finite shared buffer is considered, where the arrival process at an input source and a finite shared buffer is considered, where the arrival process at an input source is governed by an Interrupted Bernoulli Process and the service rate is constant. We deal with heterogeneous input sources as well as homogeneous case. The performance of the proposed hybrid simulation estimator is compared with those of the raw simulation estimator and the importance sampling estimator in terms of variance reduction ratios.

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

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.32-37
• /
• 2004

This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.

• Journal of ILASS-Korea
• /
• v.21 no.1
• /
• pp.37-46
• /
• 2016

For the SI engines, at only full load, the pumping loss has a negligible effect, while at part load conditions, the pumping loss increases. To avoid the pumping loss, the spark-ignited engines are designed to inject gasoline directly into the combustion chamber. In the spark-ignited direct-injection engines, ignition probability is important for successful combustion and the flame propagation characteristics are also different from that of pre-mixed combustion. In this paper, a visualization experiment system is designed to study the ignition probability and combustion flame characteristics of spark-ignited direct-injection CNG fuel. The visualization system is composed of a combustion chamber, fuel supply system, air supply system, electronic control system and data acquisition system. It is found that ambient pressure, ambient temperature and ambient air flow velocity are important parameters which affect the ignition probability of CNG-air mixture and flame propagation characteristics and the injected CNG fuel can be ignited directly by a spark-plug under proper ambient conditions. For all cases of successful ignition, the flame propagation images were digitally recorded with an intensified CCD camera and the flame propagation characteristics were analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2339-2355
• /
• 2021

In this paper, a joint probabilistic data association algorithm based on loss function (LJPDA) is proposed so that the computation load and accuracy of the multi-target tracking algorithm can be guaranteed simultaneously. Firstly, data association is divided in to three cases based on the relationship among validation gates and the number of measurements in the overlapping area for validation gates. Also the contribution coefficient is employed for evaluating the contribution of a measurement to a target, and the loss function, which reflects the cost of the new proposed data association algorithm, is defined. Moreover, the equation set of optimal contribution coefficient is given by minimizing the loss function, and the optimal contribution coefficient can be attained by using the Newton-Raphson method. In this way, the weighted value of each target can be achieved, and the data association among measurements and tracks can be realized. Finally, we compare performances of LJPDA proposed and joint probabilistic data association (JPDA) algorithm via numerical simulations, and much attention is paid on real-time performance and estimation error. Theoretical analysis and experimental results reveal that the LJPDA algorithm proposed exhibits small estimation error and low computation complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.779-792
• /
• 1993

In a switching node or an ATM multiplexer of the ATM network, a good bandwidth utilization can be achieved by the priority control using the 1-bit(Cell Loss priority) in ATM cell header. In this paper, the mixed mechanism is proposed to make up for shortcomings of existing space priority control mechanisms and to decrease the loss probability of high priority cell and its performance is analyzed about the cell loss probability. To estimate the performance of proposed mixed mechanism, its cell loss probability is compared with those of non-priority mechanism, push-out mechanism and partial buffer sharing mechanism. The cell loss probability is analyzed using a M/D/1/N modeling and a 2-state MMPP/D/1/N modeling and also comparison between two modelings is made. To verify this result of numerical analysis, the computer simulation is performed for each mechanism using the simulation language, SIMSRIPT II.5.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.6
• /
• pp.517-524
• /
• 2014

The ultimate goal of seismic design is to reduce the probable losses or damages occurred during an expected earthquake event. To achieve this goal, this study represents a procedure that can estimate annual loss probability of a structure damaged by strong ground motion. First of all, probabilistic seismic performance assessment should be performed using seismic fragility analyses that are presented by a cumulative distribution function of the probability in each exceedance structural damage state. A seismic hazard curve is then derived from an annual frequency of exccedance per each ground motion intensity. An annual loss probability function is combined with seismic fragility analysis results and seismic hazard curves. In this paper, annual loss probabilities are estimated by the structural fragility curve of steel moment-resisting frames(SMRFs) in San Francisco Bay, USA, and are compared with loss estimation results obtained from the HAZUS methodology. It is investigated from the comparison that seismic losses of the SMRFs calculated from the HAZUS method are conservatively estimated. The procedure presented in this study could be effectively used for future studies related with structural seismic performance assessment and annual loss probability estimation.