The Scientific World Journal

Volume 2014 (2014), Article ID 238682, 9 pages

http://dx.doi.org/10.1155/2014/238682

Research Article

Describing the Access Network by means of Router Buffer Modelling: A New Methodology

Luis Sequeira, Julián Fernández-Navajas, Jose Saldana, José Ramón Gállego, and María Canales

Communications Technology Group (GTC), Aragón Institute of Engeneering Research (I3A), Department of IEC, EINA, University of Zaragoza, Ada Byron Building, 50018 Zaragoza, Spain

Received 7 March 2014; Accepted 25 May 2014; Published 24 July 2014

Academic Editor: Zhongmei Zhou

Copyright © 2014 Luis Sequeira et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

The behaviour of the routers’ buffer may affect the quality of service (QoS) of network services under certain conditions, since it may modify some traffic characteristics, as delay or jitter, and may also drop packets. As a consequence, the characterization of the buffer is interesting, especially when multimedia flows are transmitted and even more if they transport information with real-time requirements. This work presents a new methodology with the aim of determining the technical and functional characteristics of real buffers (i.e., behaviour, size, limits, and input and output rate) of a network path. It permits the characterization of intermediate buffers of different devices in a network path across the Internet.

1. Introduction

Traditionally, the available bandwidth, delay, and jitter between two end-to-end devices have been used as a parameter that can give a rough idea of the expected quality of service (QoS). But nowadays, we know that QoS is also affected by the behaviour of the intermediate router buffer, which is mainly determined by its size and its management policies. So, the buffer may cause different packet loss behaviour and may also modify some QoS parameters.

Many multimedia applications and services (e.g., videoconferencing, video streaming, peer-to-peer, and VoIP services) take advantage of various available bandwidth estimations techniques and tools (ABETT) in order to improve some QoS parameters. But all these techniques have one thing in common: they are focused on links estimations at the core network where buffer behaviour and its parameters are not the principal priorities.

In general, buffers are used as a traffic regulation mechanism in network devices. Current core routers make extensive use of AQM (active queue management) disciplines which are able to maintain a shorter queue length than drop-tail queues; this fights against bufferbloat and reduces latency. But these techniques (e.g., RED and SRED) require careful tuning of their parameters in order to provide good performance [1]. There exist QoS scheduling algorithms as weighted fair queuing (WFQ) which is a data packet scheduling technique allowing different scheduling priorities to statistically multiplexed data flows.

However, some network points may become critical bottlenecks, mainly in access networks, because these networks’ capabilities are lower than the ones available in the backbone, being the main cause of packet loss of the discarding of packets in router queues. Mid- and low-end routers, which do not implement advanced traffic management mechanisms, are usually used in access networks. In this scenario, SME (small and medium enterprises) environments may be principally affected because of their modest infrastructure. So the design characteristics of router buffers and the implemented scheduling policies are of primary importance in order to ensure the correct delivery of the traffic of different applications and services, so it will be useful to include buffer parameters in the link capacity estimation.

On the other hand, it is true that the performance of TCP (transmission control protocol) has been extensively studied and a big number of variants ( SACK, New Reno, Vegas, etc.) have been deployed in order to improve it. Nevertheless, many multimedia applications and real-time services transport their information under UDP (user datagram protocol). So, the applications have to describe certain network behaviour for optimizing traffic.

Hence, the characterization of the technical and functional parameters of router buffer in SME environments becomes critical when planning a network or trying to provide certain levels of QoS. As a consequence, if the size and the behaviour of the buffer are known, some techniques can be used so as to improve link utilization, for example, multiplexing a number of small packets into a big one, fragmentation, smoothing traffic, and so forth.

A new methodology is presented in this paper in order to describe the access network by means of router buffer modelling (e.g., behaviour, size, limits, and input and output rate) by the use of four simple steps which will be detailed in Section 3.3. In particular we will estimate bandwidth, size, and behaviour because this gives us more useful link information, than only an estimation with ABETT techniques. In addition, this methodology has been deployed in order to solve problems of resource consumption for processing data and inaccuracies when obtaining input rate estimations and buffer size as well.

The paper is organized as follows: Section 2 presents the related work, and Section 3 describes the test methodology. The next section covers the experimental results, and the paper ends with the conclusions.

2. Related Work

2.1. Bandwidth Estimations

There exist several estimation techniques for obtaining available bandwidth. A performance evaluation of Pathload, Pathchirp, Spruce, IGI, and Abing in a flexible test bed was presented in [2]. The results demonstrate that ABETTs are far from being ready to be applied in all applications and scenarios. The evaluation includes scenarios in which the packet loss rate and the propagation delays of the links have been varied. Also, the amount of cross-traffic, the capacity of the links, and the cross-traffic packet size were tested for different values.

