• 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 the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.10
• /
• pp.57-66
• /
• 2010

Today the various types of communication and application service are provided by the development of Internet and IP technologies. It is expected to be extended the service domain of two networks through the interconnecting P2PSIP overlay which is highlighted as an important technologies for Internet based services and IMS(IP Multimedia Subsystem) which is the new architecture adopted in the evolution of NGN. Therefore, this paper explains the possible methods of the service expansion with interconnecting P2PSIP overlay and IMS network. Specially this paper suggests the interconnection architectures of P2PSIP overlay and IMS network as subscriber's types and analyzes the traffic analysis model and session set up delay characteristics by simulation model. As a results, this paper shows that the interconnection architecture using gateway AS(Application Server) is the excellent method to interconnect the IMS in case of P2PSIP overlay only subscriber, and that interconnection architecture using I-CSCF is good method to interconnect the IMS in case of P2PSIP overlay and IMS subscriber.

• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.26-35
• /
• 2018

The recent development of overlay network technology enables distributed sharing of various types of contents. Although overlay network has great advantages as a huge content repository, it is practically difficult to directly provide such Internet service as streaming of contents. On the other hand, the media server, which is specialized in content services, has excellent service capabilities, but it suffers from the huge contents that are constantly created and requires large expansion of severs and storages, and thus requires much effort for efficient management of the huge repository. Hence, the association of an overlay network of huge storage with a media server of high performance content service will show a great synergy effect. In this paper, a location-aware scheme of constructing overlay networks and associating it with media server is proposed, and then cache-based contents management and service policy are proposed for efficient content service. The performance is analysed for one of the content services, streaming service.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.103-114
• /
• 2008

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.

• Journal of Information Processing Systems
• /
• v.4 no.2
• /
• pp.53-60
• /
• 2008

The Web Services infrastructure is a distributed computing environment for service-sharing. Mechanisms for Web services Discovery proposed so far have assumed a centralized and peer-to-peer (P2P) registry. A discovery service with centralized architecture, such as UDDI, restricts the scalability of this environment, induces performance bottleneck and may result in single points of failure. A discovery service with P2P architecture enables a scalable and an efficient ubiquities web service discovery service that needs to be run in self-organized fashions. In this paper, we propose an autonomic -interleaving Registry Overlay Network (RgON) that enables web-services' providers/consumers to publish/discover services' advertisements, WSDL documents. The RgON, doubtless empowers consumers to discover web services associated with these advertisements within constant D logical hops over constant K physical hops with reasonable storage and bandwidth utilization as shown through simulation.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.1-8
• /
• 2008

Overlay Multicast is an effective method for optimal utilization of system resources and network bandwidth without a need for hardware customization. It is an effective method of providing Personal Internet Broadcasting Service for better Quality of Service to many users. In this paper, we propose a multicast tree that uses Local Swap method. In order to prove the effectiveness of the new technique suggested here, using the proposed method and personal internet broadcasting service, information is abstracted, compared and analyzed under various overlay multicast algorithm conditions. We have proved that the suggested local swap technique is more effective by comparing it with other existing techniques in various methods such as using various overlay based multicast algorithm simulation.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.333-336
• /
• 2009

DSON is a service overlay network architecture that can guarantee end-to-end quality of service to home network area. DSON makes service possible to be provided dynamically. This paper gives service model and scenario using DSON architecture.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.459-463
• /
• 2007

Overlay multicast is an emerging technology for next generation Internet service to various groups of multicast members. It will take the place of traditional IP multicast which is not widely deployed due to the complex nature of its technology. The overlay multicast which effectively reduces processing at IP routers can be easily deployed on top of a densely connected IP network. An end-to-end delay problem is considered which is serious in the multicast service. To periodically optimize the route in the overlay network and to minimize the maximum end-to-end delay, overlay multicast tree is investigated with genetic Algorithm. Outstanding experimental results are obtained which is comparable to the optimal solution and the tabu search.

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

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.181-190
• /
• 2010

A multitude of overlay network designs for resilient routing, multicasting, quality of service, content distribution, storage, and object location have been proposed. Overlay networks offer several attractive features, including ease of deployment, flexibility, adaptivity, and an infrastructure for collaboration among hosts. In this paper, we explore cooperation among co-existing, possibly heterogeneous, overlay networks. We discuss a spectrum of cooperative forwarding and information sharing services, and investigate the associated scalability, heterogeneity, and security problems. Motivated by these services, we design Synergy, a utility-based overlay internetworking architecture that fosters overlay cooperation. Our architecture promotes fair peering relationships to achieve synergism. Results from Internet experiments with cooperative forwarding overlays indicate that our Synergy prototype improves delay, throughput, and loss performance, while maintaining the autonomy and heterogeneity of individual overlay networks.