• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.27-36
• /
• 2004

Frequent occurrence of binding update messages may incur high overhead in Mobile IP supporting users mobility. Thus, it needs to develop algorithms to deal with the situation. In this paper, we propose new lifetime assignment schemes for dynamic binding update considering the locality property related with mobile node's movement. Each mobile node maintains a profile which is based on log containing useful information about its visiting subnets. That is, it determines dynamic binding update lifetime for currently visiting subnet by computing past mean resident time recorded in the profile. In addition, we note that the resident time depends on the time when each node enters a subnet and thus, we devise another lifetime assignment algorithm. Extensive experiments are made to compare our schemes with existing Mobile IPv6 where major facts for performance comparison are both the number of binding update messages and the number of binding request messages. From the results, we come to know that our schemes obtain highly considerable performance improvements in terms of communication cost by decreasing the number of those messages.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.367-373
• /
• 2008

Recently, the NAT middlebox widely deployed in the home network environment prohibits DM operations from reaching user devices behind NAT. In this article, we focus on NAT issues to manage home network devices. Particularly, we discuss standardization efforts, and present our proposal to deploy DM services for VoIP and IPTV devices under NAT. By slightly changing behaviors of Simple Network Management Protocol (SNMP) Manager and Agent, and defining additional Management Objects (MOs) to gather NAT binding information, we could solve the NAT traversal problem under symmetric NAT. Moreover, we propose an enhanced method to search the UDP hole binding time of the NAT box. We applied our method to randomly selected 22 VoIP devices out of 194 NATed hosts in the real broadband network and have achieved 99% of the success ratio for exchanging SNMP request messages and 26% of enhancement for searching the UDP hole binding time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.679-681
• /
• 2004

무선 통신 기술의 발달로 무선 인터넷에 대한 관심과 그에 따른 이동성 지원에 대한 관심이 증가하고 있다. 또한 이동성 지원을 위한 Mobile IPv6의 Handover 시에 상대노드(CN)와의 바인딩 갱신(Binding Update) 지연시간이 문제가 되고 있다. 문제 해결을 위해서 2계층과 3계층을 연동하는 Fast Handover를 이용하여, MN에서 CN으로의 바인딩 갱신 지연시간을 단축시키고자 2계층 Handover 메시지인 IEEE 802.11의 Reassociation Request 프레임을 이용한다. MN이 Binding 갱신 메시지를 보내기 전에 CN과의 보안을 위해서 Return Routability 절차을 수행하는데 이 절차 중의 메시지인 HoTI, CoTI 메시지를 2계층 Handover 중에 미리 보냄으로써 CN과의 바인딩 갱신 지연시간을 단축시키는 방안을 제안한다.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1011-1020
• /
• 2007

It is difficult to assemble independently developed software components because of discrepancies between their interfaces. In order to resolve such problem, we propose a new component model, Active Binding Technology, in which each component has its own independently-defined interface for service request that is revealed in its metadata, instead of passively following the interface of a service-providing component. This model Includes the use of the glue component, an interface mediating place, whose template code is automatically generated by reading in the metadata of the components to be combined. We also propose a runtime framework that holds the pool of component instances, completes the assembly of components in the manner of dependency injection, and performs middleware services and real-time system monitoring through glue components. In order to test the practical value of Active Binding Technology, we have made a tool, which supports the development and assembly of Active Binding components.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.674-680
• /
• 2014

In this paper, as one of the fusion of IT and ocean technology, we propose a scheme to support NEMO in a harbor area network to provide network mobility for passengers, distribution as well as give a connection to an MN from an outside network. In a harbor area under PMIPv6 with NEMO support, a problem could be occurred due to overlapping HA/LMA tunnels and duplicate BCE fields. To Solve these problems, we consider the existing mobility option and add an optional field in the PBU message, which can notify the LMA and HA for either an initial connection or handover request. This procedure can reduce some overlapped steps of binding procedure. Hence, our proposed scheme could reduce an amount of delay and save the processing resource in the harbor area under PMIPv6 with NEMO support.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.615-624
• /
• 2005

