• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.174-181
• /
• 2002

In this Paper, we proposed the method for the TIT (Theoretical Inter-arrival Time) was suggested in which it saves the cells by using the data buffer in the system rather than by using one separately from the internal controller, and it also releases these cells saved. The method of TIT complements the defect of the accumulation of the delay in the method of RDT which considers the time of the cell that is discharged from the established cell interval controller. And, in order to apply the merit of RDT, the method of TIT sets its standards on the cells arrival time as it was in the method of RAT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1653-1660
• /
• 2003

In this paper, we proposed an enhanced TCP congestion control algorithm using RTT with congestion window parameter cwnd to minimize the effect of TCP congestion. The proposed scheme could avoid the occurrence of frequent congestion and decrease the delay caused by the recovery time and the using amount of switch buffer. Through the simulation, we showed that the proposed scheme cm acquire higher performance than the existing scheme. There are 22.56％ improvement at the average using buffer efficiency, and packet drop rate is 0.1％ which is less than existing scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.483-486
• /
• 2001

회선 서비스, 패킷 서비스, 영상 서비스 등과 같은 다양한 서비스를 지원하기 위해서는 무선 자원의 효율적 운용을 위한 동적 무선 자원 제어가 필요하다. 현재 UMTS에서 제안하고 있는 동적 무선 자원 할당 메커니즘은 단지 RLC 버퍼의 양에 의해 제어된다. 하지만 이는 유입되는 트래픽 양의 변화가 큰 VBR 트래픽에 대하여서는 정확한 제어를 보장할 수 없다. 따라서 본 논문에서는 현재 인터넷에서 사용되고 있는 토큰 버켓 모델을 이용하여 RLC 버퍼의 양 뿐만 아니라 예상되는 유입 트래픽 양을 측정, 보고하는 메커니즘을 제안한다. 이 메커니즘은 효율적인 무선 채널의 할당을 통해 자원의 효율성을 높일 수 있다.

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.381-388
• /
• 2015

TCP, which performs congestion control in congestion condition, is able to help a reliable transmission. However, packet loss can be increased because congestion window is increased by the time the packet is dropped in the process of congestion avoidance. In this paper, to solve the above problem, we propose a new congestion estimation based TCP congestion control scheme using the weighted average value of the RTT. After measuring a SRTT, which means the weighted average value of RTTs, at this point of time when a buffer overflow is occurred by an overloaded packet, the proposed scheme estimates the time, when the same SRTT is made in packet transmission, as a congestion time and then decreases the congestion window. The simulation results show that the proposed schem has a good performance in terms of packet loss rate and throughput when the packet loss due to buffer overflow is larger than that due to wireless channel.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.194-205
• /
• 1997

In video compression standards such as MPEG and H.263. rate control is one of the key components for good coding performance. This paper presents a simple adaptive rate control scheme using a piecewise linear approximation model. While conventional buffer control approach is performed by adjusting the quantization parameter linearly according to the buffer fullness. the proposed approach uses a piecewise linear approximation model derived from logarithmic relation between the quantization parameter and bitrate in data compression. In addition. a forward analyzer performed in the spatial domain is used to improve image quality. Simulation results demonstrate that the proposed method provides better performance than the conventional one and reduces the fluctuation of the PSNR per frame while maintaining the quality of the reconstructed frames at a relatively stable level.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.7
• /
• pp.36-45
• /
• 1999

In order to control the flow of traffics in ATM networks and optimize the usage of network resources, an efficient control mechanism is necessary to cope with congestion and prevent the degradation of network performance caused by congestion. In this paper, Buffered Leaky Bucket which applies the same control scheme to a variety of traffics requiring the different QoS(Quality of Service) and Neural Networks lead to the effective buffer utilization and QoS enhancement in aspects of cell loss rate and mean transfer delay. And the cell scheduling algorithms such as DWRR and DWEDF for multiplexing the incoming traffics are enhanced to get the better fair delay. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate and buffer threshold are changed by the predicted values. The prediction of traffic loss rate by neural networks can enhance efficiency in controlling the cell loss rate and cell transfer delay of next incoming cells and also be applied for other traffic controlling schemes. Computer simulation results performed for random cell generation and traffic prediction show that QoSs of the various kinds of traffcis are increased.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.305-310
• /
• 2003

The performance of various GFR implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. An efficient buffer management algorithm is necessary to guarantee MCR for untagged cell in ATM switch. In this paper, we propose and evaluate a buffer management scheme to provide the GFR service guarantees. The proposed scheme can control the cell discarding for fairness in each VC, and compared with Double-EPD and DFBA. Our results show that the proposed buffer management with per-VC queuing achieves significant enhancement on goodputs and fairness index than those of existing methods.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.34-40
• /
• 2006

Multiple wireless devices in wired and wireless heterogeneous networks communicate with counterparts via a single Access Point (AP). In this case, the AP becomes a bottleneck of the network, therefore buffer overflows occur frequently and result in TCP performance degradation. In this paper, the new algorithm that prevents buffer overflows at AP and enhances TCP fairness is proposed. Depending on the buffer usage of AP, the new algorithm adaptively controls each TCP senders' transmission rate, prevents buffer overflows and thus guarantees improved TCP fairness. It is proved that the algorithm makes better of TCP throughput and fairness by preventing buffer overflows.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.842-848
• /
• 2003

The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. In this paper, we propose a buffer management scheme which can improve the fairness and the throughput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.703-714
• /
• 2001

In C language, a local buffer overflow in stack can destroy control information stored near the buffer. In case the buffer overflow is used maliciously to overwrite the stored return address, the system is exposed to serious security vulnerabilities. This paper analyzes the process of buffer overflow hacking and methodologies to avoid the attacks in details. And it proposes a device of static buffer overflow detection by using function summary and tracking information flow of buffer domain at assembly source code level(SASS, Static Assembly Source code Scanner) and then show the feasibility and validity of it by implementing a prototype in Pentium based Linux environment.