• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.128-133
• /
• 2005

Respond time and processing rate representing how many tasks can be done during an unit time in a client/server environment are generally use for measuring the performance of computers. In this paper, we suggest a window buffer managing scheme based on a window with many of short-term sliced slots where a media stream is allocated and deallocated into them so that it can maximize the utilization ration of the limited buffer on a multimedia server. And we also propose a buffer substitution scheme for reducing I/O times of a multimedia server by counting re-reference time point about a used block and then it can be reused by the next consecutive media stream.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.239-245
• /
• 2007

New multimedia services over the cellular/WLAN overlay networks require different Quality of Service (QoS). In the cellular/WLAN overlay structure, the main issue of load balancing is to balance the available bandwidth among different networks. In this paper, we propose a new online network management scheme. Our proposed scheme is designed to improve bandwidth utilization by balancing the traffic load between the cellular network and WLANs. Simulation results indicate the superior performance of our proposed framework to strike the appropriate performance balance between contradictory QoS requirements under widely varying diverse traffic loads.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.258-264
• /
• 2010

In the Ad-hoc networks, the limitation on the availability of power for operation is a significant bottleneck, given the requirements of portability, weight, and size of mobile devices. Hence, the use of routing metrics that consider the capabilities of the power sources of the network nodes contributes to the efficient utilization of energy. This paper presents a QoS routing protocol that minimize the power consumed by a packet in traversing from source node to the destination node. Results obtained of simulation show that, with our approach we can reduce the power consumption of nodes and increases the life time of the network.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.641-650
• /
• 2008

As portable devices are used widely, power management algorithm is essential to extend battery use time on small-sized battery power. Although many methods have been proposed, they assumed the voltage transition overhead was negligible or was considered partially. However, the voltage transition overhead might not guarantee to schedule real-time tasks in portable multimedia systems. This paper proposes the adaptive power-aware algorithm to minimize the power consumption by considering the voltage transition overhead. It selects only a few discrete frequencies from the whole frequencies of a system and adjusts the interval between two consecutive frequencies based on the system utilization to reduce the number of frequency change. This algorithm saves the power consumption about 10 to 25 percent compared to a CC RT-DVS method and a frequency-smoothing method.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.1027-1038
• /
• 2002

Multimedia data services have been widely developed with the recent progression of the Internet technology. Multimedia services, especially, must guarantee Quality of Service with restricted environment resources. The abrupt increase of transmission quanta, so called burst, and the number of client that access multimedia server, with limited network bandwidth will demage the quality of service and the utilization of network resource. Smoothing techniques can reduce the burst of a variable bit rate stream by transmitting data at a series of fixed rates. In this paper, we present a new smoothing algorithm using MPEG's characteristics in transmitting stored video data with VBR. The smoothing algorithm we present will be verified with assorted existing techniques in diverse environments.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3138-3150
• /
• 2021

Multimedia services on the Internet are continuously increasing. Accordingly, the demand for a technology for efficiently delivering multimedia traffic is also constantly increasing. The multicast technique, that delivers the same content to several destinations, is constantly being developed. This technique delivers a content from a source to all destinations through the multicast tree. The multicast tree with low cost increases the utilization of network resources. However, the finding of the optimal multicast tree that has the minimum link costs is very difficult and its calculation complexity is the same as the complexity of the Steiner tree calculation which is NP-complete. Therefore, we need an effective way to obtain a multicast tree with low cost and less calculation time on SDN-based smart network platforms. In this paper, we propose a new multicast tree generation algorithm which produces a multicast tree using an agent trained by model-based meta reinforcement learning. Experiments verified that the proposed algorithm generated multicast trees in less time compared with existing approximation algorithms. It produced multicast trees with low cost in a dynamic network environment compared with the previous DQN-based algorithm.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.82-87
• /
• 2023

<Deep Sea> is an 3D animated film that stands out for its exceptional special effects and distinctive artistic style. The film employs a multitude of dazzling and vibrant ink particles, creating a strong sense of three-dimensionality and weightlessness, while simultaneously portraying a dreamlike and elegant representation of a deep sea ink painting. Furthermore, through the utilization of fragmented stream of consciousness narrative technique, the film establishes a unique artistic effect infused with a Chinese atmosphere. This paper by analyzing the unique particle ink art style and color and stream of consciousness narrative methods in film, this paper discusses the innovative art style generated by traditional ink art style combined with three-dimensional technology, and the integration of traditional ink art ideas and artistic conception in animated films. The objective is to cultivate a new ink art style and prove the importance of traditional cultural expression in animated films, while providing new perspectives for the future application of traditional art in animation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3121-3144
• /
• 2023

As interest in the metaverse has grown, there has been a demand for avatars that can represent individual users. Consequently, research has been conducted to reduce the time and cost required for the current 3D human modeling process. However, the recent automatic generation of 3D humans has been focused on creating avatars with a realistic human form. Furthermore, the existing methods have limitations in generating avatars with imbalanced or unrealistic body shapes, and their utilization is limited due to the absence of datasets. Therefore, this paper proposes a new framework for automatically transforming and creating stylized 3D avatars. Our research presents a definitional approach and methodology for creating non-realistic character avatars, in contrast to previous studies that focused on creating realistic humans. We define a new shape representation parameter and use a deep learning-based method to extract character body information and perform automatic template mesh transformation, thereby obtaining non-realistic or unbalanced human meshes. We present the resulting outputs visually, conducting user evaluations to demonstrate the effectiveness of our proposed method. Our approach provides an automatic mesh transformation method tailored to the growing demand for avatars of various body types and extends the existing method to the 3D cartoon stylized avatar domain.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.27-33
• /
• 2012

The Ethernet Passive Optical Network (EPON) has been considered to be one of the most promising solutions for the implementation of the Fiber To The Home (FTTH) technology designed to ameliorate the "last mile" bandwidth bottleneck. In the EPON network, an efficient and fair bandwidth allocation is a very important issue, since multiple optical network units (ONUs) share a common upstream channel for packet transmission. To increase bandwidth utilization, an EPON system must provide a way to adaptively allocate the upstream bandwidth among multiple ONUs in accordance to their bandwidth demands and requirements. We present a new hybrid method that satisfies these requirements. The advantage of our method comes from the consideration of application-specific bandwidth allocation and the minimization of the idle bandwidth. Our simulation results show that our proposed method outperforms existing dynamic bandwidth allocation methods in terms of bandwidth utilization.