• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.799-808
• /
• 2005

This paper proposes low latency handover procedure for seamless connectivity and QoS support between wired (e.g. Ethernet) and wireless (e.g. WLAN, WiBro(802.16-compatible), CDMA) networks by the mobile-assisted and server-initiated handover strategy. It is assumed that the server decides the best target network considering network status and user preferences. In this algorithm a mobile terminal associates with the wireless link decided at the server In advance and receives CoA as well. When handover occurs without the prediction in wired networks, the server performs fast binding update using physical handover trigger through the MIH(media independent handover) function. As a result, a mobile terminal does not need to perform L2 and L3 handover during handover so that this procedure decreases handover latency and loss.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1271-1274
• /
• 2004

현재 운용중인 대부분의 VPN은 모든 CPE(Customer Premise Equipment) VPN GW(Gateway)들이 Center VPN GW에 연결되어 있는 Star 구조를 취하고 있다. 이러한 구조에서는 모든 트래픽들이 항상 Center VPN GW를 거쳐서 전송되므로 비효율적인 트래픽 전송이 이루어진다. 또한 대용량의 멀티미디어 트래픽 전송이 빈번하거나 다수의 지점을 갖고 있는 기업의 경우 Center VPN GW에서의 오버헤드가 증가하게 된다. 이러한 문제를 해결하기 위한 방법으로는 IPSec의 IKE(Internet Key Exchange) 메커니즘을 이용하여 CPE VPN GW간 직접 터널을 맺어 줄 수 있으나, 터널 설립에 앞서 원격지 CPE VPN GW의 주소, 요구되는 보안 등급 등의 터널 설정에 필요한 정보를 관리자가 직접 설정해 주어야 한다. 이는 현재 DHCP와 같은 동적 IP 환경에서 운용되는 ADSL 기반의 VPN 환경에서 관리 오버헤드를 증가시키는 요인이 된다. 이에 본 논문에서는 CPE VPN GW 간 직접 터널 연결이 필요할 시에 자동적으로 제반 기능들이 수행될 수 있게 하는 주문형 터널 생성(On-demand Tunnel Creation) 메커니즘 제안한다. 시뮬레이션을 통해 제안하는 방안에 대하여 성능을 조사하였고, 이와 함께 기존의 Star VPN 구조, Full-mesh VPN 구조와 성능을 비교하였다. 시뮬레이션 결과, 제안하는 방안이 기존의 Star VPN 구조보다 확장성과 트래픽 전송효율성, Center VPN GW의 오버헤드 측면에서 우수한 성능을 보였으며 Full-mesh 구조의 VPN과 거의 비슷한 종단간 지연시간과 처리율을 보였다.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.506-508
• /
• 1999

In the distributed control systems where the control components, controllers and sensors are distributed on a communications network, there exist network time delays on communication lines between the system components. This paper deals with the ramp tracking controller design issue for such systems. Time delay terms are converted into the rational terms using Pade approximation method and the system is augmented with two integrators for ramp tracking. For this system, $\mu$-controller design method, which enables to meet not only performance requirements but robust stabilities simultaneously, is employed.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.951-953
• /
• 1999

In the distributed control systems where the control components, controllers and sensors are distributed on a communications network, there exist network time delays on communication lines between the system components. This paper deals with the ramp tracking controller design issue for such systems. Time delay terms are converted into the rational terms using Pade approximation method and the system is augmented with two integrators for ramp tracking. For this system, ${\mu}$-controller design method, which enables to meet not only performance requirements but robust stabilities simultaneously, is employed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.283-286
• /
• 2001

