• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.47-54
• /
• 2017

In this paper, we propose an improved curvature-based GPU (Graphics Processing Unit) isosurface ray-casting technique. Our method adopts the fast evaluation method proposed by Sigg et al. [1] to find the isosurface, but replaces the computation of the gradient and Hessian with the de Boor algorithm. In this way, we can reduce the number of additional texture fetches from 84 to 27 thus improving the performance by up to ${\approx}30%$, depending on the platforms.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.315-322
• /
• 2006

In the application rising IP multicast, the waste of available bandwidth occurs of reducing of transmission rate in non-congestion local caused by reducing of transmission rate in congestion local. In this paper, to solve such a problem, we propose a dynamic multicast method using IP multicast and overlay multicast. In proposed method, we elected a local representative for overlay multicasting. When the transmission rate of a group is less than transmission rate threshold, the representative can transmits duplicative packets. In simulation results, it was known that proposed method uses bandwidth more efficiently.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.6
• /
• pp.9-17
• /
• 2012

High-quality multimedia on the Internet has attracted attention because of its wide application area. IP multicast has been proposed as a solution to use efficient network resources in these services. However, IP multicast has not been commonly used due to a number of practical issues such as security and management. As an alternative, an overlay multicast routing which is performed in upper protocol layers on legacy networks without changing hardware has been presented. Yet, the maximum data transmission capacity of the overlay multicast is not sufficient for real time transmission of multimedia data. In this paper, we have implemented an overlay multicast engine on NetFPGA which allows us to perform packet replication and tunneling which need high-speed. In addition, we have implemented extra portions which need low-speed in software. From now on, we will progress research which increase the number of terminal spots which can be replicated by improvement and amplify throughputs by optimization.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.319-321
• /
• 2005

이동 애드 혹 네트워크은 빈번한 위상 변화가 일어난다. 이에 대처하기 위해 비상태 멀티캐스팅이나 위상 변화에 강한 특성을 지니는 오버레이 멀티캐스트 프로토콜들이 제안되고 있다. 하지만 이들의 대부분은 소규모 그룹에 대한 멀티캐스트만을 지원한다. 그러나 이동 애드 혹 네트워크의 대표적인 응용들은 대규모 그룹 통신을 사용하므로 확장성 문제는 해결되어야 한다. 따라서 본 논문에서는 이를 개선하기 위해 단일 홉 클러스터링과 프록시 노드 사용을 제안한다. 단일 홉 클러스터링은 구조적인 관리가 필요한 노드 수를 줄일 수 있으며 프록시 노드는 단일 홉 클러스터링으로 줄어든 노드들에게 계층화된 포워딩을 제공한다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.21-28
• /
• 2005

최근의 제 2 세대 P2P 시스템은 확장성 있고 장애에 강한 분산 해쉬 테이블을 이용하여 대규모 P2P 애플리케이션을 위한 셀프-오거나이징 (Selforganizing)기술을 제공한다. 하지만 기존의 Pastry의 경우 해쉬 기반 기법을 적용하였기 때문에 사용자들의 요청이 빈번한 콘텐츠의 경우 한 노드로 네트워크의 전송 부하가 집중되는 현상이 발생할 수 있어 CDN 시스템에 적합하지 않았다. 본 논문에서는 이러한 문제점을 해결하기 위하여 CDN(Content Delivery Network) 환경에 적합하게 확장한 Rosary 오버레이 네트워크를 제안한다. 본 논문에서 제안하는 Rosary는 Pastry를 Inter-Pastry와 Intra-Pastry로 나누어 CDN 환경에 맞게 확장하였고 애플리케이션-레벨 멀티캐스팅(Applicatio-Level Multicasting)을 가능하도록 했으며 세미 해쉬 스킴(Semi Hash Scheme)을 적용함으로서 CDN 환경에 맞게 수정 하고 확장하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.23-31
• /
• 2004

This paper focuses on a boundary surface based ray casting. In general the boundary surface based ray casting is processed in two stages. The first stage finds boundary surfaces and stores them into buffers. The second stage calculates a distance from a viewpoint to the voxels of the interested area by projecting boundary surfaces on the view plane, and then starts to traverse a volume data space with the distance. Our approach differs from the general boundary surface based ray casting in processing the first stage of it. Contrast to the typical boundary surface based ray casting where all boundary surfaces of volume data are stored into buffers, they are projected on the planes aligned to the axis of volume data coordinates and these projected data are stored into 6 buffers. Such maneuver shortens time for ray casting, and reduces memory usage because it can be carried out independently from the amount of the volume data.

• 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 the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.126-131
• /
• 2003

While the advantages of multicast delivery over multiple unicast deliveries is undeniable, the deployment of the IP multicast protocol has been limited to network domains under single administrative control. Deployment of inter-domain multicast delivery has been slow due to both technical and administrative reasons. For this reasons overlay multicasting technologies are recently proposed. We propose a End-Host Multicast Tree Protocol (EMTP) that searches two levels of the tree at a time until reaching to a leaf node and can select the nearest node that a new node try to join in the tree. Even if there is no available degree of the desirable node that a new node want to join, selecting the node as a potential parent by EMTP can reduce the number of tree switching with robustness of the tree and bring to ruduce the data delivery time.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.163-170
• /
• 2007

The next generation communication environment consists of various wireless access networks with distinct features that are configured as an overlay topology. In the network environments, the frequency of hand overs should be minimized and the error propagation should be solved in order to provide high-quality multimedia services to mobile users. Therefore, we propose an performance enhancement approach, based on mSCTP, that provides high quality multimedia services to mobile users by ameliorating the error propagation problem. We utilizes the following four functions: 1) the separation of transmission paths according to the types of frames. 2) retransmission strategy to minimize the loss rate of frames, 3) Foced vertical handover execution by utilizing bicasting, 4) using the stability period in order to reduce the effect of the ping pong phenomenon. The simulation results show that the proposed approach provides seamless multimedia service to mobile users by achieving error resilience.