• ETRI Journal
• /
• v.28 no.5
• /
• pp.593-606
• /
• 2006

Thanks to the great possibilities of providing different types of telecommunication traffic to a large geographical area, satellite networks are expected to be an essential component of the next-generation internet. As a result, issues concerning the designing and testing of efficient connection-admission-control (CAC) strategies in order to increase the quality of service (QoS) for multimedia traffic sources, are attractive and at the cutting edge of research. This paper investigates the potential strengths of a generic digital-video-broadcasting return-channel-via-satellite (DVB-RCS) system architecture, proposing a new CAC algorithm with the aim of efficiently managing real-time multimedia video sources, both with constant and high variable data rate transmission; moreover, the proposed admission strategy is compared with a well-known iterative CAC mainly designed for the managing of real-time bursty traffic sources in order to demonstrate that the new algorithm is also well suited for those traffic sources. Performance analysis shows that, both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter; however, our proposed algorithm can also manage interactive real-time multimedia traffic sources in high load and mixed traffic conditions.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.1
• /
• pp.43.1-43.1
• /
• 2013

We present here the preliminary results of the fast variability of AGN radio light curves. The shortest time scale of minute in AGN light curves is needed to probe the AGN activity for a few reasons; First, to check if there is any kind of shortest time scale activity. Secondly, to find out what high frequency end of AGN spectra look like. For the last, to see the time delay at several wavelength bands and the change of the spectral index with time. The observation was conducted with three KVN(Korea VLBI Network) antennas with single dish cross scan mode. In order not to lose the target at any given time, whenever one station needs to observe the calibrator, the other station is on the target. Though the detailed data reduction is still going on, there might exist varying feature in the radio light curve. The more fine calibration will be done in near future and another good data set is ready for the reduction.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.12-19
• /
• 2010

In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3851-3857
• /
• 2014

Shippers' requests of freight trains vary with time, but generating an additional schedule of freight trains is not easy due to many considerations, such as the line capacity, operation rules, and conflicts with existing trains. On the other hand, an additional freight train schedule has been continuously requested and manually processed by domestic train operation companies using empirical method, which is time consuming. This paper proposes a model to determine the additional freight train schedule that assesses the feasibility of the added freight trains, and generates as many additional schedules as possible, while minimizing the delay of the existing schedules. The problem is presented using time-space network, modeled as multi-commodity flow problem, and solved using the column generation method. Three levels of experiment were conducted to show validity of the proposed model in the computation time.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.26-31
• /
• 1994

A new feature extraction technique utilizing strange attractor and artificial neural network for speaker recognition is presented. Since many signals change their characteristics over long periods of time, simple time-domain processing techniques should e capable of providing useful information of signal features. In many cases, normal time series can be viewed as a dynamical system with a low-dimensional attractor that can be reconstructed from the time series using time delay. The reconstruction of strange attractor is described. In the technique, the raw signal will be reproduced into a geometric three dimensional attractor. Classification decision for speaker recognition is based upon the processing or sets of feature vectors that are derived from the attractor. Three different methods for feature extraction will be discussed. The methods include box-counting dimension, natural measure with regular hexahedron and plank-type box. An artificial neural network is designed for training the feature data generated by the method. The recognition rates are about 82%-96% depending on the extraction method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.3
• /
• pp.197-207
• /
• 2016

It is very important to maintain a constant chlorine concentration in the post chlorination process, which is the final step in the water treatment process (hereafter WTP) before servicing water to citizens. Even though a flow meter between the filtration basin and clear well must be installed for the post chlorination process, it is not easy to install owing to poor installation conditions. In such a case, a raw water flow meter has been used as an alternative and has led to dosage errors due to detention time. Therefore, the inlet flow to the clear well is estimated by a time series neural network for the plant without a measurement value, a new residual chlorine meter is installed in the inlet of the clear well to decrease the control period, and the proposed modeling and controller to analyze the chlorine concentration change in the well is a neuro fuzzy algorithm and cascade method. The proposed algorithm led to post chlorination and chlorination improvements of 1.75 times and 1.96 times respectively when it was applied to an operating WTP. As a result, a hygienically safer drinking water is supplied with preemptive response for the time delay and inherent characteristics of the disinfection process.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.6
• /
• pp.744-749
• /
• 2013