전통의 자기 디스크 형태 저장 장치로의 접근 지연 시간을 줄이고자, 최근에 서로 네트워크로 연결된 컴퓨터간의 메모리 자원들을 파일을 저장하는 장치로써 활용해 볼 수 있는 가상 장치(Network RamDisk)가 개발되었다. 이 시스템은 메모리 공간을 제공해 주는 서버의 노드들이 패리티 그룹(parity group)을 이루는 일종의 software RAID 시스템으로 한 서버의 노드 crash 에 대해 대응하는 것을 고려하지 않아 제 이의 서버가 노드 crash, 프로세스 crash 혹은 데이터 손실을 발생시키면 완전히 데이터를 잃어버리는, 신뢰성이 낮은 문제점이 있다. 본 논문은 클라이언트가 서버측의 노드 crash를 적절히 감지하고 새로운 서버로 fail over 할 수 있는 여러 가지 기법들을 설계하고 구현하였다. 또한 서버 풀(server pool)이라는 가상의 공간을 따로 관리하여 서버들에 대한 메모리 자원 요구 부하를 균등히 분산 시키는 효과도 얻도록 하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.6
• /
• pp.746-753
• /
• 2008

In this paper, we introduce the improved control method are communicated between a master and a slave robot in the teleoperation systems. When the master and slave robots are located in different places, time delay is unavoidable under the network environment and it is well known that the system can become unstable when even a small time delay exists in the communication channel. The time delay may cause instability in teleoperation systems especially if those systems include haptic feedback. This paper presents a control scheme based on the estimator with virtual master model in teleoperation systems over the network. As the behavior of virtual model is tracking the one of master model, the operator can control real master robot by manipulating the virtual robot. And LQG/LTR scheme was adopted for the compensation of un-modeled dynamics. The approach is based on virtual master model, which has been implemented on a robot over the network. Its performance is verified by the computer simulation and the experiment.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.75-86
• /
• 2018

The DDS (Data Distribution Service) specification defines a discovery method for finding participants and endpoints in a DDS network. The standard discovery mechanism uses the multicast protocol and finds all the endpoints in the network. Because of using multicasting, discovery may fail in a network with different segments. Other problems include that memory space wastes due to storing information of all the endpoints. The Topic Name Service (TNS) solves these problems by unicasting only the endpoints, which are required for communication. However, an extra delay time is inevitable in components of TNS, i.e, a front-end server, topic name servers, and a terminal server. In this paper, we analyze the performance of TNS. Delay times in the servers of TNS and time required to receive endpoint information are measured. Time to finish discovery and number of receiving endpoints compare with the standard discovery method.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.849-850
• /
• 2006

This thesis presents a new analysis method of Vegas network model in single link single source and a new version of Vegas for expanding asymptotically stable region. Actually since original Vegas model is difficult to analysis, we use a modified Vegas network model. Since there is a few tools to analyze nonlinear system with delay, developing other methods is very important and useful. We used state space model in discrete time. Using by Jury's criterion, we could find asymptotically stable region of Vegas network model. And it was a if and only if condition. Moreover, we proposed a new version of Vegas algorithm. To expand asymptotically stable region we modified the original Vegas model. The new analysis method and new Vegas algorithm were justified by ns-2 simulation. And as compare with other result, we could know our method has many advantages.

• Journal of Animal Environmental Science
• /
• v.8 no.3
• /
• pp.199-208
• /
• 2002

This paper introduces the method to make management network about milking cow farm tasks. The object of this research was to design of biological measuring system and managing network system in a livestock farm. This auto-management system provides informations about individual cows' temperature, conductivity of milk and weight for efficient management of feeding, and milking works by a micro-processor and RS -485 type serial COM. ports. And measured bio-data which are basic informations for remote raising management are saved to user PC by serial communication between the PLC and user PC. Milking cow farm is divided into three working place to each measurement work and feed. The first working place is milking station which has two thermometers, a conduct meter and a scale set. The second working place is feeding station, and the third place is cattle cage. These are combined by network system and the PLC which is used to drive network and sub-modules. Sub-modules have a micro-process to control the sensor and to interface with network. The PLC which drive network and control sequence has two serial communication port to be linked with user PC for sending the measured data and for receiving data. Above all, in this study tells the sequence operating method by the driving scenario of breeding milk cow for livestock auto-management using the PLC and network system.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.