• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.184-186
• /
• 2002

인터넷의 급속한 성장과 함께 이동노드를 이용하여 네트웍에 접속하려는 요구가 늘어남에 따라, 이동 노드의 지속적인 통신을 제공하기 위만 서비스가 중요한 문제로 대두되어지고 있다. 따라서 이동노드의 핸드오프 시 패킷손실을 줄이고, 네트웍에 연결되어져 있는 에이전트로부터 지속적인 서비스를 받기 위해 핸드오프 시간을 단축시키기 위한 노력이 계속되어지고 있다. 그 결과, 빠른 핸드오프를 위하여 같은 무선도메인 안에서 이동노드의 이동사실을 통신하고 있는 상대노드나 HA(Home Agent)에게 알리지 않고 무서도메인의 최상위 에이전트가 처리하는 기법들이 제안되었다. 그러나 이 기법들은 이동노드의 이동사실을 모르고 있는 상대노드는 이동노드에 새로운 패스의 대역폭을 고려하지 않고 통신하게 된다는 것과, 무선도메인의 최상위 에이전트는 도메인에 들어와 있는 모든 이동노드의 등록을 관리하기 때문에 많은 부담을 갖게 된다는 문제점을 가지고 있다. 이에 본 논문에서는 무선도메인에서 이동노드의 핸드오프시 효율적인 등록과 최상위 에이전트의 부담을 줄이기 위한 방법과 새로운 패스로 갑자기 많은 데이터가 들어올때 다른 이동노드에게 미치는 영향을 최소화할 수 있는 방법을 제안하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1113-1116
• /
• 2003

무선 네트워크를 통해 인터넷에 접속하려는 이동노드 수가 늘어남에 따라 다수의 이동노드에게 무선 서비스를 제공해야하는 HA(Hone Agent)와 FA(Foreign Agent)에서의 부하도 함께 증가하고 있다. 특히 지역적 등록(Regional Registration)에서와 같이 투선 네트워크 도메인의 최상위 FA가 현재 도메인에 로밍한 모든 이동노드의 COA로 동작함으로 인해 발생하는 부하는 최상위 FA에서 혼잡 및 지연의 원인이 된다. 이에 본 논문에서는 최상위 FA에서 발생말 수 있는 부하를 하위 FA에게 분산하기 위하여 두 가지 접근방법인 Passive Approach와 Active Approach를 제안한다 Passive Approach는 부모 FA가 부하 분산 시점을 결정하여 자식 FA에게 분산해주는 기법이고 Active Approach는 임의의 FA가 스스로 분산 시점을 결정하여 상위 FA에서 발생할 수 있는 부하를 완화시켜주는 기법이다. 시뮬레이션을 통해 Active Approach의 한 형태를 띠고 있는 기존 연구인 LNSP 기법과 성능을 비교하여 가장 효율적인 부하 분산 방법을 제시한다.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.167-179
• /
• 2005

In hierarchical Mobile IPv4 Networks the highest FA(Foreign Agent) may experience serious congestion and delay since the highest FA plays a role of CoA(Care of Address) for all mobile nodes in the domain, In this paper, we propose mechanism called 'HRFA(Hierarchical Root Foreign Agent)', which distributes the load imposed on the highest FA. In the proposed HRFA scheme, multiple HRFAs are selected to provide the similar service that is provided by the highest FA. According to which entity determines HRFAs, HRFA scheme is categorized into 'Active' and 'Passive' approaches. HRFA scheme is further categorized into 'All MN(Mobile Node)s' and 'New MNs' approaches, depending on which mobile nodes are assigned to a newly elected HRFA. Through a course of simulations, we investigate the performance of 4 possible combinations of HRFA schemes. We also compare the performance of the proposed HRFA schemes with the LMSP(Local Multicast Service Provider) scheme, which is a scheme to distribute the load of FA for multicast service in hierarchical wireless network domain. The simulation results show that the Passive & New MN approach performs best with respect to both the overhead and the load balancing.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.1
• /
• pp.7-16
• /
• 2016

This paper discusses a method of selecting variant groups to be reviewed for LGR (Label Generation Rule) of Internet Top-Level Hanja Domain. The most difficult problem in setting up LGR of Internet Top-Level Hanja Domain is how to treat Hanja variants. If domains containing variants (e.g.: 東海國) are directed to different addresses, confusion will arise. Therefore, it is desirable that such domains are directed to the same address. Since variant groups of Korea and China are not same, we need to unify variant groups of Korea and China. In the process of reviewing 3093 Chinese variant groups, the author found that Korea does not need to review Chinese variant groups which include no or just one Korean Hanja character. Korea only need to review Chinese variant groups which include two or more Korean Hanja characters. By doing so, the author could reduce the number of Chinese variant groups to be reviewed by Korea from 3093 to 303, which is only one-tenth of the original number of Chinese variant groups. After Korea finishes reviewing 303 Chinese variant groups selected according to the method suggested in this paper, the job of setting up LGR of Internet Top-Level Hanja domain will be accelerated by negotiating with China.

• Journal of Arbitration Studies
• /
• v.21 no.2
• /
• pp.113-131
• /
• 2011

