• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.223-227
• /
• 2006

인터넷의 발전에 따라 다자간 그룹 통신 환경이 주목을 받게 되었고 이를 위해 다대다 멀티캐스트를 이용한 통신 기법들이 제안되었다. 이들 중 GAM (Group Aided Multicast) 은 다대다 멀티캐스트의 신뢰적 전달을 보장하기 위해 트리 기반의 손실 복구 기법을 제안하고, 제어 트리 관리 비용과 손실 복구 효율성간의 접점을 찾기 위해 그룹 개념을 도입하고 그룹의 대표로서 코어 노드를 정의한다. 코어 노드는 네트워크 상의 특정 지점에 미리 설치된 전용 노드로서 그룹 내의 손실 복구와 그룹 간의 손실 제어를 담당한다. 그러나 이러한 전용 코어 노드의 도입은 프로토콜의 가용성을 제한하고 코어 노드의 설치 부담을 가지게 된다. 따라서 본 논문에서는 별도의 코어 노드의 설치 없이 프로토콜이 동작할 수 있도록 세션 참가자 중에서 코어 노드를 동적으로 선택하고, 로컬 그룹 노드 중에서 제어 트리의 효율성을 최대한 보장하는 노드의 위치를 결정하는 기법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.196-197
• /
• 2007

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2943-2953
• /
• 1998

As communication networks become very fast, the scope of applications is varied and applications using multi-party communications in which more than one communication station participate, have been increased. In this paper, multicast servers are designed and implemented by two different schemes (centralized multicast server scheme and distributed multicast server scheme). Both scheme contain three operation for joining/leaving of a node, operation for transmitting the name of the group and messages to the server, and operation for a node to read messages and clear shared memory. Based on their implementations, two multicast server schemes are compared in terms of complexity, extendibility, efficiency and real-time aspects. As a result, the average transfer time of the distributed multicast server scheme is shorter than that of the centralized multicast server scheme. Finally, we designed the multi-party real-time communication method to guarantee QoS in multicast.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1018-1033
• /
• 2010

Recently, as the use of mobile terminal is generalized, the needs of high-speed Internet mobile service is increased. Also users want to receive the multimedia contents what they want through the various terminals in anywhere, anytime via wired and wireless integrated environment. Therefore, various mechanisms that support the mobility are proposed. However, these mechanisms are difficult to support seamless mobility and QoS awareness on the mobile multicast environment. In this paper, we propose a QoS aware handover mechanism that is able to provide the high-quality and real-time services such as mobile IPTV in an integrated environment for these requests of users. Proposed mechanism manages the multicast admission control and multicast handover using the 2-layer multicast information management at the wired and wireless integrated network that extended the service guaranteed methods through the probing based admission control of the wired network to the wireless network based on PMIPv6. We present a performance evaluation results and features analyzed by the simulations using the ㎱-2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1399-1406
• /
• 2009

In the internet broadcast, efficient and scalable mechanism of multicast is needed for the communication between groups. Furthermore, Optimization of the multicast tree is required to improve the performance of overlay multicast. This optimization is well-known as NP-complete. If a node in the tree has limited out-degree, a user who wants to join the group has to find parent user who has already joined. In this paper, the users who want to join the group need to setup their level using delay test from source node. And then new users can find candidate parent nodes effectively using ACK-SEND approach and take proper position by comparing level. The closer node of the user to root node should be located in lower level. Also, even if a barrier is caused, fast recovery will be guaranteed using ACK-SEND approach. Through this, the newcomer node can fine their location in the multicast tree and join the group fast and effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.27-38
• /
• 2005

IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.377-385
• /
• 2010

In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.600-610
• /
• 2010

In this paper, a multicast mechanism is proposed for intermittently disconnected networks where the nodes move forward in formation or within a limited area. The proposed scheme extends the well-known tree-based multicast routing mechanism called MAODV by modifying the tree construction and data delivery scheme. Especially, an algorithm is introduced which determines the flooding hop count k estimating the degree of the movement of children in the tree. The performance evaluation was done by the simulation and the proposed scheme was compared with MAODV and two multicast routing schemes for DTN (Disruption Tolerant Network) including the Epidemic routing and ST-multicast. The evaluation results show that our scheme improves the original MAODV from the aspect of tree reconstruction events and message delivery ratio. Compared with the Epidemic routing scheme, our scheme achieves 85% message delivery ratio with less than 50% message delivery overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.57-65
• /
• 2007

The overlay multicast that has been recently presented as IP alternative for the IP multicast has been getting much persuasion by the computing power of the hardware and the advancement of the network techniques to enforce Routing in application-level. In an overlay multicast, the system resource and the network bandwidth must be utilized efficiently to service real-time HDTV images. Specifically, the system must consider the delay and the jitter that can be incurred at the application-level. In this paper, we implement a server and a client to broadcast HDTV, in the session composed by the existing overlay multicast protocol. The broadcasting server performs the service using a TV tuner, An HDTV camcorder, and files, clients constituting a multicast group relay the received data to other clients. At this time, the information that the clients report periodically, including their delay and the network state, to the server is used as an important information to maintain an overlay session. The implementation is based on the DirectX and its performance is evaluated by the LAN test bed that has been set.