• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.738-748
• /
• 2002

In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches is Proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered${\alpha}{\times}{\alpha}$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes, Two important parameters of the network performance, throughput and delay, are then evaluated, To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.703-706
• /
• 2004

Tropospheric parameters, in the form of Total Zenith Delay (TZD) corrections, were estimated with the current GPS network of Korea. We estimated the TZD using the Korea Astronomy Observatory GPS Network of nine permanent stations. About four years of data were processed to get the continuous time series of the TZD. The longest time series is obtained from the site DAEJ, which has been in operation for about 10 years. We analyzed the seasonal and annual signals in the TZD estimates at DAEJ and spatial correlations among eight sites.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.243-246
• /
• 1998

A predictive controller is designed based upon stochastic methods for compensation of network time delay which caused by the spatial separation between controllers and actuators. Current commands are generated by using time varying probability functions which can be defined according to the values of previous control inputs and actual outputs. To demonstrate the effect of this control methodology, simulation experiments are performed. The results show that even an unstabilized system by a long time delay can be stabilized with this predictive controller.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.4
• /
• pp.419-426
• /
• 1999

A novel motion analysis system is presented in this paper. The proposed system is inspired by processing functions observed in the fly visual system, which detects changes in input light intensities, determines motion on both the local and the wide-field levels. The system has several differences from conventional motion analysis system. First, conventional systems usually focused on matching similar feature or optical flow, but neural network is applied in this system. Back propagation is used by learning method, and Tine Delay Neural Network (TDNN) is also used as analysis method. Second, while conventional systems usually limited on only two frames of sequence, the proposed system accept multiple frames of sequence. The experimental results showed a 94.7% correct rate with a speed of 71.47 milli seconds for real and synthetic images.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.5
• /
• pp.218-225
• /
• 2001

This paper analyses the performance of network system using the CAN(Controller Area Network) protocol. Given messages are assumed to be scheduled by the DMS(Deadline Monotonic Scheduling) algorithm. The mathematical models for time-delay that can be occurred between CAN nodes are defined. The effectiveness of modeling is shown by comparing the difference of time-delay between simulations and practical experiments. We analyse the results according to the variation of factors, such as the number of nodes, the transmission speed, the message size and the number of aperiodic messages through simulation and confirm the real-time performance of lower priority messages. We also investigate the real-time performance of periodic messages when aperiodic message generates.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.1
• /
• pp.64-72
• /
• 2016

The coverage area of a GNSS regional ionospheric delay model is mainly determined by the distribution of GNSS ground monitoring stations. Extrapolation of the ionospheric model data can extend the coverage area. An extrapolation algorithm, which combines observed ionospheric delay with the environmental parameters, is proposed. Neural network and least square regression algorithms are developed to utilize the combined input data. The bi-harmonic spline method is also tested for comparison. The IGS ionosphere map data is used to simulate the delays and to compute the extrapolation error statistics. The neural network method outperforms the other methods and demonstrates a high extrapolation accuracy. In order to determine the directional characteristics, the estimation error is classified into four direction components. The South extrapolation area yields the largest estimation error followed by North area, which yields the second-largest error.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.199-203
• /
• 2011

The wireless sensor network (WSN) based on ad hoc network is applied to vehicle parking guide system without parking guide man at area or building with large scale of parking lots. The optimum number of cluster heads was derived for getting the minimum power consumption as well as time delay. Through the theoretical analysis of power consumption and time delay with the number of cluster heads in wireless sensor network, it was found that there exists the minimum point in the variation of power consumption and time delay according to the number of cluster heads.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

• Journal of Korea Multimedia Society
• /
• v.8 no.6
• /
• pp.798-806
• /
• 2005

In this paper, we suggest a game system that can support network modules for multi-platform based video games, and built a system that can convert from a single-user game to multi-user game. In this system, we bring in an initial delay buffering scheme on clients to handle any periods of latency occurring from the load fluctuation in a network, when a real-time game is played, and shows that stable play for a game is achieved as the result of the scheme. This paper also presents a retransmission algorithm based on the history of game commands to handle drawbacks of UDP mechanism. And, we evaluate the network delay and packet loss using the simulation tool NS2, and shows the case of 0.3 second buffer delay is the most suitable for recovery.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2477-2487
• /
• 1997

In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.