• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.213-215
• /
• 2003

Multimedia has to carry data of heterogeous types. Multicast communication techniques can supply the most appropriate infrastructures to such multimedia. Of many multicast protocols, the core based tree (CBT) protocol is the most concentrative studies are conducted on. The CBT places a core router at center of the shared tree and transfers data through the tore router. However, the CBT has two problems due to centralizing all network traffics into a core router. First it can raise bottleneck effect at a core router. Second, it is possible to make an additive processing overhead when core router is distant from receivers. To cope with the problems, this paper proposes an intelligent anycast routing protocol. The anycast routing attempts to distribute the centralized traffic into plural core routers by using a knowledge-based algorithm. The anycast routing estimates the traffic characteristics of multimedia data far each multicast source, and achieves effectively the distributing that places an appropriate core router to process the incoming traffic based on the traffic information in the event that request of receivers are raised. This method prevent the additional overhead to distribute traffic because an individual core router uses the information estimated to multicast sources connected to oneself and the traffic processing statistics shared with other core neuters.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.172-175
• /
• 2002

This paper considers a packet-scheduling algorithm for a given combined traffic of unicast and multicast data packets and proposes a hybrid router with several dedicated buses for multicast traffic. Our objective is to develop a scheduling algorithm that minimizes schedule length for the given traffic in the hybrid router. We derive a lower bound and develop an optimal solution algorithm for the hybrid router.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1083-1088
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffic concentration and bottlenecks near the core routers since traffic from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.154-157
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffice concentration and bottlenecks near the lore routers since traffice from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1011-1014
• /
• 2002

This paper proposes a multicast packet-switching method which can less affect QoS degradation. The method includes a switch fabric with extra switching paths dedicated for multicast packets. Presented also are both a buffering structure and a scheduling algorithm for the proposed method. Simulation analysis for the method shows that the switching delay of unicast packets is decreased even though arrival rate of multicast packets is increased.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.295-297
• /
• 2002

기존에 멀티캐스트를 제공하기 위해서 제안된 Any Source Multicast(ASM)의 경우는 각각의 라우터에서 망의 상태정보를 유지해야 하는 문제점으로 인하여 아직까지 망에 구현되고 있지 않다. 이를 해결하기 위해 망의 상태정보를 가지지 않는 Xcast, Application Layer Multicast(ALM)과 같은 메커니즘들이 제안되었다. 하지만 Xcast의 경우는 경로상의 모든 라우터가 Xcast를 지원해야 하는 문제점이 있고, ALM에는 다양한 모델이 제시되었지만 구체적 메커니즘들은 아직 연구중인 상태이다. 본 논문에서는 멀티캐스트를 응용계충에서 수행하는 오버레이 멀티캐스트 모델에 기반한 Designated Router Multicast(DRM)을 제안한다. 제안된 메커니즘은 망에서 상태 정보가 필요하지 않으며 이를 위해 종단 라우터 간의 Mesh 구조에 기반한 터널링 방법에 의해 멀티캐스트 서비스를 수행한다.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.297-300
• /
• 2001

This paper proposes a sound multicast packet-switching method which can less affect QoS degradation. The method includes a switch fabric with extra switching paths dedicated for multicast packets. Presented also are both a buffering structure and a scheduling algorithm for the proposed method. Simulation analysis for the method shows that the switching delay of unicast packets is decreased even though arrival rate of multicast packets is increased.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.424-436
• /
• 2003

In this paper, we propose the Centroid-based Backbone Core Tree(CBCT) generation algorithm for the shared tree-based IP multicasting. The proposed algorithm is based on the Core Based Tree(CBT) protocol. Despite the advantages over the source-based trees in terms of scalability, the CBT protocol still has the following limitations; first, the optimal core router selection is very difficult, and second, the multicast traffic is concentrated near a core router. The Backbone Core Tree(BCT) protocol, as an extension of the CBT protocol has been proposed to overcome these limitations of the CBT Instead of selecting a specific core router for each multicast group, the BCT protocol forms a backbone network of candidate core routers which cooperate with one another to make multicast trees. However, the BCT protocol has not mentioned the way of selecting candidate core routers and how to connect them. The proposed CBCT generation algorithm employs the concepts of the minimum spanning tree and the centroid. For the performance evaluation of the proposed algorithm, we showed the performance comparison results for both of the CBT and CBCT protocols.