In [3], the authors define probabilistic available bandwidth as the largest input rate at which we can send a traffic flow along a path while achieving, with specified probability, an output rate that is almost as large as the input rate. The method is expressed directly in terms of the measurable output rate and includes adjustable parameters that allow the user to adapt to different application requirements. It was proposed as a new definition for available bandwidth and a novel framework that addresses some issues: provide a confidence interval, be suited to the task of multipath estimation in large-scale networks, and provide enough flexibility in terms of accuracy, overhead, latency, and reliability to adapt to the requirements of various applications.

Moreover, in [4] a novel tool for end-to-end ABETT PRM (probe gap models) called quality monitoring and estimation (QMoEs) was proposed, as a key component embedded in the RUBENS (rethinking the usage of broadband access for experience-optimized networks and services) architecture. The results indicate that QMoEs present a good performance in terms of accuracy and estimation time which validates the ABETT within the RUBENS framework.

2.2. Buffer Issues

Buffers are used to reduce packet loss by absorbing transient bursts of traffic when routers cannot forward them at that moment. They are instrumental in keeping output links fully utilised during congestion times.

For many years, researchers accepted the so-called rule of thumb (or bandwidth delay product, BDP) to obtain the amount of buffering needed at a router’s output interface. This rule was proposed in [5] and it is given by , where is the buffer size, is the average round-trip time, and the capacity of the router’s network interface. In [6] a reduced buffer size was proposed by dividing the BDP by the square root of the number of TCP flows, , . This model was called small buffer. In [7] the use of even smaller buffers, called tiny buffers, was suggested considering a size of some tens of packets.

In [8], the authors presented a simple algorithm to manage a drop-tail queue, which adapts its size based on traffic conditions in order to obtain a minimum size and providing high level of utilization. The results show that adaptive drop-tail achieves significantly smaller queues than current approaches at the expense of 1-2% of the link utilization.

The buffer can be measured in different ways: maximum number of packets, amount of bytes, or even queueing time limit [9, 10]. For example, in [11] the routers of two manufacturers were compared, and it was observed that one measures the buffer in packets, whereas the other one does it in milliseconds.

Moreover, the buffer must play an important role when planning a network because it can influence the packet loss of different services and applications. The reason for this is that there is a relationship between router buffer size and link utilization, since an excessive amount of memory would generate a significant latency increment when the buffer is full. On the other hand, a very small amount of memory in the buffer will increase packet loss in congestion time. As a consequence, the knowledge of the buffer behaviour is an interesting parameter which can be considered when trying to improve link utilization.

2.3. The Influence of the Buffer on Real-Time Services

The influence of the router buffer on the subjective quality experienced by users of a interactive service (i.e., an online game) with very tight real-time requirements was studied in [4], showing the mutual relationship between the size and policies of the buffer and the obtained subjective quality, which mainly depends on delay and jitter in this case.

The study has been conducted, showing that tiny buffers are more adequate in order to maintain game quality in acceptable levels. Since, if it is too big it may add delay and jitter which are not acceptable for gamers.

A popular online, multiplayer, game server was studied in [12]; the paper shows the results of a 500-million packet trace in which the traffic behaviour describes a loaded game server and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link. Online games try to provide relatively uniform experiences between all players, maximizing the interactivity of the game, so they fix their usage requirements in such a way as to saturate the network link of their lowest speed players.

The authors also comment that facing the stringent demands on interactivity, routers must be designed with enough capacity to manage such bursts without delay. But current routers are designed for bulk data transfers with larger packets, so a significant deployment of online game servers will have the potential for overwhelming the current networking equipments.

Several studies have characterized P2P video streaming applications and have measured their impact in the communication networks traffic. So, in [13] a traffic characterization of major P2P-TV application was presented and they concluded that the traffic consists in a mixture of small packets (signalling packets) and large packets (video packets). In addition, the generation of high rates of small packets may penalize the video packets and consequently the peer’s behaviour within a P2P structure may not be as expected. The application relies on UDP traffic and it is revealed that this application faces a high overhead; about of packets correspond to signalling, and the other correspond to video data packets.

In [14], the results show that the presence of a bursty application (video surveillance) causes packet loss for all the coexisting applications, even for those generating constant bit rate traffic (VoIP). In addition, packet loss decreases when buffer size is increased, because big buffers can absorb the burst produced by the traffic mix. As expected, packet loss increases when link utilization grows in the case of -packet buffer (Figure 1).

