• 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 Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.924-927
• /
• 2003

To support emerging group applications such as network games and Internet live-casting efficiently, IP multicast mechanism is highly needed. But IP multicast still has not been deployed in the current Internet because of its difficulty to manage. RMCP is designed to deliver multicast data in the unicast environment with the help of SM and MA mechanism. In this paper we discuss on RMCP design and test on APAN network.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.2
• /
• pp.53-62
• /
• 2008

Intensive studies have been made in the area of IPTV VOD server. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer utilization, disk performance and network bandwidth. The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a efficient overlay multi_casting network policy for multimedia services with multi media partition storage. Simulation results show that the rate of service number and service time of proposed scheme are about 23% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.378-390
• /
• 2006

Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility, and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing, and naming mechanisms. Our aim is to design an efficient and robust addressing, routing, and naming infrastructure for these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our infrastructure is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed k-resilient name to address binding system. This paper describes the design of our overlay infrastructure and presents performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.262-267
• /
• 2007

다자간 분산형 협업 시스템인 Access Grid(AG)는 IP 멀티캐스트 네트워크상에서 여러 사용자들 간에 영상, 음성 및 다양한 데이터의 공유를 통해 상호 의사소통이 가능한 공동 작업환경을 제공하기 위해 개발되었다. 멀티캐스트를 사용함으로써 AG는 대역폭 효율적으로 다수 사용자 사이의 의사소통 환경을 제공하고 있다. 그러나 IP 멀티캐스트의 설정 및 관리상 복잡성으로 인해 이를 지원하지 않는 네트워크가 다수 존재한다. 이는 AG를 이용한 협업 서비스를 이용하는 데에 큰 장애물이 되고 있다, 본 논문에서는 이러한 멀티캐스트 연결성 문제에 대한 해결책으로 응용 계층의 멀티캐스트 터널링 프로토콜인 UMTP (UDP multicast tunneling protocol) 를 확장한 멀티캐스트 연결성 솔루션인 AG Connector를 제안한다.

• 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.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.42 no.6 s.336
• /
• pp.9-16
• /
• 2005

In this paper, we focus on supporting the convergence of broadcasting and communication in home network systems with E-PON based home gateway. We propose a new architecture to provide broadcasting and data services in integrated home network using overlay transport mechanism in access network and If multicast techniques of IGMP and IGMP snooping in home network. We also detail a set of mechanisms and procedures for home broadcasting service through the home gateway system. Our new scheme is composed of three parts: a) an overlay transmission model of video broadcasting signals (satellite and/or cable TV) and Internet data, b) to select a specific video broadcasting channel and to make of the selected video broadcasting stream into IP multicast packets in tuner/conversion module using multiple tuner system and c) to transfer the converted If multicast packets to L2 switch of home gateway's core module and to send them out to target port(s) by L2 multicast using IGMP snooping.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.1
• /
• pp.35-40
• /
• 2019

It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

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