Adaptive medium access control for VoIP services in IEEE 802.11 WLANs

Abstract- Voice over Internet Protocol (VoIP) is an important service with strict Quality-of-Service (QoS) requirements in Wireless Local Area Networks (WLANs). The popular Distributed Coordination Function (DCF) of IEEE 802.11 Medium Access Control (MAC) protocol adopts a Binary Exponential Back-off (BEB) procedure to reduce the packet collision probability in WLANs. In DCF, the size of contention window is doubled upon a collision regardless of the network loads. This paper presents an adaptive MAC scheme to improve the QoS of VoIP in WLANs. This scheme applies a threshold of the collision rate to switch between two different functions for increasing the size of contention window based on the status of network loads. The performance of this scheme is investigated and compared to the original DCF using the network simulator NS-2. The performance results reveal that the adaptive scheme is able to achieve the higher throughput and medium utilization as well as lower access delay and packet loss probability than the original DCF

Web Conferencing Traffic - An Analysis using DimDim as Example

In this paper, we present an evaluation of the Ethernet traffic for host and attendees of the popular opensource web conferencing system DimDim. While traditional Internet-centric approaches such as the MBONE have been used over the past decades, current trends for web-based conference systems make exclusive use of application-layer multicast. To allow for network dimensioning and QoS provisioning, an understanding of the underlying traffic characteristics is required. We find in our exemplary evaluations that the host of a web conference session produces a large amount of Ethernet traffic, largely due to the required control of the conference session, that is heavily-tailed distributed and exhibits additionally long-range dependence. For different groups of activities within a web conference session, we find distinctive characteristics of the generated traffic

An acceleration simulation method for power law priority traffic

A method for accelerated simulation for simulated self-similar processes is proposed. This technique simplifies the simulation model and improves the efficiency by using excess packets instead of packet-by-packet source traffic for a FIFO and non-FIFO buffer scheduler. In this research is focusing on developing an equivalent model of the conventional packet buffer that can produce an output analysis (which in this case will be the steady state probability) much faster. This acceleration simulation method is a further development of the Traffic Aggregation technique, which had previously been applied to FIFO buffers only and applies the Generalized Ballot Theorem to calculate the waiting time for the low priority traffic (combined with prior work on traffic aggregation). This hybrid method is shown to provide a significant reduction in the process time, while maintaining queuing behavior in the buffer that is highly accurate when compared to results from a conventional simulatio

On the Large Deviations of a Class of Stationary On/Off Sources which Exhibit Long Range Dependence

We present a class of stationary two-state sources which exhibit long range dependence: We relate the large deviations of their sojourn times to the large deviations of the sources themselves. We calculate the rate-function, on a non-linear scale, for a two-state source whose sojourn times are distributed by a semi-exponential distribution, and we calculate the rate-function for the multiplex of a finite collection of such sources

A simulation model for video traffic performance via ATM over TCP/IP

Although TCP has emerged as the standard in data communication, the introduction of ATM technology has raised numerous problems regarding the effectiveness of using TCP over A TM networks, especially when video traffic performance is considered. This paper presents a simulation model for transmission performance of video traffic via ATM over TCP/IP. The interactivity between TCP/IP and ATM, generation of MPEG traffic and evaluation of traffic performance are implemented in the model. The design and implementation details of the model are carefully described. The experiments conducted using the model and experimental results are briefly introduced, revealing the capability of our model in simulating network events and in evaluating potential solutions to performance issues.<br /

GPS queues with heterogeneous traffic classes

We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic classes are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behavior of the light-tailed class for the situation where its GPS weight is larger than its traffic intensity. The GPS mechanism ensures that the workload is bounded above by that in an isolated system with the light-tailed class served in isolation at a constant rate equal to its GPS weight. We show that the workload distribution is in fact asymptotically equivalent to that in the isolated system, multiplied with a certain pre-factor, which accounts for the interaction with the heavy-tailed class. Specifically, the pre-factor represents the probability that the heavy-tailed class is backlogged long enough for the light-tailed class to reach overflow. The results provide crucial qualitative insight in the typical overflow scenario

Introducción a los modelos de tráfico para redes de banda ancha

Peer Reviewe

Weibull mixture model to characterise end-to-end Internet delay at coarse time-scales

Traces collected at monitored points around the Internet contain representative performance information about the paths their probes traverse. Basic measurement attributes, such as delay and loss, are easy to collect and provide a means to both build and validate empirical performance models. However, the task of analysis and extracting performance conclusions from measurements remains challenging. Ideally, performance modelling aims to find a set of self-contained parameters to describe, summarise, profile and easy display network performance status at a time. This can result in the provision of meaningful information to address applications in fault and performance management, hence providing input to network provisioning, traffic engineering and performance prediction. In this work we present the Weibull Mixture Model, a method to characterise endto- end network delay measurements within a few simple, accurate, representative and handleable parameters using a finite combination of Weibull distributions, with all the aforementioned benefits. The model parameters are related tomeaningful delay characteristics, such as average peak and tail behaviour in a daily profile, and can be optimally found using an iterative algorithm known as Expectation Maximisation. Studies on such parameter evolution can reflect current workload status and all possible network events impacting packet dynamics, with further applications in network management. In addition, a self-sufficient procedure to implement the Weibull Mixture Model is presented, along with a set of matching examples to real GPS synchronised measurements taken across the Internet, donated by RIPE NCC