• Title/Summary/Keyword: bandwidth control

Search Result 1,341, Processing Time 0.044 seconds

The effects of target and missile dynamics on the optimal coriolis acceleration compensation (미사일 및 표적 운동을 고려한 시선지령유도에서의 코리올리 가속도 보상)

  • 류동영;탁민제;엄태윤;송택렬
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.596-600
    • /
    • 1992
  • In CLOS guidance, feedback compensation of the Coriolis acceleration is used to reduce miss distance. This paper presents the effects of the bandwidth of target and missile on the optimal Coriolis acceleration compensation. A state space formulation of CLOS guidance is used to implement CLOS guidance in feedback form. And the LQR control method is applied to find the optimal feedback gain. From the analysis of the Riccati equations of the optimal control, the following facts are observed: When the target is agile, the optimal gain is reduced, since the compensation becomes ineffective. The missile bandwidth also affects the Coriolis accleration compensation. Narrower missile requires more compensation for the Coriolis acceleration.

  • PDF

IMPLEMENTATION EXPERIMENT OF VTP BASED ADAPTIVE VIDEO BIT-RATE CONTROL OVER WIRELESS AD-HOC NETWORK

  • Ujikawa, Hirotaka;Katto, Jiro
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.668-672
    • /
    • 2009
  • In wireless ad-hoc network, knowing the available bandwidth of the time varying channel is imperative for live video streaming applications. This is because the available bandwidth is varying all the time and strictly limited against the large data size of video streaming. Additionally, adapting the encoding rate to the suitable bit-rate for the network, where an overlarge encoding rate induces congestion loss and playback delay, decreases the loss and delay. While some effective rate controlling methods have been proposed and simulated well like VTP (Video Transport Protocol) [1], implementing to cooperate with the encoder and tuning the parameters are still challenging works. In this paper, we show our result of the implementation experiment of VTP based encoding rate controlling method and then introduce some techniques of our parameter tuning for a video streaming application over wireless environment.

  • PDF

Efficient rate control algorithm for video near-lossless compression (비디오 준무손실 압축을 위한 효율적인 레이트 컨트롤 알고리즘)

  • Joh, Beom Seok;Kim, Young Ro
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.2
    • /
    • pp.11-17
    • /
    • 2010
  • In this paper, we propose efficient rate control algorithm for video near-lossless compression. The proposed method adjusts pixel error range using amounts of previous encoded bits and target bits at a slice encoding interval. Thus, encoded bits by the proposed method are transmitted well through limited bandwidth without overflow. Also, target bits and encoded bits can be controlled according to transmission policy. Experimental results show that our proposed method not only almost fits compression ratio, but also has better image quality.

Smart Bus Arbiter for QoS control in H.264 decoders

  • Lee, Chan-Ho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.11 no.1
    • /
    • pp.33-39
    • /
    • 2011
  • H.264 decoders usually have pipeline architecture by a macroblock or a 4 ${\times}$ 4 sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and higher data bandwidth. Adaptive pipeline architecture for H.264 decoders has been proposed for efficient decoding and lower the requirement of the bandwidth for the memory bus. However, it requires a controller for the adaptive priority control to utilize the advantage. We propose a smart bus arbiter that replaces the controller. It is introduced to adjust the priority adaptively the QoS (Quality of Service) control of the decoding process. The smart arbiter can be integrated the arbiter of bus systems and it works when certain conditions are met so that it does not affect the original functions of the arbiter. An H.264 decoder using the proposed architecture is designed and implemented to verify the operation using an FPGA.

Improving TCP Performance with Bandwidth Estimation and Selective Negative Acknowledgment in Wireless Networks

  • Cheng, Rung-Shiang;Lin, Hui-Tang
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.236-246
    • /
    • 2007
  • This paper investigates the performance of the transmission control protocol (TCP) transport protocol over IEEE 802.11 infrastructure based wireless networks. A wireless link is generally characterized by high transmission errors, random interference and a varying latency. The erratic packet losses usually lead to a curbing of the flow of segments on the TCP connection and thus limit TCP's performance. This paper examines the impact of the lossy nature of IEEE 802.11 wireless networks on the TCP performance and proposes a scheme to improve the performance of TCP over wireless links. A negative acknowledgment scheme, selective negative acknowledgment (SNACK), is applied on TCP over wireless networks and a series of ns-2 simulations are performed to compare its performance against that of other TCP schemes. The simulation results confirm that SNACK and its proposed enhancement SNACK-S, which incorporates a bandwidth estimation model at the sender, outperform conventional TCP implementations in 802.11 wireless networks.

Improving TCP Performance by Limiting Congestion Window in Fixed Bandwidth Networks (고정대역 네트워크에서 혼잡윈도우 제한에 의한 TCP 성능개선)

  • Park, Tae-Joon;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.149-158
    • /
    • 2005
  • This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

