• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.21-33
• /
• 2007

An overlay network is a virtual network which is constructed on top of a physical computer network. A node in the overlay network is connected through virtual or logical links, where each link corresponds to a path of the links in the underlying physical network. Overlay networks are suitable for sharing heterogeneous resources in distributed environments, However, overlay networks are limited for achieving reliable communication that failure detection in overlay networks is a very important issue. In this paper, we review conditions of conventional failure detection and propose a new approach to failure detection and resilience which can be applied to HRing (Hierarchical Ring) overlay networks. The proposed method consists of the failure detection and the failure resilience phases. Because it utilizes the characteristics of the HRing overlay network for failure detection, it can reduce unnecessary network traffic and provide better scalability and flexibility. We also analyzed and evaluated the performance of the proposed approach through simulations.

• The Journal of the Korea Contents Association
• /
• v.17 no.6
• /
• pp.39-54
• /
• 2017

This study started from the consciousness that the community media practice studies have been confined to the traditional terrestrial broadcasting. The following research results and implications were obtained by analyzing Daedeok-valley Radio's case to elucidate characteristics of online-based community media and content production and distribution characteristics neglected in previous researches. First, online community media activities are civic/citizen media activities that capture the value of local communities, and this locality is realized through media content production and its online distribution. Second, contents of online community media link members of the community, and individuals become nodes, interacting both online and offline. Therefore, online-based citizen media activities can be utilized effectively as a means to enhance civic participation and to achieve the locality of community in online and offline spaces depending on strategies for online contents production and distribution. Utilizing online infrastructures for media content creation and distribution in Korea demonstrates potential opportunities of local online media to be considered as niche media that can increase its own sustainability.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.63-71
• /
• 2000

One Problem of the choice Property in logit model is interpreted as the Problem of common links and common nodes in choice set. Common node Problem Plays important role in deciding the efficiency of network loading and common link problem is connected with choice Problem, both of which are to be solved to improve the logit choice model. Although much need has been pointed out for research on the topic, however, no Paper as yet considers these two factors at the same time. In the Paper we develop a new logit formulation, which is able to ease the logit Problem, widely known as the Problem of IIA(Independence of Irrelevant Alternatives). An example network is used to assess the Proposed model and compare it with other conventional models. From the results, we find out that the model is superior to others.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.996-1000
• /
• 2009

물순환계를 종합적으로 관리하기 위해서는 물순환계의 모니터링과 해석모형의 구축이 필요하다. 실측자료만으로는 복잡 다양한 물순환계 구조 및 인과관계를 규명할 수 없기 때문에 시간적 공간적으로 변화하는 다양한 수문현상을 일관된 하나의 시스템으로 이해하기 위해 물순환 해석모델을 구축하여 검토할 필요가 있다. CAT(Catchment hydrologic cycle Analysis Tool)은 수문학적으로 균일하게 판단되는 범위를 소유역으로 분할하여 지형학적 요인에 의한 유출 특성을 객관적으로 반영할 수 있게 하며, 토양층에 따라 침투, 증발, 지하수 흐름 등의 모의가 가능하도록 하는 Link-Node 모형으로, 증발산은 기준 증발산을 외부에서 직접 입력하거나, Penman-Monteith 방법을 선택할 수 있으며, 침투는 토양의 수리전도도에 따른 연직방향 침투 및 사면방향 복귀류를 고려할 수 있다. 노드의 지하수 유거를 고려하여 기존 노드-링크 방식 모형의 장기 유출 해석시 제한점을 보완하였으며, Muskingum, Muskingum-Cunge, Kinematic wave 방법을 이용하여 하도추적을 모의할 수 있다. 또한 GUI를 통해 사용자가 손쉽게 모형을 적용하고 관리 할 수 있도록 하고, 여러 시나리오를 적용함에 있어서 편리하도록 개발 중인 모형이다. 본 연구에서는 개발중인 CAT 모형을 평가 하기위해 시험 유역으로 운영 중인 설마천 유역에 적용하여 소유역 분할(노드수), 계산 시간 간격(일/시단위) 등에 따른 적용성을 평가하였다. 관측 자료를 통해 구축 가능한 물리적 매개변수를 통해 해당 유역을 단일 노드 및 다중 노드로 간단히 모형화할 수 있었으며, 모의 결과, 관측 유량과 적절히 일치하는 결과를 얻을 수 있었다. 1시간 단위에 대한 모의에서도 유출을 적절히 모의할 수 있었으며, 소규모 유역에 대한 정밀한 물순환 해석이 가능할 것으로 평가되었다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.159-163
• /
• 2009

