• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1256-1265
• /
• 2003

Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.

• Journal of Advanced Navigation Technology
• /
• v.20 no.4
• /
• pp.352-360
• /
• 2016

In this paper, a novel multiple multicast feed-back scheme for improving multimedia multicast and broadcast system based on IEEE 802.11. The proposed scheme improves multicast PPDU delivery ratio of next generation wireless LAN by utilizing multicast feed-back information. By using the proposed scheme, regardless of its size of multicast group, an AP STA could collect transmission failure information by receiving simultaneous NAK frame. The proposed scheme shows large performance enhancement in broadcast or multicast system of Intelligent Transport System and Passenger Entertainment Service. According to the analysis results, the proposed scheme could enhance wireless LAN multicast and broadcast performance significantly.

• Journal of Digital Contents Society
• /
• v.16 no.2
• /
• pp.275-282
• /
• 2015

Since starting of terrestrial digital broadcasting in 2001, there has been discussion on introduction of multiple broadcasting services, one of advantages of digital broadcasting. In the mean time, task force on terrestrial multiple channel experimental broadcasting was formed with government organizations, broadcasting companies and household appliance companies in Oct. 2013, and terrestrial multiple channel experimental broadcasting was started between Jan. to April, 2014. Based on this experimental result, EBS started 2HD MMS experimental broadcasting first in Korea on Feb. 11, 2015. This study was carried out in consideration of operation of 2 HD channels in existing 6MHz bandwidth based on MPEG-2 codec with development of compression technology. A study on image quality optimization was carried out and applied to 2HD MMS experimental broadcasting through application experiment of variable bit rate and change according to 1080i and 720p scanning type.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.258-268
• /
• 2005

The efficient provision of multicast service to moving hosts in mobile computing environments is not so easy task. Bi-directional tunneling scheme causes overhead about encapsulation and triangular routing. On the other hand, remote subscription scheme need freDuent tree reconstruction, which is inefficient for rapid moving hosts. In this paper we propose Mobility Based Mobile Multicast(MBMOM) scheme which is based on host's mobility information. Ultimately MBMOM try to find the strong points of remote subscription scheme and hi-directional tunneling scheme. If host's mobility speed is considered to be high, multicast packets are forwarded using hi-directional tunneling scheme from home agent continuously. If host's mobility speed is considered to be slow, remote subscription scheme is applied for foreign agent and it try to join multicast tree. We developed analytical models to analyze the performance of proposed scheme and simulated our scheme compared with MOM(Mobile Multicast), RBMOM(Range Based MOM), and TBMOM(Timer Based MOM) schemes. Simulation results show that our scheme has shorter transmission delay than above 3 schemes in the aspect of host's mobility speed and multicast group size.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.597-604
• /
• 2002

Changing group key is necessary for the remaining members when a new member joins or a member leaves the group in multicast communications. It is required to guarantee perfect forward and backward confidentiality. Unfortunately, in large groups with frequent membership changes, key changes become the primary bottleneck for scalable group. In this paper, we propose a novel approach for providing efficient group key distribution in large and dynamic groups. Unlike existing secure multicast protocols, our protocol is scalable to large groups because both the frequency and computational overhead of re-keying is determined by the size of a subgroup instead of the size of the whole group, and offers mechanism to prevent the subgroup managers with group access control from having any access to the multicast data that are transfered by sender. It also provides security service for preserving privacy in wireless computing environments.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.52-63
• /
• 1998

In this paper, several improvements to a copy network proposed previously for multicast packet switching are described. The improvements provide a solution to some problems inherent in multicasting. The input fairness problem caused by overf low is solved by a dynamic starting point decider(DSD), which can calculate running sums of copy requests starting from any input port. The starting point is changed adaptively in every time slot based on both the fill level of the input buffers in current time slot and the overflow situations of the previous time slot. Using the fill level of the conventional network. The DSD also provides the function of regulating overall copy requests according to the amount of input traffics. This is an essential function in improving overall throughputs of the copy networks. The throughput of a multicast switch can be improved substantially if partial service of copy request is implemented when overflow occurs. Call-splitting can also be implemented by the DSD in a straightforward manner. The hardware for the DSD is derived with the objective of simple architectures for the high speed operation. Simulation study of the copy network under various traffic conditions is presented to evaluate its performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.482-484
• /
• 2017

Over the past 70 years, movies and television have revolutionized the way people communicate. However, even with this development, TV has been used only as a means of communication targeting an unspecified number of people due to the restriction of media such as radio waves and movies. However, the development of the Internet and online video has come to a time when 100 million people watch YouTube videos uploaded from the other side of the world by eliminating these restrictions. The message that you want to deliver now can be delivered to anyone, but making the image with these messages remains the last obstacle to communication. To solve these problems, we implemented a web application and a video production program through AWS. This system basically provides the administrator with the video production through the easy interface, the information management and the program on the server on the internet through AWS, the assigned lecture including the computer and the smart phone, the learning materials, And implemented to increase the efficiency of educational video production service.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.775-781
• /
• 2015

EBS started 2HD MMS experimental broadcasting for the first time in Korea on Feb. 11, 2015. It uses the picture compression technique based on MPEG-2 CODEC, and applies the result of the experiment about variable bit rates and changes according to the scanning types, 1080i and 720p. But when changing channels, the delay in displaying picture occurs because of the operation of the variable GOP on MMS broadcasting, which optimizes image quality by application variable bit rates. In this study, verified the relationship between the decoding time of I frames and the GOP set in the encoding step by experimenting and analyzing ON-AIR TS. By using the verification data and adjusts the Encoder GOP parameters, improved the different video display time delays according to the scanning mode 1080i and 720p.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.137-145
• /
• 2006

In this paper, we propose a multicast P2Patching technique in the application layer. The P2Patching technique serves VOD stream effectively with Patching in P2P environment. The P2Patching provides multicast tree construction technique that reduces the server load and minimizes the start delay with extended multicast technique. And we provide a fast recovery technique by tree failure and dynamic buffering scheme that guarantees the continuous streaming by frequent tree disconnections. Comparing the method with that of $P2Cast^{[12]}$, we obtained the better performance by our scheme in terms of average join count, service rejection probability, tree recovery failure and buffer starvation. The average about 16$\%$ of the improvement is shown by the simulation. Most of all, the performance of buffer starvation and average join count shows a significant improvement than that of P2Cast.