(a) When link utilization is 70% for different buffer size

(b) When buffer size is 40 packets for different values of link utilization

Figure 1: Packet loss.

The tests were deployed in a scenario in which two IP camera flows, one videoconferencing session, and two VoIP calls are used as test traffic in two different tests: in the first one, the Internet access link was set to an average link utilization of and different values of the buffer size were tested. In the second tests, the buffer size of the Internet access router was fixed at packets and different values of the access bandwidth were used, so consequently different levels of link utilization ranged from to .

3. Methodology for the Characterization of Internet Paths

The network path (Figure 2) is uncertain for most applications and services which only measure the available bandwidth, in order to limit the generated traffic and rarely to attune it (e.g., trough smoothing it). Thus, we propose a method for applications to discover and get advantage of knowing network characteristics by means of finding the buffer behaviour models which may be useful to correctly attune the traffic.

Figure 2: Network path and topology used for tests.

3.1. Network Path Model

Traditionally a network path can be characterized by bandwidth, packet loss, and delay. The premises of this work are that most of the network characteristics can be explained by buffer models. We recommend a characterization by including buffer parameters (size and input and output rate) and buffer behaviour; see Figure 3.

Figure 3: Link model parameters.

In this work, the buffer model only considers FIFO queues since they are the most common in real access network devices as it was observed in [15]. The same work also reported that the behaviour of these buffers can be characterized as follows: once the buffer gets completely full, no more packets or bytes are accepted until a certain amount of memory is available; see Figure 4. Thus, an upper limit and a lower limit can be defined: when the upper limit is reached, no more packets or bytes are accepted until the size of the buffer corresponds to the lower limit. There are some cases in which the difference between lower limit and upper limit is as small as one packet; however, this difference sometimes reaches tens of packets. Generally speaking, a buffer drops packets in bursts. The number of packets per burst depends on the relationship between the input and output rates. When these rates are very similar, the number of packets in the burst can be just one packet.

Figure 4: A particular buffer behaviour.

3.2. Test Procedure

The scheme of the tests is shown in Figure 2. There is a “system under test” (SUT from now), which may be either a single device or an entire network. The test is based on sending a burst of UDP packets, all with the same length, from the source to the destination machine, so as to produce a buffer overflow in the SUT. All the transmitted packets are identified by a sequence number included in the payload.

3.3. Methodology

The methodology is based on the premise that the output rate can be obtained from traffic capture at the destination device. This output rate depends on the technology used in each case (Ethernet, Wi-Fi, Cablemodem, and others). Different buffers can be detected by means of a packet loss pattern analysis when more than one bottleneck is in the path. In most cases, one buffer is the main cause of packet loss in a network path and sometimes two buffers can get into overflow at the same time in an access network; for this reason, we will use as an example the case of two concatenated buffers to present this methodology (Figure 5).

Figure 5: Two concatenated buffers.

The output rate can be easily determined by the destination trace because we know all arrived packets and the time of each one; see Figure 6. Also, the input rate can be estimated counting the dropped packets in the destination trace by means of the sequence number included in the payload.

Figure 6: Dropped packets for two concatenated buffers.

A packet loss map is useful not only to determine the amount of losses but also to observe the packet loss patterns which may define each buffer model. It is a simple packet loss scatter (see Figure 7). We should note that the information on this map is equivalent to the buffer occupancy under the same conditions, also a simple way to see the packet loss patterns (hop sequence) which are difficult to deduce from Figure 6.

Figure 7: Packet loss map for two concatenated buffers.

The methodology consists of four simple steps which will be described as follows:

3.3.1. Analyze Packet Loss Patterns

The analysis consists of determining the number of congested buffers and the packet loss rate of each one. As an example, in Figure 7 we can see two different patterns which correspond to two buffers. The packet loss for the first is packets per burst, while the second only drops packet per burst. Also, we can find the number of dropped packets in a given period of time for Buffer 1 () and Buffer 2 ().

3.3.2. Determine Rates

The output rate ( in Figure 6) can be calculated with (2), from the destination trace because we know all the arrived packets, , and the arrival time of each one; see Figure 6. The input rate ( in Figure 6) is obtained with the arrived packets and all the dropped ones (3). We must estimate the rates in the period in which we observed all the packet loss patterns (see Figures 6 and 7) since it has been observed that it is the most stable period in terms of output rate and packet loss. Consider

where is the packet length.