In Mobile IP, several types of messages - binding update, binding request and binding acknowledgement - are used to support user mobility. It is necessary to exchange those messages frequently for seamless mobility but it incurs both the increase of network overhead and poor usage of mobile node battery power Thus, we need a mechanism that the server detects users location and also copes with the problems effectively, which is our main concern in this paper Each user records all moving logs locally and periodically makes out profile based on them in HMIPv6. By using profile, estimated resident time can be computed whenever he enters an area and the time is set up as the binding update message lifetime. Of course, the more correct lifetime nay be obtained IP arrival time as well as average resident time Is considered in profile. Through extensive experiments, we measure the bandwidth usage for binding update messages by comparing the proposed schemes with that in HMIPv6. From the results, Gain gets over $80\%$ when mobile node stays more than 13 minutes in a subnet. Namely, we come to know that our schemes improve network usage and energy usage in mobile node by decreasing the number of messages while they also manage users locations like that in HMIPv6.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.4
• /
• pp.203-210
• /
• 2017

Address resolution protocol (ARP) is used for binding a logical address to a physical address in many network technologies. However, since ARP is an stateless protocol, it always abused for performing ARP-based attacks. Researchers presented many technologies to improve ARP protocol, but most of them require a high implementation cost or scarify the network performance for improving security of ARP protocol. In this paper, we present an address auto-resoultion (AAR) network system to neutralize the ARP-based attacks. The AAR turns off the communication function of ARP messages(e.g. request and reply), but does not disable the ARP table. In our system, the MAC address of destination was designed to be derived from destination IP address so that the ARP table can be managed statically without prior knowledge (e.g., IP and MAC address pairs). In general, the AAR is safe from the ARP-based attacks since it disables the ARP messages and saves network traffics due to so.

• Annual Conference of KIPS
• /
• 2000.10b
• /
• pp.1353-1356
• /
• 2000

최근 B2B 시스템 통합 및 전략적 제휴가 시장을 변화시키고 있고 관련 기업들의 효율적인 연계요구가 증가됨에 따라 기업간 시스템들의 연동이 중요한 문제로 부각되고 있다. 워크플로우 표준화 단체인 WfMC 에서도 이러한 문제 해결의 일환으로 인터넷을 통한 워크플로우 관리 시스템간 연동을 위한 표준인 Wf-XML Interoperability standard 를 발표하였다. 본 논문은 Wf-XML 표준 및 관련 연구들을 조사하고 WfMC 표준에는 정의되어 있지 않으나 시스템간의 신뢰성있는 연동을 위해 고려할 사항 중에서 동기적 및 비동기적 상호연동을 위한 요구사항들을 분석한다. TCP/IP 를 기반으로 한 HTTP 프로토콜을 전송 프로토콜로 채택하는 경우 여러 오퍼레이션들을 일괄처리하기 위해서는 비동기적인 상호연동(asynchronous interoperation)을 위한 별도의 메커니즘이 필요하다. 본 연구에서는 Wf-XML 문서를 HTTP 프로토콜을 사용하여 전송하는 경우 일괄처리요청(batch request) 및 그 밖의 동기적 또는 비동기적 요청들을 처리하기 위한 상호연동 모델을 분석하고 분산 워크플로우 시스템의 일종인 ICU/COWS에서의 적용방안에 관해서 논의한다.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.38
• /
• pp.181-226
• /
• 2008

