• Title/Summary/Keyword: 동적 바인딩 갱신

Search Result 4, Processing Time 0.02 seconds

Lifetime Assignment Schemes for Dynamic Binding Update in Mobile IPv6 (Mobile IPv6 환경에서 동적 바인딩 갱신을 위한 라이프타임 할당 기법)

  • 양순옥;송의성;길준민;김성석;황종선
    • 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.

On Performance Evaluation of Binding Updates Based on Multicasting for Network Mobility (네트워크 이동성 환경에서 멀티캐스트 기반의 바인딩 갱신 기법에 대한 성능 분석)

  • Ahn, Soo-Been;Kim, Moon-Seong;Choo, Hyun-Seung
    • Annual Conference of KIPS
    • /
    • 2008.05a
    • /
    • pp.991-994
    • /
    • 2008
  • 네트워크 이동성(Network Mobility: NEMO)은 하나 이상의 서브넷으로 이루어진 전체 네트워크가 인터넷 접속점을 동적으로 변화하여 네트워크 접근성도 변화하는 환경을 말한다. 이러한 환경에서 경로 최적화를 위한 여러 프로토콜들이 존재하지만 그중 Prefix Delegation 기법은 다른 기법들에 비해 다방면에서 우수하다. 그러나 본질적으로 바인딩 갱신 스톰(storm) 문제를 수반하기에 NEMO 환경에서의 바인딩 갱신 비용을 최소화 하기위한 연구가 대두하였다. 본 논문에서는 바인딩 갱신 비용의 최소화를 위하여 바인딩 갱신 시 멀티캐스트 기법을 적용하였으며, 경로 최적화 프로토콜은 Prefix Delegation 기법 중 바인딩 갱신 비용을 효율적으로 고려한 IPD[1]를 가정하였다. 성능평가를 위해서 수학적 모델링을 적용하였으며, 본 모델을 통하여 기존 방법들에 비하여 상당한 비용절감 효과를 얻을 수 있음을 보인다.

A Mobility Management Scheme based on the Mobility Pattern of Mobile Networks (이동 네트워크의 이동 패턴에 기반을 둔 이동성 관리 기법)

  • Yang, Sun-Ok;Kim, Sung-Suk
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.345-354
    • /
    • 2008
  • Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

A Robust Multiple Set-Top Box Authentication Scheme for IPTV Against Smart Card Cloning Attack (IPTV 환경에서 스마트카드 복제에 강건한 다중 셋톱박스 인증기법)

  • Lim, Ji-Hwan;Oh, Hee-Kuck;Kim, Sang-Jin
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.37-46
    • /
    • 2010
  • In an IPTV system, the rights of the content and service provider can be protected by using Conditional Access System (CAS) and Digital Right Management (DRM). In case of the CAS, only the authorized user who has structured authentication keys can decrypt the encrypted content. However, since the CAS establishes a secure channel only between content provider and Smart Card (SC), it cannot protect the system against McCormac Hack attack which eavesdrops on unsecure channel between SC and Set-Top Box (STB) and SC cloning attack. In this paper, we propose a robust multi-STB assisted SC / STB authentication protocol which can protect the IPTV system against not only McCormac Hack attack, but also SC cloning attack. The previous works which bind a STB and a SC during the SC registration phase against the SC cloning attack does not support multi-STB environments. The proposed system which dynamically updates the STB information in subscriber management system using the bi-directional channel characteristic of IPTV system can support the user's multi-STB device effectively.