The protection switching technology is widely adopted in the fiber-optical transmission equipments based on TDM(Time Division Multiplexing), such as PDH, SDH/SONET. A variety of protection switching algorithms for Ethernet networks and the progress of standardization are summarized in the document. There are several kinds of protection switching algorithms for Ethernet networks, such as STP, RSTP, MSTP and etc. However, since Ethernet signal move through detour route, it causes much time to recover. Accordingly, it is difficult to secure a usability of Ethernet networks and QOS(Quality of Service). Also, if the protection switching protocol standardized by IEEE and ITU-T is used, it remains a inherent network switching time for protection. Therefore, a specific protection switching algorithm for Ethernet are needed for seamless and stable operation of Ethernet networks service for Distribution Automation System(DAS). A reliable protection algorithm with no switching delay time is very important to implement Self-healing service for DAS. This study of FPGA based protection switching algorithm for Ethernet networks shows that in case of faults occurrence on distribution power network, immediate fault isolation and restoration are conducted through interaction with distribution equipments using P2P(Peer to Peer) communication for protection coordination. It is concluded that FPGA based protection switching algorithm for Ethernet networks available 0ms switching time is crucial technology to secure reliability of DAS.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.753-760
• /
• 2009

As it becomes increasingly important that Internet access is available anywhere at any time, providing MANET (Mobile Ad-Hoc Network) with the Internet access attracts more attention. The existing DHCP (Dynamic Host Configuration Protocol) address configuration schemes require message exchanges between MANET nodes and the DHCP server through multi-hop routes. Messages can be easily dropped in the wireless multi-hop communication environment and the address configuration may be instable and need long delay. In this paper, we propose a new address configuration scheme using the concept of address pool allocation. In the proposed scheme, the DHCP server assigns a part of its address pool to a node instead of a single address and the node can assign a part of its own address pool to its neighbor nodes. Through simulation studies, we show that our scheme yields about 77% of the address configuration delay and 61% of the control message overhead of the existing DHCP based mechanism.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.2 s.302
• /
• pp.1-10
• /
• 2005

The current implementation of TCP for the Internet is not efficient when used for Mobile Ad hoc Networks (MANENTs). This is because TCP assumes that all packet losses are caused by congestion, whereas transmission errors are a main reason for packet losses in wireless networks. To remedy this situation and increase performance, we propose an end-to-end method of using propagation delays and the differences between propagation delays to distinguish the causes for packet losses. The proposed method has two characteristics: Firstly, it is energy-efficient because this solution is only initiated when a packet loss is detected. Secondly, our approach considers only the one way propagation delay and is more accurate in determining causes for packet losses than existing methods which consider round trip time. Petri net models of the proposed TCP and of the standard TCP have been built and simulations have been performed on them. Our simulation results show that the proposed approach increases throughput and reduces propagation delay compared with standard TCP.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.19-27
• /
• 2016

Nowadays the adaptive buffering techniques for burst stream packet configuration and its operation algorithm to save energy in IP core network have been studied. This paper explains the selection method of packet buffering interval for energy saving when configuring burst stream packet at the ingress router in IP core network. Especially the adaptive buffering interval and its implementation scheme are required to improve the energy saving efficiency at the input part of the ingress router. In this paper, we propose the best adaptive buffering scheme that a current buffering interval is adaptively buffering scheme based on the input traffic of the past buffering interval, and analyze its characteristics of energy saving and end-to-end delay by computer simulation. We show the improvement of energy saving effect and reduction of mean delay variation when using an appropriate inverse-function selecting the buffering interval for the configuration of burst stream packet in this paper. We confirm this method have superior properties compared to other method. The proposed method shows that it is less sensitive to the various input traffic type of ingress router and a practical method.