The purpose of this paper is to describe the settling procedures of the investor-state disputes in the FTA Investment Chapter, and to research on the international arbitration system for the settlement of the investor-state disputes under the ICSID Convention and UNCITRAL Arbitration Rules. The UNCTAD reports that the cumulative number of arbitration cases for the investor-state dispute settlement is 290 cases by March 2008. 182 cases of them have been brought before the ICSID, and 80 cases of them have been submitted under the UNCITRAL Arbitration Rules. The ICSID reports that the cumulative 263 cases of investor-state dispute settlement have been brought before the ICSID by March 2008. 136 cases of them have been concluded, but 127 cases of them have been pending up to now. The Chapter 11 Section B of the Korea-U.S. FTA provides for the Investor_State Dispute Settlement. Under the provisions of Section B, the claimant may submit to arbitration a claim that the respondent has breached and obligation under Section A, an investment authorization or an investment agreement and that the claimant has incurred loss or damage by reason of that breach. Provided that six months have elapsed since the events giving rise to the claim, a claimant may submit a claim referred to under the ICSID Convention and the ICSID Rules of Procedure for Arbitration Proceedings; under the ICSID Additional Facility Rules; or under the UNCITRAL Arbitration Rules. The ICSID Convention provides for the jurisdiction of the ICSID(Chapter 2), arbitration(Chapter 3), and replacement and disqualification of arbitrators(Chapter 5) as follows. The jurisdiction of the ICSID shall extend to any legal dispute arising directly out of an investment, between a Contracting State and a national of another Contracting State, which the parties to the dispute consent in writing to submit to the ICSID. Any Contracting State or any national of a Contracting State wishing to institute arbitration proceedings shall address a request to that effect in writing to the Secretary General who shall send a copy of the request to the other party. The tribunal shall consist of a sole arbitrator or any uneven number of arbitrators appointed as the parties shall agree. The tribunal shall be the judge of its own competence. The tribunal shall decide a dispute in accordance with such rules of law as may be agreed by the parties. Any arbitration proceeding shall be conducted in accordance with the provisions of the Convention Section 3 and in accordance with the Arbitration Rules in effect on the date on which the parties consented to arbitration. The award of the tribunal shall be in writing and shall be signed by members of the tribunal who voted for it. The award shall deal with every question submitted to the tribunal, and shall state the reason upon which it is based. Either party may request annulment of the award by an application in writing addressed to the Secretary General on one or more of the grounds under Article 52 of the ICSID Convention. The award shall be binding on the parties and shall not be subject to any appeal or to any other remedy except those provided for in this Convention. Each Contracting State shall recognize an award rendered pursuant to this convention as binding and enforce the pecuniary obligations imposed by that award within its territories as if it were a final judgment of a court in that State. In conclusion, there may be some issues on the international arbitration for the settlement of the investor-state disputes: for example, abuse of litigation, lack of an appeals process, and problem of transparency. Therefore, there have been active discussions to address such issues by the ICSID and UNCITRAL up to now.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.307-318
• /
• 2003

In this paper, we design and construct a TMO object group that provides the guaranteed real-time services in the distributed object computing environments, and verify execution power of its model for the correct distributed real-time services. The TMO object group we suggested is based on TINA's object group concept. This model consists of TMO objects having real-time properties and some components that support the object management service and the real-time scheduling service in the TMO object group. Also TMO objects can be duplicated or non-duplicated on distributed systems. Our model can execute the guaranteed distributed real-time service on COTS middlewares without restricting the specially ORB or the of operating system. For achieving goals of our model. we defined the concepts of the TMO object and the structure of the TMO object group. Also we designed and implemented the functions and interactions of components in the object group. The TMO object group includes the Dynamic Binder object and the Scheduler object for supporting the object management service and the real-time scheduling service, respectively The Dynamic Binder object supports the dynamic binding service that selects the appropriate one out of the duplicated TMO objects for the clients'request. And the Scheduler object supports the real-time scheduling service that determines the priority of tasks executed by an arbitrary TMO object for the clients'service requests. And then, in order to verify the executions of our model, we implemented the Dynamic Binder object and the Scheduler object adopting the binding priority algorithm for the dynamic binding service and the EDF algorithm for the real-time scheduling service from extending the existing known algorithms. Finally, from the numerical analyzed results we are shown, we verified whether our TMO object group model could support dynamic binding service for duplicated or non-duplicated TMO objects, also real-time scheduling service for an arbitrary TMO object requested from clients.