• 제목/요약/키워드: Low delay

검색결과 1,838건 처리시간 0.029초

Implementation and Evaluation of Proxy Caching Mechanisms with Video Qualify Adjustment

  • Sasabe, Masahiro;Taniguchi, Yoshiaki;Wakamiya, Naoki;Murata, Masayuki;Miyahara, Hideo
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.121-124
    • /
    • 2002
  • The proxy mechanism widely used in WWW systems offers low-delay data delivery by means of "proxy server". By applying the proxy mechanisms to the video streaming system, we expect that high-quality and low-delay video distribution can be accomplished without introducing extra load on the system. In addition, it is effective to adapt the quality of cached video data appropriately in the proxy if user requests are diverse due to heterogeneity in terms of the available bandwidth, end-system performance, and user′s preferences on the perceived video quality. We have proposed proxy caching mechanisms to accomplish the high-quality and highly-interactive video streaming services. In our proposed system, a video stream is divided into blocks for efficient use of the cache buffer. The proxy server is assumed to be able to adjust the quality of a cached or retrieved video block to the request through video filters. In this paper, to verify the practicality of our mechanisms, we implemented them on a real system and conducted experiments. Through evaluations from several performance aspects, it was shown that our proposed mechanisms can provide users with a low-latency and high-quality video streaming service in a heterogeneous environment.

  • PDF

지연 민감형 IoT 응용을 위한 GQS 기반 포그 Pub/Sub 시스템의 설계 및 평가 (Drsign and Evaluation of a GQS-based Fog Pub/Sub System for Delay-Sensitive IoT Applications)

  • 배인한
    • 한국멀티미디어학회논문지
    • /
    • 제20권8호
    • /
    • pp.1369-1378
    • /
    • 2017
  • Pub/Sub (Publish/Subscribe) paradigm is a simple and easy to use model for interconnecting applications in a distributed environment. In general, subscribers register their interests in a topic or a pattern of events and then asynchronously receive events matching their interest, regardless of the events' publisher. In order to build a low latency lightweight pub/sub system for Internet of Things (IoT) services, we propose a GQSFPS (Group Quorum System-based Fog Pub/Sub) system that is a core component in the event-driven service oriented architecture framework for IoT services. The GQSFPS organizes multiple installed pub/sub brokers in the fog servers into a group quorum based P2P (peer-to-peer) topology for the efficient searching and the low latency accessing of events. Therefore, the events of IoT are cached on the basis of group quorum, and the delay-sensitive IoT applications of edge devices can effectively access the cached events from group quorum fog servers in low latency. The performance of the proposed GQSFPS is evaluated through an analytical model, and is compared to the GQPS (grid quorum-based pud/sub system).

A Modified Capacitor Current Feedback Active Damping Approach for Grid Connected Converters with an LCL Filter

  • Wan, Zhiqiang;Xiong, Jian;Lei, Ji;Chen, Chen;Zhang, Kai
    • Journal of Power Electronics
    • /
    • 제15권5호
    • /
    • pp.1286-1294
    • /
    • 2015
  • Capacitor current feedback active damping is extensively used in grid-connected converters with an LCL filter. However, systems tends to become unstable when the digital control delay is taken into account, especially in low switching frequencies. This paper discusses this issue by deriving a discrete model with a digital control delay and by presenting the stable region of an active damping loop from high to low switching frequencies. In order to overcome the disadvantage of capacitor current feedback active damping, this paper proposes a modified approach using grid current and converter current for feedback. This can expand the stable region and provide sufficient active damping whether in high or low switching frequencies. By applying the modified approach, the active damping loop can be simplified from fourth-order into second-order, and the design of the grid current loop can be simplified. The modified approach can work well when the grid impedance varies. Both the active damping performance and the dynamic performance of the current loop are verified by simulations and experimental results.

선박 주기관 디지털 거버너의 동적 게인 설정법에 관한 연구 (A Study on the Method of Gain Setting of Digital Governor by Dynamic Calculation for Marine Prime Movers)

  • 강인철;최순만;최재성
    • 한국마린엔지니어링학회:학술대회논문집
    • /
    • 한국마린엔지니어링학회 2002년도 춘계학술대회논문집
    • /
    • pp.251-259
    • /
    • 2002
  • The design concept of diesel engines for sea-going ships has been directed to Low-speed/Long-Stroke type to improve the efficiencies of combustion and propelling. But the time-delay property inevitable at such low speed engines gives much difficulties for governors to control the engine speed because they would be apt to go into unstable region especially when operating at low speed. The purpose of this paper is to study the problem of how the governor gain can be calculated dynamically in accordance with the variance of engine speed at least for an engine to be stable. In this study, the property of diesel engine was described as composed of combustion element including dead time and rotating element, and the ultimate gain for the speed control system to be located on the condition of stability limit was proposed based on the frequency characteristics. And the target gains with optimized stability also were proposed by giving proper margin to these ultimate conditions. The results were applied to a model system and the availability was confirmed to be satisfactory.

  • PDF

선박 주기관 디지털 거버너의 동적 이득 설정에 관한 연구 (A Study On the Gain Setting of a Digital Governor for Marine Diesel Engines by Dynamic Calculation)

  • 강인철;최순만;최재성
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제26권5호
    • /
    • pp.565-572
    • /
    • 2002
  • The design concept of diesel engines for sea-going ships has been directed to Low-speed/Long-Stroke type to improve the efficiencies of combustion and propelling. But time-delay inevitable at low speed gives much difficulties for governors to control the engine speed because they would be apt to go into unstable region especially when operating at low speed. The purpose of this paper is to study the problem of how the governor gain can be calculated dynamically in accordance with the valiance of engine speed to locate the engine still on the properly stable condition. In this study, the property of diesel engine was described as composed of combustion element including dead time and rotating element, and the ultimate gain for the speed control system to be located on the condition of stability limit was proposed based on the frequency characteristics. And the target gains with optimized stability also were proposed by giving proper margin to these ultimate conditions. The results were applied to a model system and the availability was confirmed to be satisfactory.