Recently, the Internet Corporation for Assigned Names and Numbers (ICANN) announced the expansion of the number of generic top-level domains (gTLDs) beyond the current 22 gTLDs, and the gTLD Applicant Guidebook for ICANN's new gTLD program is now under consideration for approval. ICANN also introduces a "Trademark Clearinghouse" and the "Uniform Rapid Suspension (URS)" procedure to protect trademarks and expedite dispute resolution and save costs. The Trademark Clearinghouse is a central repository for information to be authenticated, stored and disseminated, pertaining to the rights of the trademark holders. Trademark holders would voluntarily provide data of their trademarks from all over the world, and it would assist a trademark watch service provided by the new gTLD registry for trademark holders and potential domain name registrants. The URS is a part of the new gTLD dispute resolution mechanisms created by ICANN to resolve cybersquatting disputes. A complainant in a URS proceeding must establish three elements that are very similar to the existing UDRP to succeed, but supposedly more expedited and cost efficient. Since the URS provides that it only protects court validated and registered trademarks, it is not clear whether unregistered marks used in commerce are protected under the URS. The URS escalates the complainant's burden of proof from a preponderance of evidence standard under the UDRP to a clear and convincing evidence standard. The notices to a respondent shall be sufficient if the URS Provider sends the notice of Complaint to the addresses listed in the Whois contact information. As registrants who wish to conceal their true identity often subscribe to the privacy/proxy service and the complainant's high rate of success in the UDRP proceeding is relevant to the respondents' default rate, the URS's simple notice requirement would deprive respondents of a fair opportunity to assert their rights over the disputed domain names.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.959-962
• /
• 2002

DNSSEC은 IETF에서 논의중인 DNS 보안 표준으로서, DNS에 있어 가장 큰 잠재적 위협인 '도메인 네임에 대응되는 IP주소의 위변조 위협에 대응하기 위해 논의되고 있는 표준이다. 최근 네트워크 환경에서의 최상의 암호화 기법으로 자리잡은 공개키 암호화 기법을 이용하여, 도메인 Zone에 서명을 하여, 이러한 Zone 메시지를 받아보았을 때, 서명을 검증함으로서, DNS메시지가 중간에 위 변조없이 적정한 소스로부터 왔다는 것을 확인하는 것이다. 본 논문에서는 DNSSEC에서 가능한, 계층적 인증방식을 .KR 하위 도메인네임에서 활용할 수 있는 방안으로서, secure resolver를 이용한 도메인네임의 인증을 제시하였다.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.179-186
• /
• 2008

The access to web applications has continuously evolved toward the adoption of content centric interfaces. Services and information items are much of user's concern than web sites. For an efficient accommodation of increasing needs of content oriented operations, the scope of domain names is extended in two directions. A naming scheme is derived that is suitable for resource level access units and the semantics of domain names is conceived as very flexible functions. First extension regards the removal of unnecessary TLD's of domain names for resource level binding. Second extension makes the resource level domain names rich in functional binding and consequently various applications can be directly triggered by the invocation of domain names without intervening medium. These extensions may lay a certain direction for the future internet evolution.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.808-811
• /
• 2008

HMIPv6는 핸드오버시 시그널링 오버헤드와 패킷 손실을 감소시키는데 목적이 있다. 그러나 HMIPv6는 성능 평가면에서 기존의 MIPv6보다 우수하지 못하다. HMIPv6 환경하에서 새로운 도메인에 진입한 MN이 MAP 선택시 최상위 MAP을 선택하여 CN과 통신할 경우 최상위 MAP에 부하가 집중되고 MN이 빈번하게 이동하거나 대용량서비스를 이용하게 되면 성능이 저하되고, 반대로 MN이 최하위 MAP을 선택하여 CN과 통신할 경우에는 HA나 CN에 대한 Binding Update 시그널 증가로 성능이 저하된다. 이에 본 논문에서는 MN이 MAP 선택시 Distance, 노드사용율 및 대역폭 사용율을 바탕으로 MAP을 선택하는 적응적 MAP을 선택하는 방안에 대해서 논하고자 한다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.7
• /
• pp.589-604
• /
• 2006

Software product lines (SPL) are recently an emerging software reuse paradigm, which helps organizations develop their products from reusable core assets rather than from scratch. For developing these assets, understanding commonality and variability (C&V) is essential. A feature-oriented approach has been used extensively for C&V analysis in the SPL. However, this contains no proposal to systematically identify features and provide the rationale for the features. Further, the approach does not directly show how the results of C&V analysis will satisfy an organization's high-level business goals and provide the rationale for the C&V. Therefore, this paper presents a domain analysis method for the SPL based on goals, scenarios, and features in order to overcome some of the deficiencies and limitations of the feature-oriented approach. In particular, the paper proposes a domain requirements model (DRM) and a domain requirements modeling method based on the DRM. This method has been applied to the home integration system (HIS) domain to demonstrate its feasibility with a supporting tool, namely IDEAS. Our approach makes it possible to systematically identify the features and provide the rationale for both the features and the C&V.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.