• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.145-148
• /
• 2003

A lot of institutes have proposed RMT (Reliable Multicast Transport) techniques over IP multicast environment which provides only best-effort services. The ECTP (Enhanced Communications Transport Protocol) is a kind of RMT technique and an international standard of ITU-T and JTC1/SC6. It is a protocol that provides reliability fer IP multicast environment. In this paper, we tested ECTP applications which are MFTP (Multicast file transport protocol) and WB (white Board) on the APAN (Asia-Pacific Advanced Network) with the Kyushu University in Japan. We measured ECTP traffic using a packet capture tool that programmed by Pcap library that is developed in Lawrence Berkeley institute. In according to the result, we think that ECTP is an efficient protocol in transporting files to many receivers simultaneously.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.3-17
• /
• 2007

Receiver access control scheme is proposed to protect multicast distribution tree from DoS(Denial-of Service) attack induced by unauthorized use of IGMP(Internet group management protocol), by extending the security-related functionality of IGMP. Based on a specific network and business model adopted for commercial deployment of IP multicast applications, key management scheme is also presented for bootstrapping the proposed access control as well as accounting and billing for CP(Content Provider), NSP(Network Service Provider), and group members.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1145-1157
• /
• 1999

본 논문에서는 RFC 2022에서 제안한 MARS 모델을 기반으로 하여 단일 대규모 클러스터를 가지는 ATM 망에서 다중의 멀티캐스팅 서버(MCS)를 이용한 멀티캐스팅 방안을 제안하고 그 성능을 평가하였다. 클러스터 내의 한 ATM 호스트가 특정 IP 멀티캐스트 그룹에 가입할 경우 ATM 호스트의 위치와 이미 존재하는 멀티캐스팅 서버들 사이의 전송 지연을 고려하여 가능한 한 종단간 전송 지연을 최소화하는 멀티캐스팅 서버를 선택하는 방안을 기술하였다. 이 방안은 최단거리 경로 알고리즘(shortest path algorithm)에 기반하여 최적의 MCS를 선정하고 송수신자 사이의 최소 지연을 가지는 멀티캐스트 트리를 구성한다. 다양한 망 위상에서 MCS의 분포 패턴을 다르게 할 경우에도 이 방안은 멀티캐스트 트리의 평균 전달 지연을 줄이는 것을 시뮬레이션을 통하여 확인하였다.Abstract In this paper, we proposed a scheme to support multiple MCSs over a single and large cluster in ATM networks, evaluated its performance by simulation. When an ATM host requests joining into a specific multicast group, the MARS designate a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. This scheme constructs a multicast tree through 2-phase partial multicast tree construction based upon the shortest path algorithm.We reduced the average path delay in multicast tree using our scheme under various cluster topologies and MCS distribution scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.558-561
• /
• 2004

Currently, most IP multicasting applications are implemented based on Any-Source Multicast (ASM) model that supports many to many multicast services. However, it is known that current ASM-based multicast architecture has several deployment problems such as address allocation, lack of access control, and inefficient handling of well-known multicast sources. Source-Specific Multicast (SSM) working group in IETF proposed SSM architecture to overcome the weaknesses of ASM architecture. The architecture of SSM is based on one to many multicast services. Also, in order to provide SSM service, Multicast Listener Discovery Version 2 (MLDv2) protocol should be supported. In this paper, we introduce the architecture of SSM protocol and multicast group management protocol. After that, we present the architecture and implementation of IPv6 SSM and MLDv2 protocols in Linux systems.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.557-566
• /
• 2008

NGN(Next Generation Network) is a communication network which can make use of broadband and QoS-enabled transport technologies. One of the main service issues over NGN is a multimedia service, such as IPTV, using a multicast method. And overlay multicast technology is one of the promising solutions instead of traditional multicast technology which has a few problems, and supports flexibility and scalability for multicast services. Also, the main controversial topic in NGN and overlay multicast is QoS. In the present paper, we designed an agent in each receiver's network, and a manager which is in a source network and which manages the whole multicast network. Both of them are communicating with each other and applying resource policies to their multicast network. This mechanism enables overlay multicast to support QoS, focusing on RACF(Resource and Admission Control Functions) in NGN QoS architecture.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.345-354
• /
• 2003

IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing control packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.23-29
• /
• 2002

Multicast protocols are efficient methods of group communication such as video conference, Internet broadcasting and On-Line Game, but they do not support the various transmission protocol services like a reliability guarantee, FTP, or Telnet that TCPs do. The Purpose or this Paper is to find a method to utilize multicast routers can simultaneously transport multicast packets and TCP packets. For multicast network scalability and error recovery the existing SRM(Scalable Reliable Multicast)method has been used. Three packets per TCP transmission control window site are used for transport and an ACK is used for flow control. A CBR(Constant Bit Rate) and a SRM is used for UDP traffic control. Divided on whether a UDP multicast packet and TCP unicast packet is used simultaneously or only a UDP multicast packet transport is used, the multicast receiver with the longest delay is measured on the number of packets and its data receiving rate. It can be seen that the UDP packet and the TCP's IP packet can be simultaneously used in a server router.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.61-64
• /
• 2005

The packet loss problem that occurs in the mobile multicast (MoM) protocol due to designated multicast service provider (DMSP) handoff is investigated through simulation experiments for several DMSP selection policies. Then, two enhanced DMSP schemes are proposed to minimize the packet loss of the MoM protocol with single DMSP. The first scheme uses a backup DMSP and greatly reduces the packet loss rate at the expense of the increased network traffic. The second scheme utilizes the extended DMSP operation and shows many desirable features such as the almost-zero packet loss rate and relatively low network traffic.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.93-103
• /
• 2000

This paper describes Internet multicast routing protocols over MPLS (Multiprotocol Label Switching) networks. Internet multicast routing protocols are divided into 3 categories in terms of tree types and tree characteristics: a shortest path tree, a shared tree and hybrid tree types. MPLS should support various multicast mechanisms because of extremely different IP multicast architectures, such as uni-/bi-directional link, Flooding/prune tree maintenance mechanism, the existence of different tree types with the same group, etc. There are so many problems over MPLS multicast that the solutions can't be easily figured out. In this paper, we make a few assumptions on which the solutions of IP multicast routing protocols over MPLS networks are given. A broadcasting label is defined for the shortest path tree types. Cell interleaving problems of the shared tree types is solved by using block-based transmission mechanism. Finally, the existing hybrid-type multicast routing protocol is reasonably modified to support MPLS multicast.