이득 감쇠 및 위상 지연 보상 LPF를 이용한 PMSM의 전류 제어 성능 개선 (Performance Improvement of PMSM Current Control using Gain Attenuation and Phase Delay Compensated LPF)

  • 김민주;최진철;이우택
    • 한국자동차공학회논문집
    • /
    • 제22권2호
    • /
    • pp.107-114
    • /
    • 2014
  • This paper applies a compensated low pass filter (LPF) to current measurements for permanent magnet synchronous motor (PMSM) drives. The noise limits the bandwidth of current controllers and has more adverse influences on control performances under the light load condition because of the low signal-to-noise ratio. In order to eliminate the noise sensitivity, this paper proposes a digital LPF with a compensator of gain attenuation and phase delay which are unacceptable in current information for PMSM drives. Characteristics of the proposed LPF are analyzed in comparison with the general LPFs. The compensated LPF is basically designed by the orthogonal property of the measured currents in the ${\alpha}{\beta}$ stationary reference frame. In addition, an implementation issue of the proposed method is discussed. Experimental results using the proposed method show improvements of the current control performance from two perspectives, rapid step responses and reductions of harmonic distortion.

Performance Comparison of HEVC and H.264/AVC Standards in Broadcasting Environments

  • Dissanayake, Maheshi B.;Abeyrathna, Dilanga L.B.
    • Journal of Information Processing Systems
    • /
    • 제11권3호
    • /
    • pp.483-494
    • /
    • 2015
  • High Efficiency Video Coding (HEVC) is the most recent video codec standard of the ITU-T Video Coding Experts Group and the ISO/IEC Moving Picture Experts Group. The main goal of this newly introduced standard is for catering to high-resolution video in low bandwidth environments with a higher compression ratio. This paper provides a performance comparison between HEVC and H.264/AVC video compression standards in terms of objective quality, delay, and complexity in the broadcasting environment. The experimental investigation was carried out using six test sequences in the random access configuration of the HEVC test model (HM), the HEVC reference software. This was also carried out in similar configuration settings of the Joint Scalable Video Module (JSVM), the official scalable H.264/AVC reference implementation, running on a single layer mode. According to the results obtained, the HM achieves more than double the compression ratio compared to that of JSVM and delivers the same video quality at half the bitrate. Yet, the HM encodes two times slower (at most) than JSVM. Hence, it can be concluded that the application scenarios of HM and JSVM should be judiciously selected considering the availability of system resources. For instance, HM is not suitable for low delay applications, but it can be used effectively in low bandwidth environments.

S-JND 모델을 사용한 주관적인 율 제어 알고리즘 기반의 HEVC 부호화 방법 (A Perceptual Rate Control Algorithm with S-JND Model for HEVC Encoder)

  • 김재련;안용조;임웅;심동규
    • 방송공학회논문지
    • /
    • 제21권6호
    • /
    • pp.929-943
    • /
    • 2016
  • 본 논문에서는 인지 화질을 고려하기 위해 S-JND 모델 기반의 율 제어 알고리즘을 제안한다. 제안하는 율 제어 알고리즘은 인간이 가지는 시각 시스템의 특징을 반영하기 위하여 시각적 민감도와 시각적 관심도를 동시에 반영할 수 있도록 제작된 S-JND (Saliency-Just Noticeable Difference) 모델을 사용한다. 율 제어 알고리즘을 통해 비트를 분배하는 과정에서 픽쳐 내에 존재하는 각 CTU (Coding Tree Unit)가 가지는 S-JND threshold를 구한다. 각 CTU의 threshold는 적응적으로 적절한 비트를 분배하는데 사용되고, 따라서 제안하는 비트 분배 모델은 인지 화질을 향상 시킬 수 있다. 제안하는 방법의 성능 검증을 위해서 제안하는 방법을 HM 16.9에 구현하였으며, CTC (Common Test Condition) RA (Random Access), Low-delay B와 Low-delay P의 경우에 Class B와 Class C 영상들에 대해 실험 하였다. 실험 결과, 제안하는 방법은 기존 율 제어 알고리즘 대비 평균 2.3%의 비트율이 감소했고 BD-PSNR은 약 0.07dB 향상이 있었으며 비트 정확도 또한 0.06% 정도 증가하였다. DSCQS (Double Stimulus Continuous Quality Scale) 방법으로 측정한 결과, 제안하는 방법은 기존 방법 대비 0.03 MOS (Mean Opinion Score) 향상을 보였다.

Throughput and Delay of Single-Hop and Two-Hop Aeronautical Communication Networks

  • Wang, Yufeng;Erturk, Mustafa Cenk;Liu, Jinxing;Ra, In-ho;Sankar, Ravi;Morgera, Salvatore
    • Journal of Communications and Networks
    • /
    • 제17권1호
    • /
    • pp.58-66
    • /
    • 2015
  • Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

다중 홉 무선 네트�p에서 지연을 고려한 멀티케스트 루팅 (Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks)

  • 손희석;이채영
    • 한국경영과학회지
    • /
    • 제41권2호
    • /
    • pp.53-65
    • /
    • 2016
  • Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.