• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.8-12
• /
• 2009

We propose BMPA(balanced multimedia packet allocation) scheme. This scheme considers the issue of optimal sub-carrier allocation in OFDMA multicast system. When RT(real time) packets and NRT(non-real time) packets arrive at the same time, BMPA scheme gives higher weight to RT packets than NRT packets and then, it allocates sub-carriers according to the total weight sum of packets in each user. This process acts as both packet scheduler and sub-carrier allocation. Therefore, each user receives multimedia packets with reliability. With simulation results, it shows that BMPA scheme ensures long-term system throughput and, in average RT packet delay, BMPA scheme greatly outperforms multi-user water-filling algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.191-198
• /
• 2002

Recently, Usage of multimedia server is rapidly increased with expansion of internet that real-time displaying service for multimedia data, MPEG and etc. For these multimedia real-time applications, it is necessary to use a disk array as a storage system. For providing requested service to much more clients at the same time in a multimedia data storage server, considerable varied strategies in a several parts. But especially it is important feature to various parameters for disk array such as relation of striping block size as a system environment and characteristics of video data. In this paper, we implemented real environment of multimedia server which provides MPEG-1 files and evaluated the suitable storage system architectures by applying synthetically generated workloads in the various parameters for disk array.

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

It is thesis that based on for Croup-Transferring a method of Transferring-Control during real-time. By the development of multimedia, spread of high-speed communication network and generalization of various multimedia services, various techniques an studied by requiring application services for multi-users (meeting-service, remote-service, broadcasting-service, education-service and so on). So we focused on the multimedia group transferring techniques except communication network techniques and multimedia processing techniques, and presented algorithms about a mettled of group-management, a method of delay-control-management that analyzed a effective method of Croup-Control and characters of each group network and used RTP(Real-Time Protocol) / RTCP(Real-Time Control Protocol).

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1527-1540
• /
• 2017

Recently, due to the rapid development of the internet, the production and demand of high capacity contents are rapidly increasing. In order to accommodate the changing trend of internet usage, researches on CCN, the future internet architecture, are actively being conducted. Mobility support is an important challenge in CCN real-time services, given that today's internet environment is changing to mobile and real-time services are increasing. In CCN real-time services, the mobility problem can be largely divided into consumer mobility, provider mobility, and intermediate-node mobility. Among them, when the intermediate-node moves in the CCN real-time services, the service disconnection occurs and the QoS degradation is caused. In this paper. we propose Intermediate-Node Mobility Support(INMS) to support the intermediate-node mobility in CCN real-time services. Experimental results show that the proposed scheme shows better performance than CCN in terms of service disconnection time and packet loss.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.39-48
• /
• 2004

For transporting real-time multimedia traffic, RTP is considered as one of the most promising protocols operating at application layer. In order to manage and control the real-time multimedia traffic within networks, network managers need to monitor and analyze the traffic delivering through their networks. However, conventional traffic analyzing tools can not exactly classify and analyze the real-time multimedia traffic using RTP on the basis of real-time as well as non-real-time operations. In this paper, we propose an efficient online classification method of RTP packets, which can be used on high-speed network links. The accuracy and efficiency of the proposed methodhave been tested using captured data from a KIX node with 100 Mbps links, which interconnects between domestic and overseas Internet networks and is operated by NCA.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.125-128
• /
• 2001

Nowadays, Internet users are widespread internationally. Fallowing the users requirements, server has to transfer real-time multimedia data to many clients. Multicast can significantly reduce the system overhead and the network resource waste, so it supports efficient mechanism when server has to transfer same data to many clients. We can deliver multimedia data transfer in real-time using Patching Algorithm which has no delay for service request. And multicast algorithm can support different network bandwidth using Receiver driven Layered Multicast under heterogeneous environment network. The purpose of this paper is to suggest an algorithm that can create new multicast group adequately and transfer real-time multimedia data efficiently under heterogeneous environment.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2727-2729
• /
• 2002

In an emergency telemedicine system such as High-quality Multimedia based Real-time Emergency Telemedicine(HMRET) service, it is very important to examine the status of the patient continuously using the multimedia data including the biological signals(ECG, BP, Respiration, $SpO_2$) of the patient. In order to transmit these data real time through the communication means which have the limited transmission capacity. It is also necessary to compress the biological data besides other multimedia data. For the HMRET service, we developed the lossless biological signal compression program in MSVC++ 6.0 using DPCM method and JPEG Huffman table, and tested in an internet environment.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.293-299
• /
• 2023

In recent years, with the rapid development of real-time rendering technology, the quality of the images produced by real-time rendering has been improving, and its application scope has been expanded from games to animation and advertising and other fields. This paper analyses the development status of real-time rendering technology in 3D animation by investigating the 3D animation market in China, which concludes that the number of 3D animations in China has been increasing over the past 20 years, and the number of 3D animations using real-time rendering has been increasing year by year and exceeds that of 3D animations using offline rendering. In this study, a real-time rendering and offline rendering 3D animation are selected respectively to observe the screen effect of characters, special effects and environment props, and analyse the advantages and disadvantages of the two rendering technologies, and finally conclude that there is not much difference between real-time rendering 3D animation and offline rendering 3D animation in terms of quality and the overall sense of view, and due to the real-time rendering of the characteristics of the WYSIWYG, the animation designers can better focus on the creation of art performance. Real-time rendering technology has a good development prospect and potential in 3D animation, which paves the way for designers to create 3D content more efficiently.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1273-1281
• /
• 2004

There have been a number of researches on real-time packet scheduling based on EDF algorithm to support end-to-end delay bound guarantees for real-time traffic transmission. However, EDF-based packet scheduler could not guarantee the real-time requirements of real-time traffic if there exist non-real-time traffic. In this paper, we propose a new admission control algorithm and packet scheduling scheme considering non-real-time traffic in the real -time packet scheduler based on EDF policy. Proposed admission control algorithm has pseudo-polynomial time complexity, but we show through simulation that it can be used with little run-time overhead.