• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.704-715
• /
• 2016

In this paper, we explore a low-complex bandwidth allocation (BA) scheme with multi-level service guarantees in VLC-OFDM systems. Effective capacity theory, which evaluates wireless channel capacity from a novel view, is utilized to model the system capacity under delay QoS constraints of the link layer. Since intensity modulation of light is used in the system, problems caused by frequency selectivity can be neglected. Then, the BA problem can be formulated as an integer programming problem and it is further relaxed and transformed into a concave one. Lagrangian formulation is used to reformulate the concave problem. Considering the inefficiency of traditional gradient-based schemes and the demand for distributed implementation in local area networks, we localize the global parameters and propose a quasi-distributed quadratic allocation algorithm to provide two-level service guarantees, the first level is QoS oriented, and the second level is QoE oriented. Simulations have shown the efficient performance of the proposed algorithm. The users with more stringent QoS requirements require more subcarriers to guarantee their statistical delay QoS requirements. We also analyze the effect of subcarrier granularity on the aggregate effective capacity via simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.656-665
• /
• 2000

A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.

• IE interfaces
• /
• v.9 no.3
• /
• pp.202-213
• /
• 1996

Video-on-demand is an interactive service that provides programs (movie, home shopping, etc.) to users connected to a network. This service will require high bandwidth network and video servers with a large amount of storage capacity. From the viewpoint of system analysis, there are optimization problems to be solved. In this paper, we present a dynamic programming method for allocating the storage for programs being served in a multi-level video-on-demand network. In the optimization of the network resource, we consider the three kinds of costs: installation cost for video servers, program storage cost, and transmission (or communication) cost. The factors related to the costs are investigated. An example is shown to illustrate the proposed method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.247-249
• /
• 2001

최근 VOD(Video On Demand)나 AOD(Audio On demand) 서비스가 급증하면서 멀티미디어 스트리밍 기술에 대한 관심이 커지고 있다. 기존의 스트리밍 서비스는 정적으로 멀티미디어를 전송하므로 네트워크 환경의 대역폭(bandwidth) 변화에 대처하는데 한계가 있다. 이러한 문제점을 해결하기 위하여 본 논문에서는 실시간 스트리밍 서비스(RTSS; Real Time Streaming Service) 시스템을 제안한다. RTSS 시스템은 동화상의 끊김없는 전송보장을 위해 미디어 스케일링 방식을 사용하고, 대역폭 변화에 능동적으로 대처할 수 있도록 동적인 멀티미디어 전송을 이용한다. 기존의 스트리밍 서비스의 버퍼링 방식의 단점을 해결하기 위하여 본 논문에서는 프레임 조정방식과 화질 조정방식을 동시에 채택하여 적용함으로써 고화질이 보장되는 전송환경과 느린 회선에서도 끊김없이 안정적인 스트리밍 서비스를 제공받을수 있도록 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.484-486
• /
• 2002

주문형 비디오 서비스(VoD: Video on Demand)의 경우 네트워크의 자원 이용도와QoS (Quality of Service)가 보장되도록 구축되어야 한다. 대역폭 스무딩 알고리즘은 주문형 비디오 시스템에서 비디오 데이터를 보낼 경우 비디오의 데이터의 급격한 대역폭의 증가 또는 감소를 최소한 줄이는 기법이다. 본 논문에서는 기존의 대역폭 스무딩 기법과 비디오 압축 기법의 특성을 이용하여 새로운 모델과 스무딩 알고리즘을 제안한다. 제안된 알고리즘의 성능평가를 위해 기존 스무딩 알고리즘의 결과와 비교 분석한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.943-950
• /
• 2005

Recently, many of researches on stream transmission for satisfying each of different real-time transmission condition of the multimedia data that demands various service quality through high-speed networks have been studied actively. In this paper, we design a scheme that discriminately reserves the network resources for the transmission of each multimedia application and propose a bandwidth allocation scheme for improving the utilization ratio of free resources. And we also propose a pipelining scheme for providing flexible real-time transmission. The proposed schemes can be used to support a real-time transmission by applying feedback transmission control method based on receiving buffer for guaranteeing the synchronization conditions requested by the multimedia data. Moreover, we propose a transmission control scheme that can take the amount of network resources down to the minimum amount within the range of permissible error-range under the guarantee with no quality degradation simultaneously when the bottleneck is caused by the network congestion. Finally, we propose a dynamic bandwidth smoothing scheme that can smooth the maximum bandwidth to the demand of each video steam for giving continuous transmission to the delay sensitive video steam between senders and receivers.

• Smart Structures and Systems
• /
• v.33 no.1
• /
• pp.27-39
• /
• 2024

The effectiveness of conventional tuned liquid dampers (TLDs) in controlling the wind-induced response of tall flexible structures has been indicated. However, the impaired control effect in the detuning condition or a considerably high mass cost of liquid may be incurred in ensuring the high-level serviceability. To provide an efficient TLD-based solution for wind-induced vibration control, this study proposes a serviceability-oriented optimal design method for isolated TLDs (ILDs) and derives analytical design formulae. The ILD is implemented by mounting the TLD on the linear isolators. Stochastic response analysis is performed for the ILD-equipped structure subjected to stochastic wind and white noise, and the results are considered to derive the closed-form responses. Correspondingly, an extensive parametric analysis is conducted to clarify a serviceability-oriented optimal design framework by incorporating the comfort demand. The obtained results show that the high-level serviceability demand can be satisfied by the ILD based on the proposed optimal design framework. Analytical design formulae can be preliminarily adopted to ensure the target serviceability demand while enhancing the structural displacement performance to increase the safety level. Compared with conventional TLD systems, the ILD exhibits higher effectiveness and a larger frequency bandwidth for wind-induced vibration control at a small mass ratio.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.871-879
• /
• 2011

Because a wide variety of multimedia services are provided through personal wireless communication devices, the demand for efficient bandwidth utilization becomes stronger. This demand naturally results in the introduction of the variable bitrate speech coding concept. One exemplary work is the selectable mode vocoder (SMV) that supports speech/music classification. However, because it has severe limitations in its classification performance, a couple of works to improve speech/music classification by introducing support vector machines (SVMs) have been proposed. While these approaches significantly improved classification accuracy, they did not consider correlations commonly found in speech and music frames. In this paper, we propose a novel and orthogonal approach to improve the speech/music classification of SMV codec by adaptively tuning SVMs based on interframe correlations. According to the experimental results, the proposed algorithm yields improved results in classifying speech and music within the SMV framework.

• ETRI Journal
• /
• v.35 no.4
• /
• pp.687-696
• /
• 2013

The development of proxy caching is essential in the area of video-on-demand (VoD) to meet users' expectations. VoD requires high bandwidth and creates high traffic due to the nature of media. Many researchers have developed proxy caching models to reduce bandwidth consumption and traffic. Proxy caching keeps part of a media object to meet the viewing expectations of users without delay and provides interactive playback. If the caching is done continuously, the entire cache space will be exhausted at one stage. Hence, the proxy server must apply cache replacement policies to replace existing objects and allocate the cache space for the incoming objects. Researchers have developed many cache replacement policies by considering several parameters, such as recency, access frequency, cost of retrieval, and size of the object. In this paper, the Weighted-Rank Cache replacement Policy (WRCP) is proposed. This policy uses such parameters as access frequency, aging, and mean access gap ratio and such functions as size and cost of retrieval. The WRCP applies our previously developed proxy caching model, Hot-Point Proxy, at four levels of replacement, depending on the cache requirement. Simulation results show that the WRCP outperforms our earlier model, the Dual Cache Replacement Policy.