• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.235-244
• /
• 2004

There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.

• Journal of Korean Society for Quality Management
• /
• v.31 no.4
• /
• pp.164-175
• /
• 2003

This paper investigates bootstrap confidence intervals of the process capability index(PCI) based on the expected loss derived from the empirical distribution function(EDF). The PCI based on the expected loss is too complex to derive its confidence interval analytically, so the bootstrap method is a good alternative. We propose three types of the bootstrap confidence interval; the standard bootstrap(SB), the percentile bootstrap(PB), and the acceleration biased­corrected percentile bootstrap(ABC). We also perform a comprehensive simulation study under various process distributions, in order to compare the accuracy of the coverage probability of the bootstrap confidence intervals. In most cases, the coverage probabilities of the bootstrap confidence intervals from the EDF PCI turned out to be more accurate than those from the PCI based on the normal distribution. It is expected that the bootstrap confidence intervals from the EDF PCI can be utilized in real processes where the true distribution family may not be known.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1148-1159
• /
• 1997

In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

• Earthquakes and Structures
• /
• v.10 no.5
• /
• pp.1181-1212
• /
• 2016

Fragility and loss functions are developed to predict damage and economic losses due to earthquake loading in Reinforced Concrete (RC) structural components with smooth rebars. The attention is focused on external/internal beam-column joints and ductile/brittle weak columns, designed for gravity loads only, using low-strength concrete and plain steel reinforcing bars. First, a number of damage states are proposed and linked deterministically with commonly employed methods of repair and related activities. Results from previous experimental studies are used to develop empirical relationships between damage states and engineering demand parameters, such as interstory and column drift ratios. Probability distributions are fit to the empirical data and the associated statistical parameters are evaluated using statistical methods. Repair costs for damaged RC components are then estimated based on detailed quantity survey of a number of pre-70 RC buildings, using Italian costing manuals. Finally, loss functions are derived to predict the level of monetary losses to individual RC components as a function of the experienced response demand.

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

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.82-89
• /
• 2003

In this paper, an efficient threshold-based filtering (TF) buffer management scheme is proposed. The TF is capable of minimizing the overall loss performance and improving the fairness of buffer usage in a shared buffer packet switch. The TF consists of two mechanisms. One mechanism is to classify the output ports as sctive or inactive by comparing their queue lengths with a dedicated buffer allocation factor. The other mechanism is to filter the arrival packets of inactive output ports when the total queue length exceeds a threshold value. A theoretical queuing model of TF is formulated and resolved for the overall packet loss probability. Computer simulations are used to compare the overall loss performance of TF, dynamic threshold (DT), static threshold (ST) and pushout (PO). We find that TF scheme is more robust against dynamic traffic variations than DT and ST. Also, although the over-all loss performance between TF and PO are close to each other, the implementation of TF is much simpler than the PO.

• Nuclear Engineering and Technology
• /
• v.46 no.1
• /
• pp.39-46
• /
• 2014

A total loss of all heat sinks is considered a severe accident with a low probability of occurrence. Following a total loss of all heat sinks, the degasser/condenser relief valves (DCRV) become the sole means available for the depressurization of the primary heat transport system. If a nuclear power plant has a total loss of heat sinks accident, high-temperature steam and differential pressure between the primary heat transport system (PHTS) and the steam generator (SG) secondary side can cause a SG tube creep rupture. To protect the PHTS during a total loss of all heat sinks accident, a sufficient depressurization capability of the degasser/condenser relief valve and the SG tube integrity is very important. Therefore, an accurate estimation of the discharge through these valves is necessary to assess the impact of the PHTS overprotection and the SG tube integrity of the primary circuit. This paper describes the analysis of DCRV discharge capacity and the SG tube integrity under a total loss of all heat sink using the CATHENA code. It was found that the DCRV's discharge capacity is enough to protect the overpressure in the PHTS, and the SG tube integrity is maintained in a total loss of all heat accident.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.36 no.5
• /
• pp.59-70
• /
• 2020

The purpose of this study is to derive the environmental factors affecting child loss through correlation analysis between child loss and pedestrian density. The status of lost children was identified through the lost child records and interviews in large parks. In addition, the behavior survey was conducted by photographing the entire outdoor of each park, and visitors was marked on the behavioral maps. Also, the pedestrian density was analyzed by GIS as 100㎡ and 1㎡ grid. As a result, child loss was related to the pedestrian density rather than the number of visitors or the area. Especially, 'Dynamic pedestrian density' and 'Ratio of pedestrian in high density to area' was related to child loss. In other words, the more dynamic behaviors such as play and movement appear, and the more the local area of high density, the higher the probability of child loss. In addition, environmental factors that induce such high density include bottlenecks, overlap of circulation due to multi-functionality of space, concentration of rides, and concentration of guardians due to visual obstacles.

• The Journal of the Korea Contents Association
• /
• v.6 no.3
• /
• pp.1-11
• /
• 2006

With the improvement of information telecommunication technology, the various service in broadband integrated services digital networks have a wide range of delay, delay jitter and cell loss probability requirements according to traffic specification. Therefore, the design of appropriate control schemes that can satisfy the cell loss, delay requirements with various traffic specification for B-ISDN is an extremely important challenging problem. In this paper, we propose a priority control scheme using a window counter and a cell counter per each type of class. In the proposed priority control scheme, for satisfying required service quality, we performed the priority control scheme using the delay/loss factors obtained by comparing window counter with cell counter. The performance of proposed control scheme is estimated by computer simulation. In the results of simulation, we verified that the proposed method satisfied per class requirements as the results showed that cell loss probability has a order of video, data, voice and delay time has a order of video, voice and data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.331-337
• /
• 2005

The optical Internet is considered as a feasible solution for transporting huge amount of traffic volume in the future Internet. Among optical switching technology for the optical Internet, OBS becomes one of the most promoting solution. Recently, a lebeled OBS(LOBS) architecture is considered for an efficient control on OBS network. Given that a data burst may contain few thousands of IP packets, a single loss of data burst results in a serious throughput degradation in LOBS network. In this paper, we improve the performance of LOBS network by introducing the burst congestion control mechanism. More specifically, the OBS router at the network core detects the network congestion by measuring the loss probability of burst control packet. The OBS router at the network edge reduces the burst generation according to the network condition repored by the OBS router at the network core. Through the simulations, it is shown that the proposed congestion control mechanism can reduce the burst loss probability and improve the LOBS network throughput.