• 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.

• Smart Media Journal
• /
• v.2 no.1
• /
• pp.8-16
• /
• 2013

The significant enhancement of the edge portion of computer networks including user-side machines and last mile network links encourages the research of the overlay network based data dissemination systems. Varieties of overlay network based data dissemination systems has distinct purposes, and each of them has a proper structure of an overlay network and a efficient communication protocol. In this paper, overlay network based data dissemination systems for Flash Dissemination, whose target is the distribution of relatively small size data to very large number of recipients within very short time, are explored. Mainly two systems, RECREW and FaReCAST, are introduced and analyzed in the aspects of design considerations for overlay networks and communication protocols. According to evaluations for flash dissemination scenarios, it is observed that the proposed overlay network based flash dissemination systems outperforms the previous overlay network based multicasting systems, in terms of the reliability and the dissemination delay. Moreover, the theoretical analysis of the reliability of data dissemination is provided by analysing FaReCAST.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1609-1615
• /
• 2006

Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1117-1120
• /
• 2005

최근 유비쿼터스 컴퓨팅의 핵심 기술인 센서 네트워크 기술이 활발하게 연구되고 있는 실정이다. 이에 다양한 센서 노드 기술이 개발되면서 각기 다른 종류의 센서 노드로 구성된 이기종의 센서 네트워크의 연동에 관한 연구가 활발히 진행되고 있다. 기존에 제안된 이기종 센서 네트워크의 통합, 관리를 위한 기술은 구현이 복잡하고, 각각의 노드에 많은 연산 부하가 발생하며, 기존의 시스템을 사용하지 못해 비효율적이다. 본 연구에서 제안하는 Overlay Sensor Network는 전체 센서 네트워크의 상위에 정의되어지는 네트워크로, Overlay Sensor Network를 구성하는 Base Station 노드가 각기 다른 센서 네트워크의 데이터를 연동함으로서 노드의 연산 부하를 줄이고, 기존에 구현된 센서 네트워크와 시스템을 사용함으로서 구현의 복잡성을 줄이며 효율성은 높이는 것이 가능하다. 본 연구에서는 이기종 센서 네트워크의 통합과 관리를 위한 Overlay Sensor Network를 제안하고, 그에 따른 시스템을 설계하고 구현하고자 한다.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.83-93
• /
• 2010

P2P streaming technology has advantages of scalability and availability comparing to the popular IP multicast. This paper proposes an approach to apply the P2P streaming technology to the delay-sensitive multimedia multicast applications. In order for the P2P streaming to be applied to the delay-sensitive applications, prior construction of delay-guaranteed overlay network is necessarily required. Moreover, the delay-guaranteed overlay network should be able to be kept even when the hand-overs occur owing to the departures of the intermediate P2P peers. This paper proposes a delay-guaranteed overlay network construction method by using the bandwidth and end-to-end delay based admission control and the backup peer based hand-over control mechanism.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1447-1458
• /
• 2020

This paper describes a structured overlay network scheme based on multiple different time intervals. Many types of data (e.g., sensor data) can be requested at specific time intervals that depend on the user and the system. These queries are referred to as "interval queries." A method for constructing an overlay network that efficiently processes interval queries based on multiple different time intervals is proposed herein. The proposed method assumes a ring topology and assigns nodes to a keyspace based on one-dimensional time information. To reduce the number of forwarded messages for queries, each node constructs shortcut links for each interval that users tend to request. This study confirmed that the proposed method reduces the number of messages needed to process interval queries. The contributions of this study include the clarification of interval queries with specific time intervals; establishment of a structured overlay network scheme based on multiple different time intervals; and experimental verification of the scheme in terms of communication load, delay, and maintenance cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.818-830
• /
• 2005

Recently, Peer-to-Peer (P2P) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the multimedia content from content providers to clients. In this paper, We propose a topology-aware P2P overlay network for CDN, Rosary, in which CDN servers perform Intra-Pastry and Inter-Pastry routing based on a two-level structured overlay network. This proposed system extends pastry by adapting itself to CDN environments, where a semi-hashing based scheme for Intra-Pastry routing is introduced, and dynamic landmark technology is used to construct the topology-aware overlay network. Through simulations on NS-2, it is shown that Rosary is scalable, efficient, and flexible.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.170-175
• /
• 2008

모든 Network는 대역폭의 한계성을 갖고 있다. Overlay 구조의 Network 또한 예외는 아니다. 이러한 Network 대역폭 자원의 한계성은 Network를 이용한 많은 통신에 있어서 심한 Traffic 을 형성하고 그로 인한 낮은 대역폭을 제공해준다. 이에 대한 해결책으로 Multi-Hour Ability 를 적용할 수 있다. 우리가 살아가는 환경은 서로 다른 시간대가 존재하며, 그로 인한 생활패턴에 따라 Network를 이용하는 정도 또한 시간대별로 다르다. 이 논문에서는 라우팅이 자유로운 Overlay Network를 통해 Multi-Hour Ability를 적용하여 Network에 발생한 Traffic 을 완화시키고, 잉여 대역폭을 효과적으로 사용하며, 보다 안정적인 대역폭 확보를 통해 성능 향상을 할 수 있다는 것을 보인다.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.413-422
• /
• 2011

Overlay network is a ready-to-use solution to enable new network functionality with existing Internet connectivity intact. This paper introduces a network service which helps users easily compose their own service overlay networks through software-defined networks. We look into the structure of service gateway which enables 1 Gbps packet processing on composed overlay networks. We also provide examples for the way of composing service overlay for support multicast applications. Experiment results carried over the KREONET (Korea Research Environment Open NETwork) show the forwarding performance of the service gateway.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.643-658
• /
• 2004

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.