Buffer Size Estimation Research Articles

Estimation of Buffer Size in Computer Networks

Estimation of Buffer Size in Computer Networks

Buffer Dimensioning for a Packet/Speech Multiplexer: A New Asymptotic Approach

In this paper we face the buffer dimensioning issue in which it is required to estimate the minimum buffer size of the packet/speech multiplexer needed to meet various traffic conditions with a specified quality-of-service (QoS) objectives and fixed source statistics. An important QoS measure that we study in this paper is the loss probability. The approach, based on the fluid flow analytical model, whose input consists of the superposition of homogeneous ON/OFF sources, is often used in literature for modelling packet/speech multiplexer: We also use this model. However, unlike the traditional fluid-flow approach based upon spectral expansion solution, we use matrix-analytic methods which give us closed-form exact equation to calculate the overflow probability. Further, by analyzing in asymptotic regime, we get an approximate equation from which, with simple algebraic manipulations, we get an equation for the minimum buffer size estimation.

Delay optimization using Knapsack algorithm for multimedia traffic over MANETs

Multimedia transmission over Mobile Ad-hoc Networks (MANETs) is crucial to many applications. However, MANETs possess several challenges including transmitting large size packets, minimizing delay, loss-tolerant and buffer size estimation. For effective multimedia transmission, delay should be minimized and packets should be received in the defined order. The existing standards such as 802.11b and 802.11e perform well in wireless networks, but exhibit poor response in MANETs for multimedia traffic, especially in multi-hop networks. In this paper, we first establish the dependency of delay on buffer size and packet size, and then present a delay optimization approach for multimedia traffic in MANETs. We use Knapsack algorithm for buffer management to maximize the in-order packets and minimize the out-of-order packets simultaneously. Our approach exploits the buffer internals and dynamically adjusts the buffer usage so that a node transmits the packets in the desired order to its successive nodes. Careful estimation of packet size and buffer size helps in minimizing the delay, improving the capability of receiving packets in the correct order and reducing out-of-order packets in the buffer at intermediate nodes. Our approach also controls the loss of multimedia data packets during transmission. We validate our approach with real-world examples using network simulator.

Comparative Studies of Methods for Accurate Hurst Parameter Estimation

Over the last decade the traffic of the packet-based networks shows self-similar or long-range dependent nature. Such behaviour raises issues of accuracy in resource allocation and related guarantee required of QoS parameters for data flow. One of the popular mechanisms for QoS parameters guaranty is Measurement-based Admission Control (MBAC). In it’s turn, the efficiency of the MBAC mechanism is tightly related to the accuracy of traffic parameters estimation. The appropriate buffer size estimation is one of primary tasks in MBAC for QoS parameters guarantee. Hurst parameter which describes the level of self-similarity is used for this purpose. The accuracy of it’s estimation is important as otherwise underutilization or over-saturation of the system may occur that would cause high packet losses. The present paper provides a thorough overview of currently known methods for Hurst parameter estimation and presents research results of accuracy levels of each of them.

On Queue Length and Link Buffer Size Estimation in 3G/4G Mobile Data Networks

The emerging mobile data networks fueled by the world-wide deployment of 3G, HSPA, and LTE networks created new challenges for the development of Internet applications. Unlike their wired counterpart, mobile data networks are known to exhibit highly variable bandwidth. Moreover, base stations are often equipped with large buffers to absorb bandwidth fluctuations to prevent unnecessary packet losses. Consequently to optimize protocol performance in mobile data networks it is essential to be able to accurately characterize two key network properties: queue length and buffer size of the bottleneck link. This work tackles the challenge in estimating these two network properties in modern mobile data networks. Using extensive trace-driven simulations based on actual bandwidth trace data measured from production mobile data networks, we show that existing queue-length and link buffer size estimation algorithms no longer work well in bandwidth-varying networks. We develop a novel sum-of-delays algorithm which incorporates the effect of bandwidth variations into its estimation. Extensive trace-driven simulation results show that it can accurately estimate the queue length and link buffer size under both fixed and varying bandwidth conditions, outperforming existing algorithms by up to two orders of magnitude.

A New Technique for Removing Jitter in Network Multimedia Communication to Achieve Guaranteed QoS over Packet Network

edia data are sensed by human. These types of data are delay intolerable but error tolerable to some extend. Two important parameters that degrade the quality of service (QoS) of multimedia services are Skew and Jitter. Achieving guaranteed Quality of Service (QoS) of multimedia service is a great research challenge. Different researchers proposed different techniques for removing jittering and skew to achieve guaranteed Qos. Accelerating and De accelerating technique, Buffer size estimation technique and Clock time synchronization between sender and receiver are some suitable techniques. But all of the techniques have some advantages and disadvantages. In this current work of the drawbacks of the available techniques for removing jitter is described and new techniques for removing jitter is proposed. A comparison of the available techniques with the proposed technique is made to show the superiority of the proposed technique than the already available techniques.

G/M/1 queue study of buffer behavior in the decoding system of computer communication

This paper deals with the buffer behavior at the decoding center of a computer communication system in which the messages are in the Huffman code of English text. It is assumed that the arrival of messages has an arbitrary distribution, with the message lengths having negative exponential distribution. The situation is well described by the G/M/1 model of queue theory. The waiting time model is simulated on the EC-1030 computer, assuming the HP2100A computer is the decoding machine. The simulation results are used for estimation of buffer size in a character-oriented system and block-oriented system for a very low overflow probability.

M/G/I queue analysis for Huffman coded english text decoding system

The queueing model with limited waiting room, i.e. buffer size for messages of arbitrary lengths and Poisson arrival, at a demultiplexing terminal using a HP 2100A computer has been studied. The data have been constructed using Huffman code to English text. Storage capacity for an ergodic system has been estimated by M/G/I analysis with practically no loss of information. This analysis may be used as a guide-line for buffer size estimation in computer communication networks when data are being constructed with the use of Huffman code and due consideration to the frequencies of alphabets and word size.