CAT(Catchment hydrologic cycle Analysis Tool)은 기존 개념적 매개변수 기반의 집중형 수문모형과 물리적 매개변수 기반의 분포형 수문모형의 장점을 최대한 집약하여, 도시유역 개발 전 후의 장 단기적인 물순환 변화 특성을 정량적으로 평가하고 물순환개선시설의 효과적인 설계를 지원하기 위한 물순환 해석 모형이다. CAT은 수문학적으로 균일하게 판단되는 범위를 소유역으로 분할하여 지형학적 요인에 의한 유출 특성을 객관적으로 반영할 수 있으며, 개발 공간 단위별로 침투, 증발, 지하수 흐름 등의 모의가 가능하도록 하는 Link-Node 형식으로 개발되었다. 모형의 UI(User Interface)는 사용자가 손쉽게 모형을 적용 관리하고, 여러 시나리오를 동시에 효과적으로 모의하여 분석할 수 있도록 설계되었다. 또한 모든 입력 출력 자료를 Excel이나 텍스트 형식과 연동되도록 하여 프로젝트별 매개변수 관리가 용이하도록 개발하였다. CAT의 수문해석모듈로 증발산, 침투, 유역 유출, 지하수 유거, 하도추적 등의 모듈을 개발하였다. 증발산은 기준 증발산을 외부에서 직접 입력하거나, Penman-Monteith 방법을 선택할 수 있으며, 침투는 토양의 수리전도도에 따른 연직방향 침투 및 사면방향 복귀류를 고려할 수 있다. 노드의 지하수 유거를 고려하여 기존 노드-링크 방식 모형의 장기 유출 해석시 제한점을 보완하였으며, 하도추적을 위해 Muskingum, Muskingum-Cunge, Kinematic wave 방법 등의 해석법을 제공하였다. CAT의 수문모듈을 이용하여 설마천 유역을 단일노드 및 멀티노드로 개념화하여 모의하였으며, 모의결과를 관측유량과 비교한 결과, 두 경우 적절한 범위내의 결과임을 확인할 수 있었다. CAT의 안정적인 수문해석 기능을 바탕으로 향후 물순환개선시설 모듈과의 결합을 통해 장기 물순환 해석에 광범위하게 활용될 수 있을 것으로 판단된다.

• Journal of Digital Contents Society
• /
• v.11 no.3
• /
• pp.341-348
• /
• 2010

Unlike host-based IPv6 mobility support protocols such as Mobile IPv6 (MIPv6), Hierarchical Mobile IPv6 (HMIPv6), and Fast handover for Mobile IPv6 (FMIPv6), Proxy Mobile IPv6 (PMIPv6) is expected to accelerate the real deployment of IPv6 mobility support protocol by using only collaborative operations between the network entities without mobile node (MN) being involved. In this paper, we analyze and compare the handover latency of network-based IPv6 mobility support protocol (i.e., PMIPv6) with the representative host-based IPv6 mobility support protocols such as MIPv6, HMIPv6, and FMIPv6. Analytical results show that the handover latency of PMIPv6 is considerably lower than those of MIPv6 and HMIPv6, and the handover latency of PMIPv6 becomes lower than that of FMIPv6 in case the wireless link delay is greater than the delay between mobile access gateway (MAG) and local mobility anchor (LMA).

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.267-276
• /
• 2007

In OSPF, the larger and more unstable the area, the greater the likelihood for performance problems associated with routing protocol recalculation. Generally, an area should have no more than 50 routers. Areas with unstable links should be smaller. Military tactical data network is used for military operations during war-time. It consists of wireless network for mobility of node. Thus, it has low-bandwidth and unstable property. In addition, it is expected that many kinds of router-failure, Link-failure and recovery at emergency period. However, Military tactical data network is designed with about one and half times the number of recommendation. This paper proves that the traffic is limited by the increase of re-calculation of area.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.481-488
• /
• 2005

The Mobile W provides an efficient and scalable mechanism for host mobility within the Internet. However, the mobility implies higher security risks than static operations in fixed networks. In this paper, the Mobile IP has been adapted to allow AAA protocol that supports authentication, authorization, and accounting(AAA) for security and collection for accounting information of network usage by mobile nodes(MNs). For this goal, we Propose the boundary tone overlapped network structure while solidifying the security for the authentication of an MN. That is, the Proposed scheme delivers the session keys at the wired link for MN's security instead of the wireless one, so that it provides a fast and seamless handoff mechanism. According to the analysis of modeling result, the proposed mechanism compared to the existing session key reuse method is up to about $40\%$ better in terms of normalized surcharge for the handoff failure rate that considers handoff total time.

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.48-61
• /
• 2007

WiBro (Wireless Broadband) service, developed in Korea, can provide the host mobility while its users hang around within the subnet. Next-generation Internet protocols, IPv6 and Mobile IPv6 (MIPv6), provide a plenty of addresses to the nodes and enable the handover between different subnets. However, MIPv6 is not enough to support a real time service such as VoIP (Voice over IP) due to the long latency, and it is necessary to develop an enhanced handover mechanism which is optimized to the WiBro networks. In this paper, we suggest an improved fast handover mechanism while the mobile node moves around WiBro networks. The proposal is based on Fast Mobile IPv6 (FMIPv6) which is the representative protocol for fast handover, and reduces the handover latency by the close interaction between the link layer (WiBro MAC) and IP layer (FMIPv6). Finally, we analyze the performance of proposed mechanism through the mathematical analysis.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.