• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.313-315
• /
• 2003

멀티캐스트 기술은 인터넷 서비스에 필수불가결한 요소임에도 불구하고, 네트워크상의 구현에 어려움으로 인해 그 기술이 활용되지 못하고 있다. 멀티캐스트 기술의 장점을 활용하기 위하여 어플리케이션 레벨에서 멀티캐스트 기능을 구현한 응용 멀티캐스트 프로토콜들이 제안되고 있다[1,2]. 본 논문에서는 이기종 환경에서 다수의 송신자가 상이한 전송률을 갖는 수신자들에게 다양한 대역폭을 제공하고 보다 효과적인 실시간 스트리밍 전송 서비스를 지원하기 위한 멀티캐스트 기법을 제안한다. 본 연구에서 제안하는 멀티캐스트 기법의 통시구조는 소스기반의 전송트리가 내포되어 있는 n차 정다면체 구조를 갖으며, 서로 비슷한 전송률을 갖는 수신자들끼리 서브 그룹을 구성하므로 실시간 데이터 전송시 주어진 대역폭을 효과적으로 사용할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.284-288
• /
• 2007

P2P 환경은 피어의 유동성과 자원 상태 변화 등 실행 환경 변화가 빈번히 발생한다. 이 논문에서는 가변하는 실행환경에서 피어간 컨텐츠를 지원함에 있어 환경에 잘 적용될 수 있는 오버레이 네트워크를 구성하여 안정적으로 컨텐츠를 분배하는 미들웨어 서비스 구조를 제안하였다. 또한 컨텐츠 전송 중의 결함 감지 서비스를 지원하여 자율적으로 분배 트리를 재 적용한 프로토타입을 통해 실제 환경에서 적용가능성을 확인하였다.

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

In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

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

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.11-18
• /
• 2006

In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the nぉe with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS' server selection method.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.289-298
• /
• 2006

Algorithms for application-level multicast often use trees to deliver data from the source to the multiple receivers. With the tree structure, the throughput experienced by the descendant nodes will be determined by the performance of the slowest ancestor node. Furthermore, the failure of an ancestor node results in the suspension of the session of all the descendant nodes. This paper focuses on the transmission of data using multiple virtual forwarders, and suggests a scheme to overcome the drawbacks of the plain tree-based application layer multicast schemes. The proposed scheme elects multiple forwarders other than the parent node of the delivery tree. A receiver receives data from the multiple forwarders as well as the parent node and it can increase the amount of receiving data per time unit. The multiple forwarder helps a receiver to reduce the impact of the failure of an ancestor node. The proposed scheme suggests the forwarder selection algorithm to avoid the receipt of duplicate packets. We implemented the proposed scheme using MACEDON which provides a development environment for application layer multicast. We compared the proposed scheme with Bullet by applying the implementation in PlanetLab which is a global overlay network. The evaluation results show that the proposed scheme enhanced the throughput by 20 % and reduced the control overhead over 90 % compared with Bullet.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.55-63
• /
• 2007

Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.159-168
• /
• 2021

Building Information Modeling (BIM) data is a digitized construction design by worldwide construction design stands rules. Some research are being conducted to utilize blockchain for safe sharing and trade of BIM data, but there is no way to store BIM data directly in the blockchain due to the size of BIM data and technical limitation of the blockchain. In this paper, we propose a method of storing BIM data by combining a distributed file system and a blockchain. We propose two network overlays for storing BIM data, and we also propose generating the Level of Detail (LOD)-based merkle tree for efficient verification of BIM data. In addition, this paper proposes a system design for distributed storage of BIM data by using blockchain besu client and IPFS client. Our system design has a result that the processing speed stably increased despite the increase in data size.