• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.133-136
• /
• 2001

In this work, the problem of regulating and tracking available bit rate (ABR) traffic in ATM network. The issue of providing control signals to throttled sources at distant location from bottlenecked node is of particular interest. Network modeling and design of controller is outlined. To obtain optimal control, receding horizon control (RHC) theory is applied. Simulation results are presented in views of regulation and tracking problems with or without constraints.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.166-172
• /
• 2020

Video streaming application such as YouTube is one of the most popular mobile applications. To adjust the quality of video for available network bandwidth, a streaming server provides multiple representations of video of which bit rate has different bandwidth requirements. A streaming client utilizes an adaptive bit rate scheme to select a proper video representation that the network can support. The download behavior of video streaming client player is governed by several parameters such as maximum buffer size. Especially, the size of the maximum playback buffer in the client player can greatly affect the user experience. To tackle this problem, in this paper, we propose the maximum buffer size optimization according to available network bandwidth and buffer status. Our simulation study shows that our proposed buffer size optimization scheme successfully mitigates playback stalls while preserving the similar quality of streaming video compared to existing ABR schemes.

• Annual Conference of KIPS
• /
• 2002.04b
• /
• pp.1393-1396
• /
• 2002

무선 ATM(Asynchronous Transfer Mode) 망을 기본으로 하여 ATM망에서 사용하는 서비스 종류인 CBR(Constant Bit Rate), rtVBR(Real-Time Variable Bit Rate), nrtVBR(Non-Real-Time Variable Bit Rate), ABR(Available Bit Rate), UBR(Unspecified Bit Rate)에 따른 플로우를 우선 각 서비스 흐름에 따라서 공평하게 패킷 스케줄링 한다. 그리고 각 서비스 종류에 따라 대역이나 지연에 따라 모든 사용자의 다양한 서비스 트래픽에 공평하게 서비스하는 구조를 갖는다. 아울러 무선 통신망 채널에 에러가 발생할 경우를 고려하여 각 서비스 트래픽에 대한 QoS(Quality of Service)를 보장해주는 무선 ATM 통신망에서 동작하는 스케줄링 알고리즘을 제안하여 시뮬레이션과을 통해 기존의 방법과 성능을 비교하여 기존의 유선 통신망 스케줄링 알고리즘과 달리 무선망의 에러에 대한 각 트래픽의 에러에 대한 성능 향상에 대해 알아본다.

• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.3
• /
• pp.71-86
• /
• 1996

In this paper we propose an explicit rate allocation algorithm for ATM(Asynchronous Transfer Mode) Networks using the available bit rate(ABR) class of service and study the performance of this algorithm. We examine the behavior of ABR traffic with the suggested algorithm, and demonstrate that the algorithm is fair and maintains network efficiency with low cell loss rate. The simulation results show substantial improvements in fairness and efficiency over the existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1384-1396
• /
• 1998

This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.333-351
• /
• 2008

Transmission control protocols have to overcome common problems in wireless networks. TCP employing both packet loss discrimination mechanism and available bandwidth estimation algorithm, known as the good existing solution, shows significant performance enhancement in wireless networks. For instance, TCP New Jersey which exhibits high throughput in wireless networks intends to improve TCP performance by using available bandwidth estimation and congestion warning. Even though it achieves 17% and 85% improvements in terms of goodput over TCP Westwood and TCP Reno, respectively, we further improve it by exploring maximized available bandwidth estimation, handling bit-error-rate error recovery, and effective adjustment of sending rate for retransmission timeout. Hence, we propose TCP NJ+, showing that for up to 5% packet loss rate, it outperforms other TCP variants by 19% to 104% in terms of goodput when the network is in bi-directional background traffic.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.102-110
• /
• 2010

H.264 SVC(Scalable Video Coding) provides the advantages of low disk storage requirement and high scalability. However, a streaming server or a user terminal has to extract a bit stream from SVC file. This paper proposes a bit stream extraction method which can get the maximum PSNR value while date bit rate does not exceed the available network bandwidth. To do this, this paper obtains the information about extraction points which can get the maximum PSNR value offline and decides the spatial/temporal resolution of a bit stream at run-time. This resolution information along with available network bandwidth is used as the parameters to a bit stream extractor. Through experiment with JSVM reference software, we proved that proposed bit stream extraction method can get a higher PSNR value.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.423-424
• /
• 2007

In this paper, we propose a scalable high-quality speech reconstruction method for distributed speech recognition (DSR). It is difficult to reconstruct speech of high quality with MFCCs at the DSR server. Depending on the bit-rate available by the DSR system, we can send additional information associated with speech coding to the DSR sorrel, where the bit-rate is variable from 4.8 kbit/s to 11.4 kbit/s. The experimental results show that the speech quality reproduced by the proposed method when the bit-rate is 11.4 kbit/s is comparable with that of ITU-T G.729 under both ideal channel and frame error channel conditions while the performance of DSR is maintained to that of wireline speech recognition.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.127-130
• /
• 2000

In this paper, we design the robust H$_{\infty}$ controller for congestion control in ATM (asynchronous transfer mode) networks with the variation of other higher priority sources(e.g., constant bit rate, variable bit rate). Since ABR (available bit rate) sources share the bottleneck node with other higher priority sources, we design the controller which guarantees robustness against time delay and disturbance. The proposed robust H$_{\infty}$ controller with regional pole placements can minimize the variation of the queue size at the predefined desired level. And we also show its robustness through simulation for the ATM networks with time delay and disturbance.