A Real-time Adaptive Scheduling Protocol for MPEG-4 Video Stream Transmission in Mobile Environment (모바일 환경에서 MPEG-4 비디오 스트림 전송을 위한 실시간 적응형 스케쥴링 프로토콜)

  • Kim, Jin-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.3
    • /
    • pp.349-358
    • /
    • 2010
  • Adaptability is an important issue in video streaming over mobile environments, since the clients may request videos with great differences in their workload. In this paper, we propose the issues in limited bandwidth scheduling for efficient MPEG-4 video stream transmission over a mobile or wireless network. In the phase of admission control, the amount of bandwidth allocated to serve a video request is the mean bandwidth requirement of its requested video. The dynamic allocation of bandwidth in the phase of scheduling depends on the playback buffer levels of the clients with an objective to make it more adaptive to the playback situation of individual clients. In the proposed RTA scheduling protocol, more bandwidth may be allocated temporarily to the client whose buffer level is low. By employing the buffer level based scheduling policy, this protocol attempts to maximize the real-time performance of individual playback while minimizing the impact of transient overloading. Extensive simulation experiments have been performed to investigate the performance characteristics of the RTA protocol as comparing with BSBA protocol. This RTA protocol shows the better performance by transferring more frames than BSBA protocol.Computer simulations reveals that the standard deviation of the bit rate error of the proposed scheme is 50% less than that of the conventional method.

Performance Analysis of Call Admission Control Mechanism for Intelligent Information Processing of Non-Uniform Traffic Distribution in CDMA Environment (CDMA 환경에서 비균일 트래픽 특성의 지능정보 처리를 위한 호 수락제어 기법의 성능분석)

  • Lee, Dong-Myung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1387-1394
    • /
    • 2005
  • In this paper, we propose and the call admission control mechanism that can improve the capacity of the wireless system for the non-uniform traffic load distribution based intelligent information in multiple cellular CDMA environment. The number of mobile stations that can be served simultaneously in a base station is limited by the amount of total interference received in CDMA system. Further, the average number of mobile stations in each cell may not be uniformly distributed. In this paper, considering this factors, the call admission control mechanism using the effective bandwidth concept is adapted to improve the system capacity of non-uniform traffic load distribution based intelligent information. Thus, the bandwidth for a new call can be varied dynamically for reducing the blocking rate of new calls and the dropping rate of handoff calls. The suggested call admission control mechanism is experimented through simulation by dynamically assigning the bandwidth to new and handoff calls. The simulation results show that the proposed call admission control mechanism can accommodate more mobile stations than the other methods in multiple cellular CDMA environment.

TFRC Flow Control Mechanism based on RTP/RTCP for Real-time Traffic Transmission (실시간 트래픽 전송을 위한 RTP/RTCP의 TFRC 흐름제어 기법)

  • Choi, Hyun-Ah;Song, Bok-Sob;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.8
    • /
    • pp.57-64
    • /
    • 2008
  • In this paper, to resolve the problem caused by a network state information inaccuracy the slow delay time that conclusion of network state of one way delay time which accuracy delay time information, according to network state changes on the based TFRC flow control, and suggest that flow control mechanism to adjust transfer rate fit of real time multimedia data. In simulation, to measure of netowork state information that on the average about 12% difference of compared RTT and $OWD{\times}2$. When used RTT, used fair bandwidth TFRC much better than TCP about 32%, when used OWD, difference about 3% used fair bandwidth. Thus, conclusion of accuracy network state that used fair bandwidth according to network state changes on the based TFRC, users can support service of high quality that flow control mechanism to adjust transfer rate fit of real time data.

The Call Control Scheme for Multiple Cells CDMA System Under Non-Uniform Traffic Distribution (비균일 부하를 가진 다중 셀 CDMA시스템에서의 호 제어 기법)

  • 이동명
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.737-743
    • /
    • 2004
  • In this paper, we propose the call control scheme that can improve the capacity of the wireless system for the non-uniform traffic load distribution and the multiple types of services in multiple cells CDMA system. The number of mobile stations that can be served simultaneously in a base station is limited by the amount of total interference received in CDMA system. Further, the average number of mobile stations in each cell may not be uniformly distributed. Considering this factors, the call admission control scheme using the effective bandwidth concept is adapted in this paper. Thus, the bandwidth for a new call can be varied dynamically for reducing the blocking rate of new calls and the dropping rate of handoff calls. The suggested call control scheme is experimented through a simulation by dynamically assigning the bandwidth to new and handoff calls. The simulation results show that the proposed call control scheme can accommodate more mobile stations than the other methods in multiple cells environment.

  • PDF