Bandwidth‐guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks

This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.     

A New Connection Admission Control for Spotbeam Handover in LEO Satellite Networks

Frequent spotbeam handovers in low earth orbit (LEO) satellite networks require a technique to decrease the handover blocking probabilities. A large variety of schemes have been proposed to achieve this goal in terrestrial mobile cellular networks. Most of them focus on the notion of prioritized channel allocation algorithms. However, these schemes cannot provide the connection-level quality of service (QoS) guarantees. Due to the scarcity of resources in LEO satellite networks, a connection admission control (CAC) technique becomes important to achieve this connection-level QoS for the spotbeam handovers. In this paper, a geographical connection admission control (GCAC) algorithm is introduced, which estimates the future handover blocking performance of a new call attempt based on the user location database, in order to decrease the handover blocking. Also, for its channel allocation scheme, an adaptive dynamic channel allocation (ADCA) scheme is introduced. By simulation, it is shown that the proposed GCAC with ADCA scheme guarantees the handover blocking probability to a predefined target level of QoS. Since GCAC algorithm utilizes the user location information, performance evaluation indicates that the quality of service (QoS) is also guaranteed in the non-uniform traffic pattern.     

Tiered bandwidth reservation scheme for multimedia wireless networks

It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier‐based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright © 2008 John Wiley & Sons, Ltd.     

Integrating Distributed Channel Allocation and Adaptive Handoff Management for QoS-Sensitive Cellular Networks

Next generation high-speed cellular networks are expected to support multimedia applications, which require QoS provisions. Since frequency spectrum is the most expensive resource in wireless networks, it is a challenge to support QoS using limited frequency spectrum. In the literature, two orthogonal approaches are used to address the bandwidth utilization issue and the QoS provision issue; that is, channel allocation schemes have been proposed to improve bandwidth efficiency, whereas handoff management schemes, based on bandwidth reservation, have been proposed to guarantee a low connection dropping rate. However, little effort has been taken to address both issues together. In this paper, we integrate distributed channel allocation and adaptive handoff management to provide QoS guarantees and efficiently utilize the bandwidth. First, we present a complete distributed distributed channel allocation algorithm and propose techniques to reduce its message complexity and intra-handoff overhead. Second, we integrate the proposed distributed channel allocation algorithm with an adaptive handoff management scheme to provide QoS guarantees and efficiently utilize the bandwidth. Detailed simulation experiments are carried out to evaluate the proposed methodology. Compared to previous schemes, our scheme can significantly reduce the message complexity and intra-handoff overhead. Moreover, the proposed scheme can improve the bandwidth utilization while providing QoS guarantees.     

Performance evaluation of the RQMA-CDMA scheme for multimedia traffic with QoS guarantees

The rapid growth of cellular mobile technology in recent years, coupled with the explosive growth of the Internet, has significantly increased the demand for wireless data services. Traffic on mobile devices is expected to be a mix of real-time traffic such as video, voice, and data, with users requiring diverse quality of service (QoS) guarantees for different types of traffic (video, voice and data). One of the primary challenges of providing QoS is how to prioritize and allocate network resources among contending applications. In order to achieve these goals, a scheduling scheme that can provide equitable and effective packet routing is required. This paper proposes a scheduling scheme called remote queuing multiple access-code division multiple access (RQMA-CDMA), whose purpose is to equitably assign bandwidth resources with QoS guarantees to different mobile devices. RQMA-CDMA is a rate scheduling scheme that can be used to assign bandwidth resources in conjunction with GPS (generalized processor sharing). Additionally, we analyze an admission control that is based on signal to interference plus noise ratio (SINR) for multimedia traffic. Finally, the performance of RQMA-CDMA is evaluated and compared to schemes based on CDMA-GPS according to dropped packets, delay, and throughput.     

QoS multicast routing by using multiple paths/trees in wireless ad hoc networks

In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. In this paper, we propose a new multicast routing scheme by using multiple paths or multiple trees to meet the bandwidth requirement of a call. Three multicast routing strategies are studied, SPT (shortest path tree) based multiple-paths (SPTM), least cost tree based multiple-paths (LCTM) and multiple least cost trees (MLCT). The final routing tree(s) can meet the user’s QoS requirements such that the delay from the source to any destination node shall not exceed the required bound and the aggregate bandwidth of the paths or trees shall meet the bandwidth requirement of the call. Extensive simulations have been conducted to evaluate the performance of our three multicast routing strategies. The simulation results show that the new scheme improves the call success ratio and makes a better use of network resources.     

