• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.144-156
• /
• 2005

Video streaming over wireless networks is challenging due to node mobility and high channel error rate. In this paper, we propose a multi-source video streaming (MUVIS) system to support high quality video streaming service over IEEE 802.1l-based wireless networks. We begin by collocating a streaming proxy with the wireless access point to help leverage both the media server and peers in the WLAN. By tracking the peer mobility patterns and performing content discovery among peers, we construct a multi-source sender group and stream video using a rate-distortion optimized scheme. We formulate such a multi-source streaming scenario as a combinatorial packet scheduling problem and introduce the concept of asynchronous clocks to decouple the problem into three steps. First, we decide the membership of the multisource sender group based on the mobility pattern tracking, available video content in each peer and the bandwidth each peer allocates to the multi-source streaming service. Then, we select one sender from the sender group in each optimization instance using asynchronous clocks. Finally, we apply the point-to-point rate-distortion optimization framework between the selected sender-receiver pair. In addition, we implement two different caching strategies, simple caching simple fetching (SCSF) and distortion minimized smart caching (DMSC), in the proxy to investigate the effect of caching on the streaming performance. To design more realistic simulation models, we use the empirical results from corporate wireless networks to generate node mobility. Simulation results show that our proposed multi-source streaming scheme has better performance than the traditional server-only streaming scheme and that proxy-based caching can potentially improve video streaming performance.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.11-20
• /
• 2004

Multimedia data processing in streaming pattern contains high spatial locality and low temporal locality. This paper has proposed a dynamic data prefetching scheme that fully exploits the regularity between memory addresses referred consecutively. Compared to the existing data Prefetching scheme, the Proposed scheme can reduce data Prefetching error when an application divides an way into smaller blocks and processes them block by block. Experimental results on various media benchmark programs show the proposed scheme predicts memory addresses more accurately and results in better performance than existing prefetching schemes.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.87-94
• /
• 2003

A study on the characteristics of server workloads based on user access pattern offers insights for the strategies on continuous media caching and network workloads distribution. This paper analyses characteristics of continuous media filet in each fervor and user access requests to each of them, using log data of three commercial sites, which are providing continuous media files in the form of real time streaming on the Internet. These servers have more continuous files than ones in the previously reported studies and are processing very large number of user access requests. We analyse the characteristics of continuous media files in each server by the size of files. playback time and encoding bandwidth. We also analyse the characteristics of user access requests by the distribution of user requests to continuous media files, user access time, access rate based on the popularity of the files and the number if access requests to serial continuous media files.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.163-172
• /
• 2004

Multimedia applications tend to access their data as a streaming pattern with regular intervals. This characteristic can be utilized in prefetching the multimedia data into cache memory so as to reduce their execution speeds. The reference-prediction prefetch algorithm predicts the memory address that seems to be used in the next time based on the previous history of memory references stored in the prediction reference table. This paper proposes a strategy to manipulate the reference prediction table which contains all of the data reference instructions to scalar and streaming data. We have recognized that the scalar reference instructions do not contribute to the data prefetching algorithm. Therefore, when replacing an element in the reference prediction table, the proposed algorithm preferentially selects the scalar reference instruction before the stream reference instruction. It makes the stream reference instruction to stay for a long time compared to the FIFO replacement policy, and eventually improves the performance of data prefetching.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1258-1268
• /
• 2005

While the concept of Home Network is laying by and its interests are increasing by means of digitalizing of the information communication infrastructure, many efforts are in progress toward convenient lives. Moreover, as information household appliances which have a junction of connecting to the network are appearing over the past a few years, the demands against intellectual Home Services are increasing. In this paper, by being based upon Multimedia which is an essential factor for developing of various application services on ubiquitous computing environments, we suggest a simplified application model that could apply the information to the automated processing system after studying user's behavior patterns using authentication and access control for identity certification of users. In addition, we compared captured video images in the fixed range by pixel unit through some time and checked disorder of them. And that made safe of user certification as adopting self-developed certification method which was used 'Hash' algorism through salt function of 12 byte. In order to show the usefulness of this proposed model, we did some testing by emulator for control of information after construction for Intellectual Multimedia Server, which ubiquitous network is available on as a scheme so as to check out developed applications. According to experimental results, it is very reasonable to believe that we could extend various multimedia applications in our daily lives.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.11
• /
• pp.658-672
• /
• 2004

Multimedia applications are required to process the huge amount of data at high speed in real time. The memory reference instructions such as loads and stores are the main factor which limits the high speed execution of processor. To enhance the memory reference speed, cache prefetch schemes are used so as to reduce the cache miss ratio and the total execution time by previously fetching data into cache that is expected to be referenced in the future. In this study, we present an advanced data cache prefetching scheme that improves the conventional RPT (reference prediction table) based scheme. We considers the cache line size in calculation of the address stride referenced by the same instruction, and enhances the prefetching algorithm so that the effect of prefetching could be maintained even if an irregular address stride is inserted into the series of uniform strides. According to experiment results on multimedia benchmark programs, the cache miss ratio has been improved 29% in average compared to the conventional RPT scheme while the bus usage has increased relatively small amount (0.03%).

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.372-375
• /
• 2008

IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.