2 research outputs found
Delay analysis for wireless applications using a multiservice multiqueue processor sharing model
The ongoing development of wireless networks supporting multimedia applications requires service providers to efficiently deliver complex Quality of Service (QoS) requirements. The wide range of new applications in these networks significantly increases the difficulty of network design and dimensioning to meet QoS requirements. Medium Access Control (MAC) protocols affect QoS achieved by wireless networks. Research on analysis and performance evaluation is important for the efficient protocol design. As wireless networks feature scarce resources that are simultaneously shared by all users, processor sharing (PS) models were proposed for modelling resource sharing mechanisms in such systems. In this thesis, multi-priority MAC protocols are proposed for handling the various service traffic types. Then, an investigation of multiservice multiqueue PS models is undertaken to analyse the delay for some recently proposed wireless applications. We start with an introduction to MAC protocols for wireless networks which are specified in IEEE standards and then review scheduling algorithms which were proposed to work with the underlying MAC protocols to cooperatively achieve QoS goals. An overview of the relevant literature is given on PS models for performance analysis and evaluation of scheduling algorithms. We propose a multiservice multiqueue PS model using a scheduling scheme in multimedia wireless networks with a comprehensive description of the analytical solution. Firstly, we describe the existing multiqueue processor sharing (MPS) model, which uses a fixed service quantum at each queue, and correct a subtle incongruity in previous solutions presented in the literature. Secondly, a new scheduling framework is proposed to extend the previous MPS model to a general case. This newly proposed analytical approach is based on the idea that the service quantum arranged by a MAC scheduling controller to service data units can be priority-based. We obtain a closed-form expression for the mean delay of each service class in this model. In summary, our new approach simplifies MAC protocols for multimedia applications into an analytical model that includes more complex and realistic traffic models without compromising details of the protocol and significantly reduces the number of MAC headers, thus the overall average delay will be decreased. In response to using the studied multiservice multiqueue PS models, we apply the MPS model to two wireless applications: Push to Talk (PTT) service over GPRS/GSM networks and the Worldwide Interoperability for Microwave Access (WiMAX) networks. We investigate the uplink delay of PTT over traditional GPRS/GSM networks and the uplink delay for WiMAX Subscriber Station scheduler under a priority-based fair scheduling. MAC structures capable of supporting dynamically varying traffic are studied for the networks, especially, with the consideration of implementation issues. The model provides useful insights into the dynamic performance behaviours of GPRS/GSM and WiMAX networks with respect to various system parameters and comprehensive traffic conditions. We then evaluate the model under some different practical traffic scenarios. Through modelling of the operation of wireless access systems, under a variety of multimedia traffic, our analytical approaches provide practical analysis guidelines for wireless network dimensioning
Contributions to modelling of internet traffic by fractal renewal processes.
The principle of parsimonious modelling of Internet traffic states that a minimal
number of descriptors should be used for its characterization. Until early 1990s,
the conventional Markovian models for voice traffic had been considered suitable
and parsimonious for data traffic as well. Later with the discovery of strong
correlations and increased burstiness in Internet traffic, various self-similar count
models have been proposed. But, in fact, such models are strictly mono-fractal
and applicable at coarse time scales, whereas Internet traffic modelling is about
modelling traffic at fine and coarse time scales; modelling traffic which can be
mono and multi-fractal; modelling traffic at interarrival time and count levels;
modelling traffic at access and core tiers; and modelling all the three structural
components of Internet traffic, that is, packets, flows and sessions.
The philosophy of this thesis can be described as: “the renewal of renewal theory
in Internet traffic modelling”. Renewal theory has a great potential in modelling
statistical characteristics of Internet traffic belonging to individual users, access
and core networks. In this thesis, we develop an Internet traffic modelling
framework based on fractal renewal processes, that is, renewal processes with
underlying distribution of interarrival times being heavy-tailed. The proposed
renewal framework covers packets, flows and sessions as structural components
of Internet traffic and is applicable for modelling the traffic at fine and coarse
time scales. The properties of superposition of renewal processes can be used
to model traffic in higher tiers of the Internet hierarchy. As the framework is
based on renewal processes, therefore, Internet traffic can be modelled at both
interarrival times and count levels