On the performance and fairness of dynamic channel allocation in wireless mesh networks

Channel assignment in multichannel multiradio wireless mesh networks is a powerful resource management tool to exploit available multiple channels. Channels can be allocated either statically on the basis of long‐term steady state behavior of traffic or dynamically according to actual traffic demands. It is a common belief that dynamic schemes provide better performance; however, these two broad classes of channel allocation schemes have not been compared in detail. In this paper, we quantify the achievable performance gain and fairness improvement through an optimal dynamic channel allocation scheme. We develop optimal algorithms for a dynamic and three static schemes using mixed integer linear programming and compare them in the context of QoS provisioning, where network performance is measured in terms of acceptance rate of QoS sensitive traffic demands. Our extensive simulations show that static schemes should optimize channel allocation for long‐term traffic pattern and maintain max–min fairness to achieve acceptable performances. Although the dynamic and max–min fair static schemes accomplish the same fairness, the dynamic channel allocation outperforms the static scheme about 10% in most cases. In heavily overloaded regimes, especially when network resources are scarce, both have comparable performances, and the max–min fair scheme is preferred because it incurs less overhead. Copyright © 2011 John Wiley & Sons, Ltd.     

An optimized QoS scheme for IMS‐NEMO in heterogeneous networks

The network mobility (NEMO) is proposed to support the mobility management when users move as a whole. In IP Multimedia Subsystem (IMS), the individual Quality of Service (QoS) control for NEMO results in excessive signaling cost. On the other hand, current QoS schemes have two drawbacks: unawareness of the heterogeneous wireless environment and inefficient utilization of the reserved bandwidth. To solve these problems, we present a novel heterogeneous bandwidth sharing (HBS) scheme for QoS provision under IMS‐based NEMO (IMS‐NEMO). The HBS scheme selects the most suitable access network for each session and enables the new coming non‐real‐time sessions to share bandwidth with the Variable Bit Rate (VBR) coded media flows. The modeling and simulation results demonstrate that the HBS can satisfy users' QoS requirement and obtain a more efficient use of the scarce wireless bandwidth. Copyright © 2011 John Wiley & Sons, Ltd.     

Dynamic connection provisioning with shared protection in IP/WDM networks

Internet protocol (IP) traffic connections arrive dynamically at wavelength‐division multiplexing (WDM) network edges with low data rates compared with the wavelength capacity, availability, and quality‐of‐service (QoS) constraints. This paper introduces a scheme to be integrated into the control and management plane of IP/WDM networks to satisfy the availability and QoS required for IP traffic connections bundled onto a single wavelength (lightpath) in WDM networks protected by shared‐backup path protection (SBPP). This scheme consists of two main operations: (i) routing multi‐granular connections and traffic grooming policies, and (ii) providing appropriate shared protection on the basis of subscribers’ service‐level agreements in terms of data rate, availability, and blocking probability. Using the Markov chain process, a probabilistic approach is developed to conceive connection blocking probability models, which can quantify the blocking probability and service utilization of M:N and 1:N SBPP schemes. The proposed scheme and developed mathematical models have been evaluated in terms of bandwidth blocking ratio, availability satisfaction rate, network utilization, and connection blocking probability performance metrics. The obtained research results in this paper provide network operators an operational setting parameter, which controls the allocation of working and backup resources to dynamic IP traffic connections on the basis of their priority and data rate while satisfying their requirements in terms of bandwidth and availability. Copyright © 2013 John Wiley & Sons, Ltd.     

An optimal dynamic resources partitioning auction model for virtual private networks

In this paper, we consider the problem of optimizing the Internet Service Provider (ISP) profit by providing a periodic Dynamic Partitioning (DP) model for utilizing network resources in the context of Virtual Private Networks (VPN). In literature, Complete Sharing (CS), Complete Partitioning (CP), and Bandwidth Borrowing (BR) techniques have been proposed for resource allocation where the following limitations can be noticed: VPN operators can exaggerate about their required resources, resources might be underutilized, and optimal bandwidth utilization is not guaranteed. To overcome the above limitations, we propose to dynamically partition the resources over different QoS classes through periodic auctions that can reduce the reasoning of exaggeration and maximize the ISP profit. Thus, we formulate our problem based on the Integer Linear Programming (ILP) that allows us to maximize the ISP profit and provides the optimal: (1) set of profitable VPN connections, (2) bandwidth division of each network link among QoS classes, and (3) routing scheme for the accepted demand. Furthermore, the proposed ILP model allows us to study the sensitivity of the ISP profit to a targeted revenue objective.