• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2194-2212
• /
• 2013

The multicast routing architectures have become indispensable due to the increasing needs for extreme communication services anywhere and anytime. The most recent approaches are called hierarchical and fully distributed, what have been proposed by O. Said et al. in a previous work. These proposed architectures were introduced to enhance the service-centric approach. In this paper, NS2 is used to build a simulation environment to test the hierarchical and the fully distributed multicast architectures as regards the service-centric one. The results of simulation show that the performance of the hierarchical and the fully distributed architectures outperforms the service-centric architecture. Furthermore, the fully distributed architecture is found to have the best performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.86-89
• /
• 2002

Recently, video conferencing, Web-casting service, and network sane service which use multicast-based service are popular in Internet. In order to support the broadband Internet services efficiently, more communication bandwidth are needed. The WDM single-hop broadcast network topology is coming into the spotlight in next-generation access networks area. In this paper, the new multicast scheduling algorithm, PGM, is proposed and is evaluated through the computer simulation. The PGM method shows the better performance comparing with existing multicast scheduling algorithm.

• The Journal of Information Technology
• /
• v.7 no.3
• /
• pp.119-126
• /
• 2004

In multicast traffic, an input can request to connect to up to a certain number of outputs. This reviews the multicast nonblocking multistage interconnection networks. In a multistage interconnection network each stage consists of crossbars of the same size. This paper focuses on the three-stage network and its recursive extensions. Not only will this article bring the literature upto date, but it also will provide some fresh viewpoints to either clarify or simplify some issues.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.323-330
• /
• 2002

Multicast services are gradually diversified and used widely. Proportionately, they become the center of attackers' attention and there are growing possibilities of an intelligence leak. Therefore, research related to secure multicast should be required to provide multicast service efficiently. This paper presents the architecture for secure multicast which provides efficient group management mechanism in group consists using member's dynamic join and leave. This architecture can provide secure multicast services to many users with regard to security aspects in one-to-many communication. The simulation results show that the proposed architecture achieves an efficient group management and a secure data transmission with low latency compared with the other existing secure multicast architecture.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.51-55
• /
• 2008

Request High-Images, High-quality, duplex transmission, BcN Voice telephone, Broadcast, Data internet service came to be all possible and demolished original communication service area. Also, The quality is guaranteed stablely to new business and ISP the requirement comes to become a multicasting quality guarantee mechanism which there is the reliability for a information communication and High-quality multimedia service. Like this, a multicast mechanism to be guaranteed must become air control End-to-End QoS for a service supply, a transmission delay a packet loss or requirement which the user requests guarantee and multicast Path-NET which there is the reliability must be provided. Therefor, we proposed IP base multicast new join the present the multicast mechanism of Probing packet foundation which there is the efficiently a linking acceptance, we used ns-2 simulator for the performance evaluation of the proposed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.520-526
• /
• 2018

In this paper, considering the superposition transmission-based wireless cooperative multicast communication system (ST-CMS) with multiple relays and destinations, we propose a relay selection scheme to improve the data rate of multicast communication. In addition, we adopt the optimal power allocation coefficient for the superposition transmission to maximize the data rate of the proposed relay selection scheme. To propose the relay selection scheme, we derive an approximate expression for the data rate of the ST-CMS, and present the relay selection scheme using only partial channel state information based on the approximate expression. Moreover, we derive an approximate average data rate of the proposed relay selection scheme. Through numerical investigation, comparing the average data rates of the proposed relay selection scheme and the optimal relay selection scheme using full channel state information, we show that the proposed scheme provides extremely similar performance to the optimal scheme in the high signal-to-noise power ratio region.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1037-1050
• /
• 2000

A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch. A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch.

• 한국벤처창업학회:학술대회논문집
• /
• 2010.08a
• /
• pp.71-89
• /
• 2010

It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

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

As services requesting data transfer from a sender to a multiple number of receivers become popular, efficient group communication mechanisms like multicast get much attention. Since multicast is more efficient than unicast in terms of bandwidth usage and group management for group communication, many multicast protocols providing scalability and reliability have been proposed. Recently, router-supported reliable multicast protocols have been proposed because routers have the knowledge of the physical multicast tree structure and, in this scheme, repliers which retransmit lost packets are selected by routers. Repliers are selected dynamically based on the network situation, therefore, any receiver within a multicast group can become a replier Hence, all receivers within a group maintains a buffer for loss recovery within which received packets are stored. It is an overhead for all group receivers to store unnecessary packets. Therefore, in this paper, we propose a new scheme which reduces resource usage by discarding packets unnecessary for loss recovery from the receiver buffer. Our scheme performs the replier selection and the loss recovery of lost packets based on the LSM [1] model, and discards unnecessary packets determined by ACKs from erasers which represent local groups.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1231-1238
• /
• 2003

As the demand on multicast services increases to support the terminal mobility in the midst of the development of wireless mobile communication technology, many new methods have been studied. However, previous methods occur delay and packet loss during re-joining to multicast service group when moving mobile node. In this paper, we will propose a scheme that decreases packet loss using regional registration method. Proposed scheme modified signaling message of previous regional-registration and added caching. In case move to same GFA, we can prevent packet loss by keeping registration to FA until perfectly registration ends. Also, In case move to other GFA, we can reduce packet loss by using cache. Therefore, we can receive efficient multicast service.