Packet switched wireless networks have become increasingly popular due to improvements in transmission speed, ease of deployment and mobility. Wireless technologies such as the IEEE 802.11 Wireless Local Area Networks provide transmission speeds capable of supporting multimedia applications. However, wireless channels suffer from short term effects such as interference and fading, and long term effects such as signal strength changes that are caused by user mobility. In multi-rate networks, stations can adapt to the channel variations by adjusting their physical transmission rates. This introduces resource management problems as resource usage depends on the application's bit rate as well as the physical transmission rate used. Multimedia applications demand consistent Quality of Service (QoS) performance from the network. This does not fit well with the dynamic nature of wireless networks. In this thesis, we propose a link layer resource manager to maintain application QoS requirements in multi-rate wireless networks. It consists of two components - Resource reservation and Medium Access Control (MAC) parameters selection. The resource reservation algorithm determines the current and future amount of channel resources required by a multimedia application and performs the function of admission control. This prevents any new traffic or physical transmission rate changes from degrading the QoS of the admitted traffic. The design of the MAC parameters selection algorithm is based on the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) scheme. The algorithm enables the provision of QoS to individual multimedia applications with the prioritised service of EDCA. Analytical and simulation studies were performed to demonstrate the efficiency and effectiveness of the algorithms. The results highlighted the ability of the algorithms to mitigate the QoS provision problem in multi-rate wireless networks introduced by channel variations.

Cooperative traffic safety applications such as lane change or overtaking assistance have the potential to reduce the number of road fatalities. Many emerging traffic safety applications are based on IEEE 802.11p and periodic position messages, so-called cooperative awareness messages (CAM) being broadcasted by all vehicles. In Europe, ETSI defines a periodic report rate of 2 Hz for CAMs. Although a high report rate is the key to early hazard detection, the 2 Hz rate has been chosen to avoid congestion in settings where the vehicle density is high, e.g., on major highways and in urban scenarios. However, on rural roads with a limited number of communicating vehicles, a report rate of 2 Hz leads to unnecessary delay in cooperative awareness. By adapting the CAM report rate depending on the specific application and road traffic density, and by making use of the priority levels provided by the 802.11p quality of service mechanism, we show that hazards can be detected earlier and the available bandwidth is used more efficiently, while not overexploiting the network resources. / <p>©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</p><p></p><p>Category number CFP11VTF-ART; Code 87844</p>

Interdomain traffic engineering (TE) controls the flow of traffic between autonomous systems (ASes) to achieve performance goals under various resource constraints. Interdomain TE can be categorized into ingress TE and egress TE, which aim to control the ingress and egress traffic flow in a network, respectively. Most interdomain TE techniques are based on BGP, which was not designed to support performance based routing. Hence even though some basic interdomain TE techniques are widely deployed, their overall effectiveness and impact on interdomain traffic are not well understood. Furthermore, systematic practices for deploying these techniques have yet to be developed. In this thesis, we explore these open issues for both ingress and egress TE. We first focus on the AS-Path prepending technique in interdomain ingress TE. We design a polynomial algorithm that takes network settings as input and produces the optimal prepending at each ingress link. We also develop methods to measure the inputs of the optimal algorithm by leveraging widely available looking glass severs and evaluate the errors of such measurement. We further propose an algorithm, based on this optimal algorithm, that is robust to input errors. We then focus on Intelligent Routing Control (IRC) systems often used at multihomed networks for egress interdomain TE. To address the possible traffic oscillation problem caused by multiple IRC systems, we design a class of randomized IRC algorithms. Through simulations, we show that the proposed algorithms can effectively mitigate oscillations. We also show that IRC systems using randomized path switching algorithms perform better than those switching path deterministically, when both types of IRC systems co-exist. To further understand the performance impact of IRC systems, we next focus on the performance of applications, such as TCP connections. We study the synergistic and antagonistic interactions between IRC and TCP connections, through a simple dual-feedback model. We first examine the impact of sudden RTT and available bandwidth changes in TCP connection. We then examine the effect of IRC measurement delays on closed loop traffic. We also show the conditions under which IRC is beneficial under various path impairment models.

