• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.176-183
• /
• 1999

Using Asynchronous Transfer Mode(ATM) which is a high-bandwidth, low-delay, cell switching and multiplexing technology, Broadband-Integrated Services Digital Network (B-ISDN) can support communication services of all kinds. To evaluate the performance of ATM networks, traffic source models to meet the requirements are demanded. We can obtain random traffic distribution for ATM networks by using the Cellular Automata (CA) which have effective random pattern generation capability. In this paper we propose an algorithm using 2-D LHCA to generate more effective random patterns with good random characteristics. And we show that the randomness by 2-D LHCA is better than that of the randomness by 1-D LHCA.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.35-38
• /
• 2004

The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.29 no.4
• /
• pp.1-20
• /
• 2021

Due to the recent rapid increase in passenger and cargo air transport demand, the capacity of Jeju International Airport has been approaching its limit. Even though in COVID-19 crisis which has started from Nov 2019, Jeju International Airport still suffers from strong demand in terms of air passenger and cargo transportation. However, it is an undeniable fact that the delay has also increased in Jeju International Airport. In this study, we analyze the correlation between weather and delayed departure operation based on both datum collected from the historical airline operation information and aviation weather statistics of Jeju International Airport. Adopting machine learning techniques, we then analyze weather condition Jeju International Airport and construct a delay prediction model. The model presented in this study is expected to play a useful role to predict aircraft departure delay and contribute to enhance aircraft operation efficiency and punctuality in the Jeju International Airport.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.310-316
• /
• 2005

In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

• Journal of Advanced Navigation Technology
• /
• v.14 no.3
• /
• pp.358-366
• /
• 2010

In the wireless network the congestion and delay occurs mainly when there are too many packets for the network to process or the sender transmits more packets than the receiver can accept. The congestion and delay is the reason of packet loss which degrades the performance of multimedia streaming. This paper proposes a novel transmission rate monitoring-based optimization mechanism to optimize packet loss and to improve QoS. The proposed scheme is based on the trade-off relationship between transmission rate monitoring and overhead monitoring. For this purpose this paper processes a source rate control-based optimization which optimizes congestion and delay. Performance evaluated RED, TFRC, and the proposed mechanism. The simulation results show that the proposed mechanism is more efficient than REC(Random Early Detection) mechanism and TFRC(TCP-friendly Rate Control) mechanism in packet loss rate, throughput rate, and average response rate.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that simultaneously transmits data using multiple interfaces. MPTCP is superior to existing TCP in network environment with homogeneous subflows, but it shows worse performance compared to existing TCP in network environment with bufferbloat. If a bufferbloat occurs in one of the MPTCP multipaths, the packet will not arrive at the MPTCP receive buffer due to a sudden increase in delay time, resulting in a HoL blocking phenomenon. It makes the receive window of the other path to be zero. In this paper, we apply Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral Controller Enhanced (PIE) among the proposed Active Queue Management (AQM) to limit the delay of bufferbloat path. Experiments were conducted to improve the performance of MPTCP in heterogeneous networks. In order to carry out the experiment, we constructed a Linux-based testbed and compared the MPTCP performance with that of the existing droptail.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2473-2483
• /
• 2000

In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.807-815
• /
• 2012

In this paper, we propose a scheme for partially dynamic lane control for energy saving in multilane-based high-speed Ethernet. In this scheme, among the given transmission lanes, at least one lane is always operating, and the remaining lanes are dynamically activated to alleviate the network performance in terms of queuing delay and packet loss in the range of acceptance. The number of active lanes is determined by the decision algorithm based on the information regarding traffic and queue status. The reconciliation sublayer adjusts the transmission lane with the updated number of lanes received from the algorithm, which guarantees no processing delay in the media access control layer, no overhead, and minimal delay of the exchanging control frames. The proposed scheme is simulated in terms of queuing delay, packet loss rate, lane changes, and energy saving using an OPNET simulator. Our results indicate that energy savings of around 55% (or, when the offered load is less than 0.25, a significant additional savings of up to 75%) can be obtained with a queuing delay of less than 1 ms, a packet loss of less than $10^{-4}$, and a control packet exchange time of less than $0.5{\mu}s$ in random traffic.

• Journal of Korean Society of Transportation
• /
• v.10 no.3
• /
• pp.7-20
• /
• 1992

The common cycle time for the linded signals is usually determined for the critical intersecion, just because the cpacity of a signalized intersection depends on the cycle time. This may not be optimal since the interactions between the flow and the spatial structure of the route or the area are disregarded in this case. It is common to separate the total delay incurred at signals into two parts, a deterministic or uniform delay and a stochastic or random delay. The deterministic delays and the stochastic delays on the artery particularly related to signal cycle time. For this purpose a microscopic simulation technique is used to evaluate deterministic delays, and a macroscopic simulation technique based on the principles of Markov chains is used to evaluate stochastic delays with over flow queue. As a result of investigating the relations between deterministic delays and cycle time in the various circumstances of spacing of signals and traffic volume. As for stochastic delays the resalts of comparisons of the macroscopic simulation and Newell's approximation with the microscopic simulation indicate that the former is valid for the degree of saturation less than 0.95 and the latter is for that above 0.95. Newell's argument that the total stochastic delay on an arterial is dominated by that at or caused by critical intersection is certified by the simulation experiments. The comprehensive analyses of the values of optimal cycle time with various conditions lead to a model. The cycle time determined by this model shows to be approximately 70% of that calculated by Webster's.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4484-4501
• /
• 2019

In this paper, we put forward a delay-aware secure maximum distance separable (MDS) coded caching scheme to resist the eavesdropping attacks for device-to-device (D2D) content sharing by combining MDS coding with distributed caching. In particular, we define the average system delay to show the potential coupling of delay-content awareness, and learn the secure constraints to ensure that randomly distributed eavesdroppers cannot obtain enough encoded packets to recover their desired contents. Accordingly, we model such a caching problem as an optimization problem to minimize the average system delay with secure constraints and simplify it to its convex relaxation. Then we develop a delay-aware secure MDS coded caching algorithm to obtain the optimal caching policy. Extensive numerical results are provided to demonstrate the excellent performance of our proposed algorithm. Compared with the random coded caching scheme, uniform coded caching scheme and popularity based coded caching scheme, our proposed scheme has 3.7%, 3.3% and 0.7% performance gains, respectively.