• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2003

Traffic specification plays a crucial role in the resource reservation for video services over the packet-switching networks. The current development of QoS-guaranteed service still leaves a wide space for the selection of traffic specification. We propose a new method to estimate the traffic specification of variable-bit-rate (VBR) video for deterministic service. The method is based on the concept of empirical envelope and the delay bound. The solution shows to be simple yet it provides excellent network utilization.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.429-436
• /
• 2017

This study was attempted to improve the utilization of kiosk DID and to establish the production direction of the kiosk DID to be developed in the future, through analysis of kiosk DID user satisfaction at bus stop. This study showed that the satisfaction of the usability of the bus stop kiosk DID was high but in order to enhance the active use of kiosk DID and user satisfaction, unique and interesting content needs to be added and switched, not just simple information but content that users will immerse.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.269-274
• /
• 2001

This paper is study of buffering system for multimedia server. We propose the scheme that increasing the performance of multimedia sever by using the buffer sharing scheme and slot addressing algorithm to maximize fixed buffer utilization. Also, we calculate reference time about a used block and next stream reuse that stram. As a result, we propose the buffering system satisfy the users request using the extra bandwidth that reducing multimedia server I/O.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.29-35
• /
• 2015

The heterogeneous LTE (Long Term Evolution)-Advanced networks comprising a macrocell and femtocells can provide an efficient solution not only to extend macrocell coverage but also to deal with packet traffics increasing explosively within macrocells. An efficient resource management scheme is necessary to maintain the QoS (Quality of Service) of mobile multimedia services because the LTE-Advanced system should support not only voice but also mobile applications such as data, image and video. This paper proposes a resource management scheme to guarantee QoS continuity of multimedia services and to maximize the resource utilization in OFDMA (Orthogonal Frequency Division Multiple Access) based LTE-Advanced systems. This scheme divides the resources into several service blocks and allocates those resources based on the competition between macrocell and femtocell. Simulation results show that it provides better performances than the conventional one in respect of handover failure rate and blocking rate.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1058-1065
• /
• 2004

Embedded system is widely used in various applications from simple monitor to a set-top box with CPU, memory and hard disk drives. Specially, embedded OS is ported in moveable or small machinery since it ordinarily transmits multimedia data. In this paper, we propose Null copy scheme on the embedded linux system for multimedia service, which can reduce memory copy overhead from user address space to kernel one, and vice versa. Since embedded system for networked multimedia service has low level computing power as well as memory, the Null copy scheme can provide more improved QoS. Our image transmission experiment results on embedded linux target board(CPU utilization an Deadline miss rates) installed a web camera have shown that the proposed scheme can increase fast response and lower CPU overhead.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1478-1490
• /
• 2011

Recently, multi-core processors have been drawing significant interest from the embedded systems research and industry communities due mainly to their potential for achieving high performance and fault-tolerance at low cost in such products as automobiles and cell phones. To process multimedia data, a scheduling algorithm is required to meet timing constraints of periodic tasks in the system. Though Pfair scheduling algorithm can meet all the timing constraints while achieving 100% utilization on multi-core based system theoretically, however, the algorithm incurs high scheduling overheads including frequent core migrations and system-wide synchronizations. To mitigate the problems, we propose a real-time scheduling algorithm for multi-core based system so that system-wide scheduling is performed only when it is absolutely necessary. Otherwise the proposed algorithm performs scheduling within each core independently. The experimental results by extensive simulations show that the proposed algorithm dramatically reduces the scheduling overheads up to as negligible one when the utilization is under 80%.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1020-1029
• /
• 2006

Realization of high-capacity quality-of-service router needs fair packet schedulers with a lower complexity. Timestamp based fair packet schedulers have the ideal complexity of O(log V), where V is the maximum number of admitted flows, but it has been recently reduced to O(1) using bin concept. However, the latency property was deteriorated and the bandwidth utilization was also declined. In addition, traffic flows requiring strong delay bound may not be admitted. To overcome these problems, this paper proposes a Mini-Bin based Start-Time (MBST) scheduler with variable complexity and evaluates its performance. The MBST scheduler uses the timestamp calculation scheme of start-time based schedulers to enhance the bandwidth utilization and also introduces mini-bin concept to improve the latency, The performance evaluation shows that the proposed scheduler can reduce the complexity of the legacy start-tine based schedulers by $1.8{\sim}5$ times without deteriorating the bandwidth utilization property.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1487-1497
• /
• 2016

Explosively growing service of digital multimedia data increases the need for highly scalable low-cost storage. This paper proposes the new storage architecture based on torus network which does not need network switch and erasure coding for efficient storage usage for high scalability and efficient disk utilization. The proposed model has to compensate for the disadvantage of long network latency and network processing overhead of torus network. The proposed storage model was compared to two most popular distributed file system, GlusterFS and Ceph distributed file systems through a prototype implementation. The performance of prototype system shows outstanding results than erasure coding policy of two file systems and mostly even better results than replication policy of them.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.127-130
• /
• 1998

Wireless multimedia networks require channel allocation strategies for various multimedia traffic since the mobility of users needs to be considered in addition to diversity of QoS requirements of multimedia traffic. In this paper, we propose an Efficient Channel Allocation strategy, based on prioritization of handoff calls used in Guard channel method. Gurad channels can be shared between non real time calls and real time handoff calls. To decrease the probability of handoff failure, when resources become scarce, the Call Admission Control can take some resources away from the active calls. It is shown through extensive simulations that the proposed strategy provides higher channel utilization and lower probability of handoff failure than existing strategies.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.4
• /
• pp.1-10
• /
• 1994

In the real-time delivery of multimedia data streams over networks, the interruption of continuity in a single media stream and the mismatching of the data within the same time interval in multimedia data streams transfered in paralled on different channels are considered as the most serious synchronization problems. There are several mechanisms proposed to handle these problems. In this paper, these mechanisms are analyzed and compared in various point of view by the computer simulation. According to the simulation results, it has been shown that the method which uses the segmentation and the method which uses the seperate synchronization channel are superior to the method which uses the synchronization marks in view of the real-time transmission and quality of sevice. On the other hand, it can be seen that the method which uses the segmentation is superior to the method which uses the seperate synchronization channel from a channel utilization's point of view.