• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1116-1132
• /
• 2010

In this paper, a new forward error correction (FEC) protocol is proposed for point-to-multipoint satellite links. Link-layer error control protocols in point-to-multipoint satellite links impose several problems such as unreliability and receiver-heterogeneity. To resolve the problem of heterogeneous error rates at different receivers, the proposed scheme exploits multiple multicast channels to which each receiver tunes. The more channels a receiver tunes to, the more powerful error correcting capability it achieves. Based on its own channel condition, each receiver tunes to as many channels as it needs, which prevents from receiving unwanted parities. Furthermore, each receiver saves the decoding time, processing overhead, and processing energy. Performance evaluation shows that the proposed scheme guarantees the target PER while saving energy. The proposed technique is highly adaptive to the channel variation with respect to the throughput efficiency, and provides scalable PER and throughput efficiency.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.625-627
• /
• 2001

기존의 멀티캐스트 프로토콜은 수신자가 주체가 되어 그룹에 가입/탈퇴하여 송신자는 그룹을 관리하기 힘든 구조로 되어 있으며, 전송 계층으로 WP를 사용하여 신뢰성이 보장되지 않는다. 본 논문은 교육 시스템과 같이 송신자(서버) 중심의 멀티미디어 데이터 통신이 이루어지는 시스템을 위해서 송신자 중심의 그룹 관리와 통신 신뢰성을 제공하는 멀티캐스트 미들웨어를 설계 구현한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.241-245
• /
• 1998

본 논문에서는 이동호스트에게 멀티미디어 데이터 전송 시 고려되어야 할 주요 특징과 문제점을 검토하고 이때 발생하는 문제점을 해결하기 위해 Mobile-IP환경에서 네트워크 링크의 공유에 의해 자원을 효율적으로 사용할 수 있는 멀티캐스트 방법을 기반으로 하고 이러한 멀티캐스트를 위한 인터넷 라우팅 프로토콜로는 링크-상태(link-state)알고리즘을 기반으로 하는 MOSPF(Multicast Open Shortest Path First)를 이용한다. 또한 인터넷상에서 라우터들이 멀티캐스트 그룹에 속하는 호스트들을 추적하기 위한 방법으로 IGMP(Internet Group Management Protocol)을 제안 사용하였다. 기존에 제안되어 사용되어지고 있는 UDP/IP based multicast를 사용할 경우에 패킷손실이나 전송지연 등을 위한 어떠한 성능도 보장받지 못하고 많은 대역폭이 요구되는 실시간 패킷들은 중계기의 트래픽 폭주(congestion) 현상에 의해 손실될 가능성이 높다. 이를 해결하기 위한 방안으로 실시간 데이터 전송 및 QOS를 제공하기 위해 RTP/RTCP 프로토콜을 접목시키는 방식을 기술하였다.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.559-569
• /
• 2001

With the growth of the Internet, applications using the reliable multicast protocol are increasing. Two important requirements of reliable multicasting are reliability and scalability. To enhance scalability, many methods have been proposed. A typical method is a local recovery scheme. This paper proposes a new stable and effective protocol with the following features. The first is to apply the discipline of the separations of concerns to NAK message. By dividing the functions of the NAK message into the error recovery request and the NAK-suppression, each function can be optimized. Second, a local representative, which is selected gradually and distributively, executes error recovery in somewhat deterministic manner. Finally, by dynamically adjusting the TTL value of the control message, the error recovery domain can be optimized. The proposed scheme has been implemented and experimented on Network Simulator. Compared to the existing schemes, the performance results show that scalability has not only been enhanced but also error recovery time and network overhead have been reduced.

• Convergence Security Journal
• /
• v.17 no.5
• /
• pp.87-92
• /
• 2017

MANET is a network composed itself because mobile nodes are connected wirelessly. It has been applied to various fields for group communication. However, the dynamic topology by the movement of the nodes causes routing failure frequently because it is difficult to maintain the position information of the nodes participating in the group communication. Also, it has a problem that network performance is decreased due to high overhead for managing information of member nodes. In this paper, we propose a multicast technique using location-based 2-tier virtual group that is flexible and reliable in management of member nodes. The network is composed of cellular zones and the virtual group is constructed using the location information of the nodes in the proposed technique. The virtual group management node is selected to minimize the overhead of location information management for member nodes in the virtual group. In order to improve the reliability for management of member nodes and multicast data transmission, it excludes the gateway node with low transfer rate when setting the route after the packet transmission rate of the member nodes is measured. The excellent performance of the proposed technique can be confirmed through comparative experiments with AMroute method and PAST-DM method.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.59-68
• /
• 2002

In this paper we issue some problems occurring when a mobile host moves from a base station to another in a wireless multicasting and propose a solution. In the case of not being in the same multicast group, the old base station will pre-forward data to neighboring base stations to avoid transmission delay. However, if other mobile hosts move at short interval, the old base station may retransmit the same dta to the same neighboring base stations. Also, the old base station should retransmit data if the new base station has already discarded data even if the new base station is a member of the multicast group. In this paper we propose called Information Exchange Scheme (IES). In this scheme, each base station exchanges indirectly the data delivery information with the rest of the base stations in the same multicast group for efficient and reliable multicast and pre-forwards data not retransmitting the same data for minimizing transmission delay when a mobile host moves. We also present how IES is efficient by analyzing and simulating.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.339-344
• /
• 2006

Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

• 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
• /
• 2004.04a
• /
• pp.784-786
• /
• 2004

오버레이 멀티캐스트는 인터넷에서 확장성 있는 일-대-다, 다-대-다 데이터 전송을 제공하기 위한 메커니즘으로 제안되었다. 하지만, 데이터 전송이 각 멤버들의 패킷 전송에 의존하게 되므로 한 멤버의 고장은 하위 멤버들이 데이터를 받을 수 없게 만든다 더욱이, 보다 높은 상위 계층의 멤버가 고장날수록 더 많은 하위 멤버들이 데이터를 받을 수 없게 된다. 본 논문에서는 오버레이 멀티캐스트에서 신뢰성 있는 데이터 전송을 위한 메커니즘을 제안한다. 제안된 메커니즘은 단-대-단 지연을 일정 간 이하로 유지시킬 수 있는 동시에 노드의 고장 확률에 기반 하는 오버레이 데이터 전송 트리(DDT)를 구성한다.