• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1431-1440
• /
• 2000

In order to support efficiently the multimedia applications, such as virtual classroom, video conferencing and tele-medical, the efficient multipoint-to-multipoint(MP-to-MP) connection management function is essential. Shared tree is reported as the most useful method for this purpose. In this paper we propose a new MP-to-MP connection setup & management scheme, called CIMA(Cell Interleaved Multiplexing on ATM) scheme,which is a VC merging method for MP-to-MP communication using shared tree. In the CIMA scheme,MRM cell delivers the cell merging information to the next node. The receiving node can identfy cells which arrived through a channel using the same VPI/VCI by the merging information in the MRM cell. Therefore the CIMA scheme can solve easily the Cell Interleaving Problem(CIP) that happens in VC merging. We analyzed the overhead of the proposed CIMA by mathematical analysis,and simulated the buffer usage of CIMA with OPNET. As the result of analysis,we found that the CIMA scheme has acceptable merging overhead and doesn't cause the buffer scare problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1847-1854
• /
• 2005

This paper proposes a approach to configure efficient video-on-demand system by introducing Multicast and Cache Video-on-Demand (MCVoD) system. As a key element or the MCVoD system, interchange agent provides this system with multicasting and switching functions. With the multicasting, the MCVoD system is able to reduce the load on the network as well as VoD servers by transmitting only one video request instead of sending multiple requests on a same video stream. The switching enables clients to receive the lust stream of requested video streams instantly without waiting time and also allows avoiding undesirable duplication of video streams in the system. With various experiment results through simulation about waiting tine and cache hit ratio, we show that the MCVoD system employing the interchange agent provides better performance than current uni-proxy based system.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.705-713
• /
• 2003

For group security to protect group data or to charge, group keys should be updated via key update messages when the membership of group changes. If we lose these messages, it is not possible to decrypt the group data and so this is why the recovery of lost keys is very significant. Any message lost during a certain member is logged off can not be recovered in real-time. Saving all messages and resending them by KDC (Key Distribution Center) not only requests large saving spaces, but also causes to transmit and decrypt unnecessary keys. This paper analyzes the problem of the loss of key update messages along with other problems that may arise during member login procedure, and also gives an efficient method for recovering group keys and auxiliary keys. This method provides that group keys and auxiliary keys can be recovered and sent effectively using information stored in key-tree. The group key generation method presented in this paper is simple and enable us to recover any group key without storing. It also eliminates the transmissions and decryptions of useless auxiliary keys.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.95-107
• /
• 2012

Network coding was proposed to increase the achievable throughput of multicast in a network. Recently, combining network coding into user cooperation has attracted research attention. For cooperative transmission schemes with network coding, users combine their own and their partners messages by network coding. In previous works, it was shown that adaptive DF with network coding can achieve diversity gain and additional throughput gain. In this paper, to improve performance of conventional protocols and maximize advantage of using network coding, we propose a new network coding based user cooperation scheme which uses adaptively amplify-and-forward and decode-and-forward according to interuser channel status. We derive outage probability bound of proposed scheme and prove that it has full diversity order in the high SNR regime. Moreover, based on the outage bound, we compute optimal power allocation for the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.331-338
• /
• 2011

Objectives of shipboard integration networks are to exchange and manage integrated information. Shipboard integration networks use UDP(User Datagram Protocol) multicast for the exchange of information. However, such information can be missed or damaged because UDP can't guarantee reliability. The standard of shipboard integration networks defines error log functions for the missed or damaged information. In this paper, we analyze internal and external log functions. The internal log function records errors internally, and the external log function sends error messages to a log server and records them in a database. We also develop a log processing module and log server for the external log function.

• Journal of Internet Computing and Services
• /
• v.14 no.2
• /
• pp.61-71
• /
• 2013

Until now, there have been various studies against Internet worms. Most of intrusion detection and prevention systems against Internet worms use detection rules, but these systems cannot respond to new Internet worms. For this reason, a malicious process control system which uses the fact that Internet worms multicast malicious packets was proposed. However, the greater the number of servers to be protected increases the cost of the malicious process control system, and the probability of detecting Internet worms attacking only some predetermined IP addresses is low. This paper presents a security framework that can reduce the cost of the malicious process control system and increase the probability of detecting Internet worms attacking only some predetermined IP addresses. In the proposed security framework, virtual machines are used to reduce the cost of control servers and unused IP addresses are used to increase the probability of detecting Internet worms attacking only some predetermined IP addresses. Therefore the proposed security framework can effectively respond to a variety of new Internet worms at lower cost.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.1
• /
• pp.46-56
• /
• 2008

Double Patching is a multicasting technique for a VoD system which has been proposed to provide a true VoD service by making clients share a long patching stream as well as a regular stream For subsequent short patching streams, the technique always makes the long patching stream have extra data that will be played back during a double period of a patching window. In this paper, we propose a technique, using the start time of the latest short patching stream, optimizes Double Patching by deleting the useless data included in the long patching stream when the patching window of the long patching stream closes. The mean requirement for the server's bandwidth to provide the true VoD service is used as a performance metric, and the effect of the request inter-arrival time, the size of the client's local buffer and the video length on the mean bandwidth requirement is evaluated. Performance evaluation result shows that the proposed technique optimizes Double Patching in all cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1026-1031
• /
• 2008

Nowdays, homes and small businesses rely more and more PON(Passive Optical Networks) for financial transactions, private communications and even telemedicine. Thus, encryption for these data transactions is very essential due to the multicast nature of the PON In this parer, we presented our implementation of a counter mode AES based on Virtex4 FPGA. Our design exploits three advanced features; 1) Composite field arithmetic SubByte, 2) efficient MixColumn transformation 3) and on-the-fly key-scheduling for fully pipelined architecture. By pipeling the composite field implementation of the S-box, the area cost is reduced to average 17 percent. By designing the on-the-fly key-scheduling, we implemented an efficient key-expander module which is specialized for a pipelined architecture.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.837-844
• /
• 2019

As the demand for video streaming has been rapidly increasing recently, video streaming schemes for increasing the efficiency of radio resource has attracted a lot of attention. In this paper, we propose an adaptive video streaming scheme to enhance the efficiency of video streaming by using receivers' caching capability. The proposed streaming scheme can transmit video data on a broadcast basis even when two clients request different video data, only if specific conditions satisfied, while existing schemes can only transmit video data on a broadcast basis only when two clients request the same video data. In this paper, we mathematically derive the average transmission time of the proposed scheme and the approximation of the average transmission time. The accuracy of the mathematical analysis is verified by simulations. Mathematical analysis and simulation results show that the proposed scheme can significantly reduce the average transmission time, compared to the existing scheme.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.1
• /
• pp.429-434
• /
• 2019

There are several high technologies applied to the driving cars such as self-driving car and connected car for safe and convenient driving. VANET provides useful information such as route selection and gas price by communicating nearby cars and RSUs. VANET prefers CCN rather than traditional TCP/IP stack because CCN offers inherent multicast communication for sharing traffic information as well as traditional unicast. When all participating node rebroadcasts the Interest packets in a Vehicular CCN, the network may suffer from Broadcast Storm Problem. In order to mitigate the effect of the problem and to improve the Data packet transmission, not all but some selected nodes have to rebroadcast the packet. This paper simulates car movements using SUMO and evaluates data transmission performance using ns-3. According to the simulation results, when some selected nodes rebroadcast the Interest packets, the transmission performance improves 10% to 25% depending on the number of requesting nodes.