If we obtain several packet loss patterns (see Figure 6), we can also calculate intermediate rates. When there are two buffers in the path a general equation (4) can be defined in which two values can be found. The intermediate rate calculation ( in Figure 6) will generate two different possible values. In order to obtain the correct value, a new test with a new generated rate between these two value rates is needed. If the results show (by observing packet loss maps) that both buffers are overflowed then the correct value is the lowest one; otherwise it is the highest. Consider

3.3.3. Infer Locations

The packet loss rate is defined by the relationship between input and output rates of any buffer. So, when the packet loss rate of each buffer is known, we can compare the rate with the relationship of the input and output rates (, , and ) to obtain the buffer position; see Figure 6.

3.3.4. Estimate Buffer Size

When we know the buffer input and output rates, then buffer size can be estimated if we find the latency of a packet in the buffer when it is full. In this case, we use the last received packet before the first packet loss, as it is shown in Figure 8, because this is the packet which completely fills the buffer. In addition the sequence number (SN) of this packet can give us the number of packets sent in certain time . The th packet gets into the Buffer m in a time: , and the output time is . The packet latency is , so the buffer size, in packets, of the buffer can be estimated using (5), which only depends on the rates relationship and the arrived packets before the packet loss in each buffer.

Figure 8: Estimating buffer size, from the last received packet before first packet loss.

The number of arrived packets to a certain buffer, before the first packet loss, depends on which buffer drops packets first and the physical location of the buffer (see Figure 6) described above. From Figure 6 we know that Buffer 1 is physically before Buffer 2, so the dropped packets by Buffer 1 will never arrive to Buffer 2. From Figure 7 we know that Buffer 1 is the first one in dropping packets, so we can deduce that and . The same analysis can be applied when Buffer 2 is before Buffer 1. In this case the dropped packets by Buffer 2 successfully pass through Buffer 1, so and . Consider

With the aim of determining if the buffer is measured in number of bytes or packets, a new test should be done; in this case, the new test burst of UDP packets should use a different packet length. Now, we can calculate buffer size for all tests and compare the results: if the buffer size is the same for all tests, the buffer is measured in number of packets if not in bytes.

4. Experimental Results

Real tests have been deployed in a testbed and results are analyzed according to the procedures cited above. We have implemented a controlled network environment in order not only to reproduce the scenario in Figure 5 but also to study two different devices: a switch (3COM) and a Wi-Fi access point (Linksys WAP54G). The topology is shown in Figure 9.

Figure 9: Topology used for estimating the buffer size in wired and wireless network.

The wireless link capacity is set to 11 Mbps. Packets of different sizes (200, 400, 1000, 1500 bytes) are used to determine if the buffer is measured in number of packets or in bytes. The presented results are the most significant.

4.1. Characterizing the Path

4.1.1. Analyze Packet Loss Patterns

In order to obtain a reliable packet-loss map that permits the pattern analysis and be the least intrusive as possible, we generated a traffic of 20 Mbps with a packet length of 1500 bytes, which is considerably bigger than link capacity and it is not so intrusive as the interface maximum output rate. Figure 10(a) shows two different packet loss patterns which can be determined by observing the groups of packets around the same packet loss value. The first pattern is roughly packets and the second one . The second pattern is very constant while the first presents some dispersion.

(a)

(b)

Figure 10: Packet loss patterns in the switch and the access point for different bandwidth amounts when packet size is 1500 bytes.

4.1.2. Determine Rates

We obtain output and input rates using (2) and (3) in the stable period; however output rate presents more variations due to Wi-Fi behaviour. The results are  Mbps (average) and  Mbps. Figure 10(a) shows two patterns, so there is an intermediate rate . From (4) we obtain two possible values:  Mbps and  Mbps. In order to choose the correct value a new test is deployed with a rate of 16 Mbps (a value between and ). The results can be seen in Figure 10(b), which shows that two packet loss patterns appear. This means that both buffers get into overflow (the first pattern still maintains its value in packets, but the second one has decreased to ); thus the intermediate rate is 10 Mbps.

4.1.3. Infer Locations

If we consider the buffer order as shown in Figure 6 and the obtained results ( Mbps, 10 Mbps, and 6.5 Mbps), Buffer 1 must lose half the arrived packets, but Buffer 2 only . We compare these results with each packet loss pattern and we infer that Buffer 1 drops bursts of packets and Buffer 2 drops bursts of . Furthermore, Buffer 2 may correspond to the Wi-Fi access point buffer because it has more variations in the number of packets per burst.

4.1.4. Estimate Buffer Size

From the destination capture we can observe that the first burst of dropped packets corresponds to Buffer 2 despite having a lowest filling rate than Buffer 1. This is due to the time to completely fill Buffer 2 is smaller than Buffer 1, so .

