• Journal of Game and Entertainment
• /
• v.2 no.1
• /
• pp.8-16
• /
• 2006

The development of multicast communication services in the Internet is expected to lead a stable packet transfer even though On-Line Games generate heavy traffic. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibits two major deficiencies traffic concentration or poor core placement problem. Thus, measuring the bottleneck link bandwidth along a path is important to understand the performance of multicast. We propose a method in which the core router's state is classified into SS(Steady State), NS(Normal State) and BS(Bottleneck State) according to the estimated link speed rate, and also the changeover of multicast routing scheme for traffic overload. In addition, we introduce Anycast routing tree, an efficient architecture for constructing shard multicast trees.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1382-1390
• /
• 2010

A multicast session protocol in wireless networks reduces the session delay of multicast delivery caused by moving of mobile host. A hand-off scheme, called MSDR (multicast session delay reduction), in mobile networks is proposed. MSDR protocol that minimizes the delay of a session re-establishment uses the basic unicast routing function of the IETF mobile IP and the DFA (designated foreign agent) to provide multicast services for mobile hosts. Proposed MSDR protocol allows the mobile hosts to continuously receive packets when they move across the basic sets during hand-off. Discrete-event simulation carried out for performance evaluation of MSDR protocol, and simulation results indicated that our scheme can offer a better performance of multicast session delay reduction in terms of signalling cost than that of IETF.

• Annual Conference of KIPS
• /
• 2002.04b
• /
• pp.1483-1486
• /
• 2002

Multicast protocols are efficient methods of group communication, but they do not support the various transmission protocol services like a reliability guarantee, FTP, or Telnet that TCPs do. The purpose of this dissertation is to find a method to utilize sewer routers to form multicasts that can simultaneously transport multicast packets and TCP packets. For multicast network scalability and error recovery the existing SRM method has been used. Three packets per TCP transmission control window size are used for transport and an ACK is used for flow control. A CBR 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4343-4355
• /
• 2014

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD（Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.296-296
• /
• 2004

• Annual Conference of KIPS
• /
• 2006.05a
• /
• pp.861-864
• /
• 2006

인터넷과 무선통신 기술의 발달로 Mobile IP 에 대한 관심이 높아지고 있는 가운데 이동 중에도 멀티캐스트 서비스를 이용하기 위해 여러 가지 기술이 연구되고 있다. 인터넷과 멀티캐스트는 열린 모델이라 보안위협에 취약하다. 특히 멀티캐스트에서는 멀티캐스트 분배트리에 대한 접근제어가 중요하다. 본 논문에서는 이동 멀티캐스트에서 멀티캐스트 분배트리에 대한 송신자의 접근제어를 제공하여 서비스의 신뢰성을 높일 수 있는 MSAC (Multicast Source Access Control) 메커니즘을 제안한다. MSAC 과정은 이동하는 멀티캐스트 송신자의 정보들을 MSAC 서버를 통해 인증을 받아 허가되지 않은 노드의 멀티캐스트 분배 트리에 대한 접근을 방지하는 기법이다. MSAC 는 인터넷의 계층적인 특성을 이용하여 인증 회수를 줄이고, 토큰 인증방식을 사용하여 인증 시 메시지를 교환하는 횟수를 줄인다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.629-637
• /
• 2000

Unbalance between user requirements and insufficient network resources makes a congestion. In the future since the communication networks will have very heavy traffic congestion will be more serious. The ATM networks was recommended to support the B-ISDN service for the future multimedia communication. In thie sense of congestion avoidance and recovery the ABR service category in ATM networks allows the feedback flow control mechanism to dynamically allocate the idle bandwidth of the network to users fairly and to control the network congestion rapidly In this paper we introduce a congestion control scheme using systematical approach to confirm robust stability with respect to unknown round trip delay for the network which has both unicast and multicast connections.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.745-754
• /
• 2007

In this paper, we present the Enhanced Communication Transport Protocol-Part 5 (ECTP-5), which provides scalable and reliable multicast communication service for many-to-many applications by constructing high quality recovery trees from two-layer logical trees and repairing the losses via unicast automatic repeat request-based error control. In order to realize the protocol, we developed feasible protocol architectures and building blocks including additional functions which deal with engineering details, such as membership dynamics and sender coordination. Experimental results show that ECTP-5 scales well with various session sizes and packet loss rates in terms of control overhead and recovery latency.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.577-581
• /
• 2010

We introduce a novel packet retransmission technique which improves the efficiency of automatic retransmission query (ARQ) protocols in the context of satellite broadcast/multicast systems. The proposed coded ARQ technique, similarly to fountain coding, performs transmission of redundant packets, which are made by linear combinations of the packets composing the source block. Differently from fountain codes, the packets for the linear combinations are selected on the basis of the retransmission requests coming from the user terminals. The selection is performed in a way that, at the terminals, the source packets can be recovered iteratively by means of simple back-substitutions. This work aims at providing a simple and efficient alternative to reliable multicast protocols based on erasure correction coding techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.638-646
• /
• 2003

In this paper, we propose a group communication approach which can provide quality of service for soft real-time applications. This proposed scheme combining the explicit multicast, end-point measure-based admission control scheme(EMBAC), and diffserv, removes the need of maintaining state information in the network, so that it would be easily deployable in real networks. We propose the scheme of node configuration to measure the quality of the diffserv network, and that of managing EMBAC over group communication environment. By simulation, we validate the QoS of the proposed multicast service network.