Return to search

Providing quality of service for realtime traffic in heterogeneous wireless infrastructure networks

In recent years, there has been a rapid growth in deployment and usage of realtime network applications, such as Voice-over-IP, video calls/video conferencing, live network seminars, and networked gaming. The continued increase in the popularity of realtime applications requires a more intense focus on the provision of strict guarantees for Quality of Service (QoS) parameters such as delay, jitter and packet loss in access networks. At the same time, wireless networking technologies have become increasingly popular with a wide array of devices such as laptop computers, Personal Digital Assistants (PDAs), and cellular phones being sold with built-in WiFi and WiMAX interfaces. For realtime applications to be popular over wireless networks, simple, robust and effective QoS mechanisms suited for a variety of heterogeneous wireless networks must be devised. Implementing the same QoS mechanisms across multiple neighbouring networks aids seamless handover by ensuring that a flow will be treated in the same way, both before and after handover. To provide guaranteed QoS, an access network should limit load using an admission control algorithm. In this research, we propose a method to provide effective admission control for variable bit rate realtime flows, based on the Central Limit Theorem. Our objective is to estimate the percentage of packets that will be delayed beyond a predefined delay threshold, based on the mean and variance of all the flows in the system. Any flow that will increase the percentage of delayed packets beyond an acceptable threshold can then be rejected. Using simulations we have shown that the proposed method provides a very effective control of the total system load, guaranteeing the QoS for a set of accepted flows with negligible reductions in the system throughput. To ensure that flow data is transmitted according to the QoS requirements of a flow, a scheduling algorithm must handle data intelligently. We propose methods to allow more efficient scheduling by utilising existing Medium Access Control mechanisms to exchange flow information. We also propose a method to determine the delay-dependent "value" of a packet based on the QoS requirements of the flow. Using this value in scheduling is shown to increase the number of packets sent before a predetermined deadline. We propose a measure of fairness in scheduling that is calculated according to how well each flow's QoS requirements are met. We then introduce a novel scheduling paradigm, Delay Loss Controlled-Earliest Deadline First (DLC-EDF), which is shown to provide better QoS for all flows compared to other scheduling mechanisms studied. We then study the performance of our admission control and scheduling methods working together, and propose a feedback mechanism that allows the admission control threshold to be tuned to maximise the efficient usage of available bandwidth in the network, while ensuring that the QoS requirements of all realtime flows are met. We also examine heterogeneous/vertical handover, providing an overview of the technologies supporting seamless handover. The issues studied in this area include a method of using the Signal to Noise Ratio to trigger handover in heterogeneous networks and QoS Mapping between heterogeneous networks. Our proposed method of QoS mapping establishes the minimum set of QoS parameters applicable to individual flows, and then maps these parameters into system parameter formats for both 802.11e and 802.16e networks.

Identiferoai:union.ndltd.org:ADTP/269031
Date January 2009
CreatorsTeh, Anselm
Source SetsAustraliasian Digital Theses Program
LanguageEN-AUS
Detected LanguageEnglish
RightsCopyright 2009 Anselm Teh

Page generated in 0.0018 seconds