• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.145-148
• /
• 2000

ATM network is considered as best suitable technology for multimedia service in various aspects such as bandwidth, capability of traffic expandability and so on. In this paper, we suggested a buffer management algorithm in ATM network to improve overall network performance with threshold and auxiliary buffer whose input consists of superpositiI on of voice and multimedia data traffic. To evaluate the proposed buffer management algorithm simulations are executed with four priorities, that is delay and loss priorities and the results are proved that network throughput is improved better than the existing partial buffer method.

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

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.656-666
• /
• 2014

In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.260-264
• /
• 2003

Among many factors to affect the network performance, this paper analyses how the buffer size of NIC(Network Interface Card) can affect web server and LAN(Local Area Network). We use the ns-2 which is defacto network simulation tool to observe the changes in drop rate, throughput, RTT(Round Trip Time), effective throughput depending on varying buffer sizes. And we analyse the effect of NIC buffer size on the web traffic in Ethernet.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.810-819
• /
• 2006

This paper proposes an Adaptive Double Buffer Model. As a new FIFO buffer model, this technique minimizes packet losses from network congestion by logically managing buffers. It allocates the spare spaces of non-congested buffers to congested buffers by allowing receive/send buffers to share two queues, and hence it minimizes packet losses. In contrast to the buffer model utilizing a free list, this buffer model can prevent the bubble phenomenon caused by a memory leak and thereby apply to a network buffer in a restricted environment. Also, compared with the model using an way, this model brings maximum 100 percent improvement in accepting packets and compared with the model utilizing a free list, this model has the similar efficiency Results of the performance test on Adaptive Double Buffer Model, shows that this proposed model decreases packet losses and enhances memory efficiency.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.153-163
• /
• 2023

This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.782-792
• /
• 1997

Asynchronous transfer mode (ATM) provides the means to support with variety of multimedia serivices in broadband network. For the support of multimedia services, various data traffic with priortes should be controlled errectively and congestion function is required in the network to carry out the control operation. To accomplish this in a flexible and effective manner, priorty classes for the different services are commonly used. In this paper, we suggested a buffer managment algorithm in ATM network to improve overall network performance with separated buffer which consists of existing buffer with threshold andauxiliary buffer whose input consists of superposition of voice and data traffic. To evaluate the proposed buffer managment algorithms, simulations are excuted with two proiorities and the results are provied that network throughput is improved better than the existing parital buffer method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.1-7
• /
• 1996

In this paper, we analyzed the packet blocking probability of a finite buffer in a network interface unit. In general, a network interface unit which provides a means of interface between the network and computer has a microprocessor and a protocol processor for the network access protocols. It also has a receive buffer for the arriving packets from the network which is served by the microprocessor with service interruption by the protocol processor. In this paper, we modeled the receive buffer as a discrete time server with service interruption, and obtained the packet blocking probability using the mini-slot approximation.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.815-817
• /
• 2000

근래 Web Server의 안정된 운용의 중요성이 급증하는 Network Traffic과 더불어 점차 증대되고 있다. 기본적인 Network 구성망은 Ethernet으로 표준적인 프로토콜은 TCP/IP로 기반을 잡고 있다. 날로 증가하는 Network Traffic을 효과적으로 처리하기 위해서는 Network의 bandwidth 및 서버가 처리할 수 있는 데이터 양을 분석하여 병목현상을 줄이고 데이터의 흐름을 원활히 하기 위한 데이터 buffer들의 설치와 적절한 운영 방법에 관한 연구가 필요하다. 본 논문에서는 Web Server로부터 image 데이터를 전송 받아 이를 원활히 display하기 위한 Application Layer에서의 buffer 크기 및 제어방법에 관한 연구를 수행하고 특히 연속적인 이미지의 전송과 재생에 관한 buffer management에 관하여 고찰한다.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.214-222
• /
• 2008

Bode principle is applied to carry out traffic control for rate based ATM network, which guarantees the higher buffer utilization, buffer overflow-free, and well utilization of bandwidth. The principle confirms the relationship between the threshold of buffer queue and the network bandwidth, as well as the relationship between the threshold of buffer and source input rate. Theoretic warrant of the buffer threshold is proposed. The reference range of source input rate is provided in theory, which makes the source end respond to the change of network state rapidly and dynamically, and then the effect of time delay to the traffic control is avoided. Simulation results show that the better steady and dynamic performances of networks are obtained by Bode principle.