• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1323-1326
• /
• 2014

In this letter, we compare the performance of two concatenated coding structures in slow FH/SS systems for multimedia/multicast transmission on shipboard. Two outer code symbols are transmitted during a hop. The first structure consists of one inner codeword per one outer code symbol, while the second structure consists of one inner codeword per two outer code symbols. We analyze the overall block error probability in asymptotic region and show that the performance of the second scheme is superior to the first one.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1085-1092
• /
• 2003

The rapid growth of high speed multimedia services demands the large capacity of the server's storage that maintains the multimedia contents. Among the server's devices, the low I/O speed and physical or logical failure of storage device decrease the total performance of system. The continuous increase of multimedia contents require the flexibility of storage capacity. In order to solve the these problems, we propose the uses of software RAID and LVM techniques that provide the performance improvement and reliability of storage device and the flexibility of storage device respectively. In the LINUX 2.4 kernel, we implemented the reliable and flexible storage device and evaluated the performance of it.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.385-391
• /
• 2005

As the Internet real-time multimedia applications increases, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example satisfying this necessity. The TCP-Friendly Rate Control (TFRC) is an UDP-based protocol that controls the transmission rate that is based on the available round trip time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used in the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.181-187
• /
• 2003

In high speed packet switching network, packet service by priority scheme prefer to QoS. Efficient packet service according to the priority scheme in high speed packet switch is a key point. Therefore development of priority service algorithm in the packet switch is very important. In this paper, we proposed W-iSLIP algorithm that service time take queue length into consideration and compared the proposed W-iSLIP algorithm to other previous proposed algorithm through simulation. Simulation results show 2.6% performance elevation in average delay, and 34.6% performance elevation in priority service.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.977-987
• /
• 2014

Many of the recent performance evaluation of clustering schemes in wireless sensor networks considered one sink node operation and fixed sink node location without mentioning about any network application requirements. However, application environments have variable requirements about their networks. In addition, network performance is sufficiently influenced by different sink node location scenarios in multi-hop based network. We also know that sink location can influence to the sensor network performance evaluation because of changed multipath of sensor nodes and changed overload spots in multipath based wireless sensor network environment. Thus, the performance evaluation results are hard to trust because sensor network is easily changed their network connection through their routing algorithms. Therefore, we suggest that these schemes need to evaluate with different sink node location scenarios to show fair evaluation result. Under the results of that, network performance evaluation results are acknowledged by researchers. In this paper, we measured several clustering scheme's performance variations in accordance with various types of sink node location scenarios. As a result, in the case of the clustering scheme that did not consider various types of sink location scenarios, fair evaluation cannot be expected.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1389-1399
• /
• 2004

Modern computer networks are growing wider, more complicated. Therefore, we have needed so much the function of the performance management to, by making this kind of the network performance best fitted, guarantee Quality of Service which the users require. Currently, Netflow, RMON and Packet Capture methods are used to analyze Traffic, the principal function of the performance management, but they are not the fundamental solution from the integrated point of view. In this paper, we suggest the integrated performance management architecture and, by means of it, design and implement the performance man-agement system so that we can manage the performance of multi-technology and multi-vender devices.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.31-36
• /
• 2015

Recent years have seen a significant increase in demand for multimedia data over wireless sensor networks for monitoring applications that utilize sensor nodes to collect multimedia data, including sound and video. However, the multimedia streams generate a very large amount of data. When data transmission schemes for traditional wireless sensor networks are applied in wireless multimedia sensor networks, the network lifetime significantly decreases due to the excessive energy consumption of specific nodes. In this paper, we propose a data compression scheme that implements the Chinese remainder theorem to a wireless multimedia sensor network. The proposed scheme uses the Chinese Remainder Theorem (CRT) to compress and split multimedia data, and it then transmits the bit-pattern packets of the remainder to the base station. As a result, the amount of multimedia data that is transmitted is reduced. The superiority of our proposed scheme is demonstrated by comparing its performance to that of an existing scheme. The results of our experiment indicate that our proposed scheme significantly increased the compression ratio and reduced the compression operation in comparison to those of existing compression schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2011

Recently, as mobile multimedia devices are used more and more, the needs for high-performance and low-energy multimedia processors are increasing. Application-specific integrated circuits (ASIC) can meet the needed high performance for mobile multimedia, but they provide limited, if any, generality needed for various application requirements. DSP based systems can used for various types of applications due to their generality, but they require higher cost and energy consumption as well as less performance than ASICs. To solve this problem, this paper proposes a single instruction multiple data (SIMD) based many-core processor which supports high-performance and low-power image data processing while keeping generality. The proposed SIMD based many-core processor composed of 16 processing elements (PEs) exploits large data parallelism inherent in image data processing. Experimental results indicate that the proposed SIMD-based many-core processor higher performance (22 times better), energy efficiency (7 times better), and area efficiency (3 times better) than conversional commercial high-performance processors.

• The Journal of the Korea Contents Association
• /
• v.5 no.4
• /
• pp.245-253
• /
• 2005

The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we proposed distributed implementation of the delay guaranteed fair queueing (DGFQ) scheme in multimedia ad hoc wireless networks. Through the the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.723-733
• /
• 2015

The OTT service that provides multimedia video has spread over the Internet for terminals with a variety of resolutions. The terminals are in communication via a networks such as 3G, LTE, VDSL, ADSL. The service of the network has been increased for a variety of terminals giving rise to the need for a new way of encoding multimedia is increasing. SVC is an encoding technique optimized for OTT services. We proposed an efficient multimedia management system for the SVC encoded multimedia data. The I/O trace was generated using a zipf distribution, and were comparatively evaluated for performance with the existing system.