In this work, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment decisions that gives the best trade-off in terms of performance and complexity. We present a new granularity for channel assignment that we refer to as component level channel assignment. The strategy is relatively simple, and is characterized by several impressive practical advantages. We also show that the theoretical performance of the component based channel assignment strategy does not lag significantly behind the optimal possible performance, and perhaps more importantly we show that when coupled with its several practical advantages, it significantly outperforms other strategies under most network conditions.

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / toc / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

This thesis presents several decentralized, learning-based algorithms for on-line routing of bandwidth guaranteed paths. The presented routing algorithms do not need any a-priori knowledge of traffic demand; they use only their locally observed events and update their routing policy using learning schemes. The employed learning algorithms are either learning automata or the multi-armed bandit algorithms. We investigate the asymptotic behavior of the proposed routing algorithms and prove the convergence of one of them to the user equilibrium. Discrete event simulation results show the merit of these algorithms in terms of improving the resource utilization and increasing the network admissibility compared with shortest path routing. / We investigate the performance degradation due to decentralized routing as opposed to centralized optimal routing policies in practical scenarios. The system optimal and the Nash bargaining solutions are two centralized benchmarks used in this study. We provide nonlinear programming formulations of these problems along with a distributed recursive approach to compute the solutions. An on-line partially-decentralized control architecture is also proposed to achieve the system optimal and the Nash bargaining solution performances. Numerical results in some practical scenarios with well engineered networks, where the network resources and traffic demand are well matched, indicate that decentralized learning techniques provide efficient, stable and scalable approaches for routing the bandwidth guaranteed paths. / In the context of on-line learning, we propose a new algorithm to track the best action-selection policy when it abruptly changes over time. The proposed algorithm employs change detection mechanisms to detect the sudden changes and restarts the learning process on the detection of an abrupt change. The performance analysis of this study reveals that when all the changes are detectable by the change detection mechanism, the proposed tracking the best action-selection policy algorithm is rate optimal. On-line routing of bandwidth guaranteed paths with the potential occurrence of network shocks such as significant changes in the traffic demand is one of the applications of the devised algorithm. Simulation results show the merit of the proposed algorithm in tracking the optimal routing policy when it abruptly changes.

No description available.

Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2008. / Committee Chair: Xu, Jun; Committee Member: Ammar, Mostafa; Committee Member: Feamster, Nick; Committee Member: Ma, Xiaoli; Committee Member: Zegura, Ellen.

Thesis (MSc (Mathematical Sciences. Computer Science))--University of Stellenbosch, 2007. / It is widely recognized that Traffic engineering (TE) mechanisms have to be added to the IP transport functionalities to provide QoS guarantees while ensuring efficient use of network resources. Traffic engineering is a network management technique which routes traffic to where bandwidth is available in the network to achieve QoS agreements between current and future demands and the available network resources. Multi-path routing has been proven to be a more efficient TE mechanism than Shortest Path First (SPF) routing in terms of proffit maximization and resource usage optimization. However the identiffication of set of paths over which traffic is forwarded from source to the destination and the distribution of traffic among these paths are two issues that have been widely addressed by the IP community but remain an open issue for the emerging generation IP networks. Building upon different frameworks, this thesis revisits the issue of multi-path routing to present and evaluate the performance of different traffic splitting mechanisms to achieve QoS routing in Multi-Protocol Label Switching (MPLS) and Wireless Sensor Networks (WSNs). Three main contributions are identified in this thesis. First, we extend an optimization model that used the M/M/1 queueing model on a simple network consisting of a single source-destination pair by using the M/M/s queueing model on a general network consisting of several source-destination pairs. The model solves a multi-path routing problem by defining a Hamiltonian as a function of delay incurred and subjecting this Hamiltonian to Pontryagin's cost minimization to achieve efficient diffusion of traffic over the available parallel paths. Second, we revisit the problem of cost-based optimization in a multi-path setting by using a Game theoretical framework to propose and evaluate the performance of competitive and cooperative multi-path routing schemes and the impact of the routing metric (cost) on the difference between these two schemes. Finally, building upon a previously proposed optimization benchmark, we propose an Energy constrained QoS routing scheme for Wireless Sensor Networks and show through simulation that our scheme outperforms the benchmark scheme.