Elsevier

Computer Networks

Volume 51, Issue 3, 21 February 2007, Pages 683-698
Computer Networks

Granular model of packet pair separation in Poissonian traffic

https://doi.org/10.1016/j.comnet.2006.06.002Get rights and content

Abstract

We introduce a theoretical model of packet pair separation based on a transient solution of the Takács integro-differential equation. We show that in addition to the parameters of the fluid approximation (physical bandwidth and the average cross traffic rate) a new parameter characterizing the granularity of the cross traffic is necessary. These three parameters determine the dynamics of the queue in the diffusive approximation and all important distributions and averages of the packet separation even in multi-hop scenarios (assuming independent cross traffic on different hops). The model describes correctly the data collected in simulations, laboratory and Internet experiments. The adjustable model parameters are the physical bandwidth, the available bandwidth and the weighted average of the packet size of the cross traffic. We show that an implementation of the theoretical results can be used to estimate such parameters in packet chirp type measurements and can be a good candidate for improved available bandwidth estimation.

Introduction

In recent years the characterization of network traffic has been the interest of measurements in the Internet [1], [2], [3], [4]. The importance of measuring the main parameters of network traffic is evident. For many applications, such as audio and video streaming, it is essential to know the available bandwidth of the network path [5], [6]. Usually, end-to-end measurements are used to obtain information about the traffic conditions on a path and various probing strategies emerged.

Analysis of the dispersion process of packet pairs plays an essential role in determining the properties of cross traffic and other network conditions from experiments. The statistical analysis should rely on certain theoretical assumptions on the details of this dispersion process. The simplest approach is the fluid model where the cross traffic is regarded as a continuum of infinitely small packets. Dovrolis et al. [5] extended the work of Jacobson [7] on packet pair spacing without any cross traffic and showed the effect of fluid cross traffic in the dispersion of packet trains. The finite packet size, the granular nature of the traffic has an important impact on the observable packet dispersion, which is disregarded in the fluid model.

The packet-pair spacing is the variable that plays a key role in the analysis of the end-to-end packet pair measurements. The available bandwidth and other parameters of the route can be estimated by studying its statistics. In a recent theoretical work Liu et al. showed that the sample path average of the output packet-pair spacing can be expressed with the δ-interval available bandwidth sample-path frequency distribution [8], [9]. The results are non-parametric in nature and valid at a very broad set of conditions, which are very important from the point of view of a complete theoretical description. It is however, a prohibitive task to calculate the sample-path frequency distribution at cases of practical importance.

In order to take the next step, in this paper we derive a parametric expression and develop a framework based on the transient solution of the Takács integro-differential equation of queuing theory [10], [11], [12]. We show that this approach takes into account the granular nature of the cross traffic and can provide an exact formula for practical traffic and network parameter estimation. Our conclusion is that the physical bandwidth, the average cross traffic rate and the new granularity parameter Pg—introduced in this paper—determine the important parameters of queuing systems in the diffusion approximation and are sufficient to characterize their behaviour and all the important properties of the packet separation. The concept can easily be generalized for multi-hop systems, if the cross traffic is independent on different hops, and a useful approximation for the average output packet spacing can be developed. Our model also describes correctly the data collected in simulations and laboratory experiments. We implement the theoretical results in a measurement tool which can estimate various parameters like the physical bandwidth, the available bandwidth and the weighted average of the cross traffic packet size in the bottleneck link with remarkable accuracy.

In Section 2 we introduce our queuing theory based framework for the distribution of the output spacing. In Section 3 we derive a closed expression for the average output spacing in terms of zero workload probability. In Section 4 we give an explicit solution for the M/D/1 case. In Section 5 we validate the results with packet level simulations at various cross traffic distributions. In Section 6 we introduce granularity (Pg) that can characterize the deviation from the fluid model. This weighted average is an effective packet size of the cross traffic. We show that hops with the same physical bandwidth, average cross traffic rate and granularity parameter are identical from the point of view of the diffusive approximation of queuing theory. This parameter triple determines all their important distributions In Section 8 we show that the results can be generalized from single to multi-hop systems. In Section 9 we develop a traffic parameter estimation tool based on the theoretical results. We study the shape of the χ2 surface and the confidence of the parameter fitting. The applicability and accuracy of the method is tested in Section 10 in various real laboratory measurements.

Section snippets

Distribution of the output spacing in a single-hop