We obtained the buffer size for Buffer 1 (switch) and Buffer 2 (access point) using (5) with and . The maximum buffer sizes are roughly packets for the switch and packets (average) for the access point, which correspond to the technical characteristics provided by the manufacturer. The test was repeated with different packet sizes obtaining the same results for buffer sizes, so we conclude that both buffers are measured in number of packets (Figure 11). This methodology can be used for a deep analysis of a single device, the most restrictive, for example, observing the packet size effect.

Figure 11: Estimated parameters for two concatenated buffers.

5. Conclusion

This paper has presented a methodology which is useful in order to describe the technical and functional characteristics of commercial buffers on a network path. This characterization is important, taking into account that the buffer may modify the traffic characteristics.

Tests using commercial devices have been deployed in a controlled laboratory scenario, including wired and wireless devices. Accurate results of the buffer size and other parameters have been obtained. We have demonstrated that buffers may be analyzed independently of other devices. As a future line, more than two buffers will be studied by packet loss pattern analysis.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work has been partially financed by the European Social Fund in collaboration with the Government of Aragón, Spanish Government, through Grant TEC2011-23037 from the Ministerio de Ciencia e Innovacin (MICINN) and PECIO Project, University of Zaragoza, and Fundación Carolina.

References

S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Transactions on Networking, vol. 1, no. 4, pp. 397–413, 1993.

C. D. Guerrero and M. A. Labrador, “On the applicability of available bandwidth estimation techniques and tools,” Computer Communications, vol. 33, no. 1, pp. 11–22, 2010.

F. Thouin, M. Coates, and M. Rabbat, “Large scale probabilistic available bandwidth estimation,” Computer Networks, vol. 55, no. 9, pp. 2065–2078, 2011.

J. Saldana, J. Fernández-Navajas, J. Ruiz-Mas, E. Viruete Navarro, and L. Casadesus, “The effect of router buffer size on subjective gaming quality estimators based on delay and jitter,” in Proceedings of the IEEE Consumer Communications and Networking Conference (CCNC '12), pp. 482–486, Las Vegas, Nev, USA, January 2012.

C. Villamizar and C. Song, “High performance TCP in ANSNET,” SIGCOMM Computer Communication Review, vol. 24, no. 5, pp. 45–60, 1994.

G. Appenzeller, I. Keslassy, and N. McKeown, “Sizing router buffers,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '04), R. Yavatkar, E. W. Zegura, and J. Rexford, Eds., pp. 281–292, ACM, 2004.

M. Enachescu, Y. Ganjali, A. Goel, N. McKeown, and T. Roughgarden, “Part III: routers with very small buffers,” Computer Communication Review, vol. 35, no. 3, pp. 83–90, 2005.

R. Stanojević, R. N. Shorten, and C. M. Kellett, “Adaptive tuning of drop-tail buffers for reducing queueing delays,” IEEE Communications Letters, vol. 10, no. 7, pp. 570–572, 2006.

A. Vishwanath, V. Sivaraman, and G. N. Rouskas, “Considerations for sizing buffers in optical packet switched networks,” in Proceedings of the 28th Conference on Computer Communications (IEEE INFOCOM '09), pp. 1323–1331, Rio de Janeiro, Brazil, April 2009.

A. Dhamdhere and C. Dovrolis, “Open issues in router buffer sizing,” Computer Communication Review, vol. 36, no. 1, pp. 87–92, 2006.

J. Sommers, P. Barford, A. G. Greenberg, and W. Willinger, “An SLA perspective on the router buffer sizing problem,” SIGMETRICS Performance Evaluation Review, vol. 35, no. 4, pp. 40–51, 2008.

W. C. Feng, F. Chang, W. C. Feng, and J. Walpole, “Provisioning online games: a traffic analysis of a busy counter-strike server,” in Proceedings of the Internet Measurement Workshop, pp. 151–156, ACM, 2002.

B. Fallica, Y. Lu, F. Kuipers, R. Kooij, and P. Van Mieghem, “On the quality of experience of SopCast,” in Proceedings of the 2nd International Conference on Next Generation Mobile Applications, Services, and Technologies (NGMAST '08), pp. 501–506, September 2008.

L. Sequeira, J. Fernández-Navajas, L. Casadesus, J. Saldana, I. Quintana, and J. Ruiz-Mas, “The influence of the buffer size in packet loss for competing multimedia and bursty traffic,” in Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS '13), pp. 134–141, July 2013.

L. Sequeira, J. Fernández-Navajas, J. Saldana, and L. Casadesus, “Empirically characterizing the buffer behaviour of real devices,” in Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS '12), pp. 1–6, July 2012.