• English Language & Literature Teaching
• /
• v.11 no.3
• /
• pp.1-23
• /
• 2005

This paper is a qualitative and quantitative study. The main purpose of the paper is to diagnose what makes English communication difficult at the Korean EFL adult level. In order to obtain data, this study employed interviews and a questionnaire. We identified thirty three factors blocking pathways to oral communication. Qualitative analysis repeatedly revealed patterns such as lack of grammar, lack of vocabulary, lack of background knowledge, and peer pressure, but quantitative analysis yielded somewhat different results: lack of colloquial expressions, lack of vocabulary, lack of various topics, problems in the educational system, difficulty in using existing knowledge, and lack of grammar. Findings which were common to both qualitative and quantitative analyses suggest that lack of linguistic knowledge and lack of background knowledge are major barriers learners encounter in communication. On the basis of the results, suggestions are made for overcoming these barriers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.67-74
• /
• 2009

This paper presents a method of improving the service availability by distributing the traffic of voice/data calls over the multi-layer cells in a mobile communication network. The traffic model is described and the call handling performance is analyzed. In our method, a fast moving call is moved to and serviced in the upper layer cell. A call is also moved upward when an overflow occurs. But unlike other methods, the call that is moved upward in the overflow case is the one which has the longest sojourn time in the cell. Moreover, when the call that was moved upward due to overflow condition stays longer than a certain period of time in the upper layer cell, the system moves the call back to the lower layer in order to save the more expensive resources of the upper layer cell. Call handling performance of this method evaluated from M/M/C/K models shows clear improvement with respect to call blocking probability and forced termination probability.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.535-539
• /
• 2007

We study an degree of alternativeness and a survivability of alternate routing algorithm in mobile ad-hoc tactical communication networks. The common channel signaling scheme is used and flood search routing algorithm is used for analysis. We also study a connectivity performance for flood search routing, restricted flooding and hybrid routing. From the results we expect low blocking probabilities with alternate routing and the conventional flood search routing shows better connectivity performance which results in high survivability.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2009.06a
• /
• pp.359-360
• /
• 2009

홈 네트워크 구축의 핵심 부품인 전력선 통신용 블로킹 필터를 제조하였으며, 신호 감쇄 특성을 측정하고 적용가능성을 평가 하였다. 전자장 모의 해석을 통하여 자심재료에 대한 포화자속밀도 특성을 분석 하였으며, 최소의 크기를 갖는 I 형상의 자심재료에 $3.2\Phi$의 나동선을 10.5턴 권선하여 대용량 인덕터를 제조하고, $4.3\;{\mu}H$의 인덕턴스를 구현하였다. 설계된 대용량 인덕터를 적용하여 30A급의 블로킹 필터를 제조하였고, 1.7 MHz ~ 30 MHz 대역에서의 -60 dB의 신호감쇄 특성을 얻었다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.73-80
• /
• 2005

In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1250-1256
• /
• 2001

A resource management scheme for ad hoc wireless local area networks (AWLAN's) is presented. This scheme combines distributed resource management scheme and orthogonal frequency division multiplexing-code division multiple access(OFDM-CDMA) technique to support multimedia services with QoS guarantees. The performance evaluation has done in terms of blocking rates and QoS loss probability.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.833-836
• /
• 1999

In this paper, the communication performance and its characteristics of the polar Low Earth Orbit(LEO) mobile satellite have been described in terms of the generalized performance parameters via geometric modeling and analysis. Especially, the general formula related to the parameters such as the number of orbits(M) and the number of satellites per orbit(N) were derived in the LEO satellite system for voice service, and then we applied the general result to IRIDIUM system(M＝6, N＝11) that would be scheduled to commercialize soon. The offered traffic of Inter Satellite Link(ISL), ISL link blocking probability as well as both new call blocking probability and the probability of forced termination for the on going call are calculated as the result of performance analysis.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.185-188
• /
• 2004

Sufficient bandwidth that can support multimedia service has to be provided in the next generation wireless communication system. In this paper, the effective handoff scheme considering the position of mobile terminal is proposed. In addition, the dynamic channel allocation scheme is proposed. The shared channel in this algorithm can reduce more the blocking probability and the dropping probability. The proposed algorithms are simulated by SMPL library in C language. The simulation results show that the blocking probability and the dropping probability of the call can be reduced up to $60\%\;and\;10\%$ using the proposed algorithms, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1508-1516
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that supports multipath transmission. If a bufferbloat occurs in one of the subflows of MPTCP, HoL blocking occurs at the receiver due to the difference in packet arrival time among paths. In MPTCP, HoL blocking degrades not only the performance of the path where bufferbloat occurs, but also the performance of other paths. In this paper, we propose a bandwidth measurement based scheduler to solve this problem. Bandwidth measurement based scheduler is designed to measure the bandwidth of each subflow and to perform packet scheduling based on it. In order to verify the proposed scheduler, we implemented the proposed scheduler in the Linux kernel and constructed a testbed in which bufferbloat occurs. Experimental results show that the proposed scheduler has better performance than the legacy MPTCP in bufferbloat environment.