In this section we determine the distribution of the output spacing δ′ in a single-hop packet-pair measurement where the input spacing of the probe packets is δ. The packet-pair consists of probe packets of size p (in bits), the queue is assumed to be infinite with an outgoing physical bandwidth C (in bps) and has a FIFO policy. The workload just before the arrival of the first probe packet is w1 (in bits) and changes to w1 + p due to the arrival of the probe packet. The second probe packet

The average of the output spacing

The average of the output spacing can be calculated in two steps. First, we assume that the workload at the arrival of the first packet is w1 and we determine the conditional average of the output spacing. Then in a second step we average the result over the steady-state distribution of w1.

Averaging Eq. (1) yieldsE[δ]=δ+(E[w(δ)]-w1)/C,where E[w(δ)] is the average of the workload at time t = δ, assuming the initial workload is w0 = w1 + p. This average can be calculated with the complementary

Explicit solution for M/D/1

The simplest M/G/1 type case is an M/D/1 queue, where the cross traffic consists of packets of uniform size P and Poisson arrival rate λ. The Takács integro-differential equation takes the simple formF(w,t)t=λF(w-P,t)Θ(w-P)-F(w,t)+CF(w,t)w,where Θ(x) is the Heavy-side function with Θ(x) = 1 for x  0 and Θ(x) = 0 for x < 0. The average cross traffic is simply Cc = λP. The steady-state distribution is the solution of the time independent equationλF0(w-P,t)Θ(w-P)-F0(w,t)+CF0(w,t)w=0.This equation can

Validation with packet level simulation

As a first step, we would like to validate the theoretical results and compare them with packet level simulations. We consider three different cases. First an M/D/1 queue with a single parameter pair λ, P is investigated. In this case the packet level simulation and the analytic result can be compared directly. Next we consider a trimodal cross traffic packet size distribution with three different parameter pairs λi, Pi, where parameters are taken from real Internet measurements [18], [19], [20]

Parametrization of the average output spacing curve with the granularity

In the previous section we showed that the Takács equation based calculation describes the packet level simulation correctly. Our goal is to apply these results for realistic measurement data. In real life the parameters λ, C and the form of the function b(x) are not known a-priori. We should use the measured average output spacing curves to extract this information. In this section we investigate how these quantities affect the form of the average output spacing curves. We show that it is

The output spacing distribution

In (3) we defined the distribution of the output spacing. Using the numerical solution of the Takács equation it is possible now to compute the distribution of the output spacing. In Fig. 4 we compare the distribution of the output spacings for the examples of Fig. 2, Fig. 3. In the left side of Fig. 4 the distribution P(δ′∣δ) is shown for various input spacings δ for the scenarios of Fig. 2, with different granularity parameters. In the right side the same distribution is shown for the

Multi-hop scenarios

In this section we show that the output spacing curve is well parametrized by the three mentioned parameter even in a multi-hop network scenario.

The analysis presented so far can easily be generalized for the multi-hop scenario if the cross traffic on the hops are independent. In a typical network scenario the packet pair traverses several queues between the end-hosts of the measurement. The initial spacing of the packet pair is δ. After the first queue the output spacing becomes δ1. This

Estimating the network parameters

In this section we utilize the results to estimate the three key parameters of the network path (C, Cc, Pg). In an experiment we use many packet pairs with a given set of input spacings δi, i = 1, 2,  , N and measure the average output spacing E[δ]i corresponding to each input spacing. Then, to fit the parameters we have to minimize χ2, which is the squared difference of the theoretical and observed output probe spacing weighted by the variancesχ2=i=1NE[δmeasured]i-δ¯M/D/1(δi,C,Cc,Pg)σi2,where σi

Application for traffic measurements

To prove the efficiency of the estimation method we have conducted several measurements in the controlled environment of our test laboratory. We present only laboratory experiments since we could guarantee the fulfillment of our assumptions (single-hop scenario [26] and the Poisson arrival process of the cross traffic). In real wide area experiments these assumptions could be violated by real cross traffic with different statistical properties. The impact of the Poisson assumption on the

Conclusion

In this paper we introduced a new theoretical approach to the calculation of the average output spacing in packet pair measurements. Previous works relied on the fluid approximation, which disregards the granular nature of the network traffic. Based on queuing theory we introduced a framework, where the distribution of the output spacing has been expressed in terms of a special solution of the Takács integro-differential equation. Then we calculated the average output spacing curve for the

Acknowledgements

The authors thank the partial support of the National Science Foundation (OTKA T37903), the National Office for Research and Technology (NKFP 02/032/2004 and NAP 2005/ KCKHA005) and the EU IST FET Complexity EVERGROW Integrated Project.

Péter Hága received the M.Sc. degree in Physics from the Eötvös University, Budapest, Hungary in 2002. From 1999 to 2002 he was a graduate student at the Communication Networks Laboratory at the Eötvös University. He was a junior fellow in the Collegium Budapest, Institute for Advanced Study, Budapest, Hungary during the 2003/04 and 2004/05 academic years. From September 2005 he is a research assistant at the Institute of Physics at the Eötvös University. His research interest includes network

References (30)

  • B. Melander, M. Bjorkman, P. Gunningberg, A new end-to-end probing and analysis method for estimating bandwidth...
  • A.B. Downey, Using pathchar to estimate internet link characteristics, in: ACM SIGCOMM,...
  • M. Jain, C. Dovrolis, End-to-end available bandwidth: measurement, dynamics, and relation with TCP throughput, in: ACM...
  • K. Lai, M. Baker, Measuring bandwidth, in: IEEE INFOCOM,...
  • C. Dovrolis, P. Ramanathan, D. Moore, What do packet dispersion techniques measure? in: Proceedings of IEEE INFOCOM...
  • J. Strauss, D. Katabi, F. Kaashoek, A measurement study of available bandwidth estimation tools, in: ACM IMC,...
  • V. Jacobson, Congestion avoidance and control, in: ACM SIGCOMM,...
  • X. Liu, K. Ravindran, B. Liu, D. Loguinov, Single-hop probing asymptotics in available bandwidth estimation: a...
  • X. Liu, K. Ravindran, D. Loguinov, What signals do packet-pair dispersions carry? in: IEEE INFOCOM, March...
  • L. Takács

    Investigation of waiting time problems by reduction to Markov processes

    Acta Math. Acad. Sci. Hung.

    (1955)
  • L. Takács

    Introduction to the Theory of Queues

    (1962)
  • L. Kleinrock

    Queueing Systems Volume I: Theory

    (1975)
  • R. Morris, D. Lin, Variance of aggregated Web traffic, in: Proceedings of IEEE INFOCOM 2000, April,...
  • H. Jiang, C. Dovrolis, Why is the Internet traffic bursty in short time scales? in: Proceedings of the SIGMETRICS 2005,...
  • A.K. Erlang, The theory of probabilities and telephone conversations, in: Nyt Tidsskrift for Matematik B, vol. 20, p....
  • Cited by (7)

    View all citing articles on Scopus

    Péter Hága received the M.Sc. degree in Physics from the Eötvös University, Budapest, Hungary in 2002. From 1999 to 2002 he was a graduate student at the Communication Networks Laboratory at the Eötvös University. He was a junior fellow in the Collegium Budapest, Institute for Advanced Study, Budapest, Hungary during the 2003/04 and 2004/05 academic years. From September 2005 he is a research assistant at the Institute of Physics at the Eötvös University. His research interest includes network measurement techniques, network modelling, protocols.

    Krisztián Diriczi graduated in Physics and started his Ph.D. study at the Eötvös University, Budapest, Hungary in 2004. He joint in the area of research of communication networks in 2003, first dealed with properties of AIMD model, and since late 2004 has studied available bandwidth measurement methods based on packet pair measurement interpreting by queuing theory. His research interest in the area of realization of intelligent, adaptive protocols in heterogeneous networks.

    Gábor Vattay (full professor, Eötvös University, Budapest) received his Ph.D. in physics from the Hungarian Academy of Sciences in 1994. Founder and Director of the Communication Networks Laboratory at Eötvös University since 2000. Leader of the EU supported Internet measurement effort European Traffic Observatory Measurement Infrastructure (www.etomic.org) at Collegium Budapest, Institute for Advanced Study. He published about 40 papers in physics and networking and edited the book Complex Dynamics in Communication Networks. His interest includes modeling, measuring and design of communication networks.

    István Csabai (associate professor, Department of Physics of Complex Systems, Eötvös University, Budapest) received the Masters Degree (1989) and Ph.D. (1992) in physics from Eötvös University. His research interests covers wide areas of data mining, large scientific databases, modelling and measuring communication networks, simulation of complex systems. He was among the first authors (1994), who have identified and analysed the self-similar nature of internet traffic. Leader and participant of several national and international research projects.

    View full text