No / The design of a network architecture that can efficiently integrate WLAN and cellular networks is a challenging task, particularly when the objective is to make the interoperation between the two networks as seamless and as efficient as possible. To provide end-to-end quality of service (QoS) support is one of the key stages towards such a goal. Due to various constraints, such as the unbalanced capacity of the two systems, handoff from user mobility and unreliable transmission media, end-to-end QoS is difficult to guarantee. In this paper, we propose a generic reservation-based QoS model for the integrated cellular and WLAN networks. It uses an adaptation mechanism to address the above issues and to support end-to-end QoS. The validity of the proposed scheme is demonstrated via simulation experiments. The performance results reveal that this new scheme can considerably improve the system resource utilization and reduce the call blocking probability and handoff dropping probability of the integrated networks while maintaining acceptable QoS to the end users.

The exponential growth of Internet applications has created new challenges for the control and administration of large-scale networks, which consist of heterogeneous elements under dynamically changing traffic conditions. These emerging applications need guaranteed service levels, beyond those supported by best-effort networks, to deliver the intended services to the end user. Several models have been proposed for a Quality of Service (QoS) framework that can provide the means to transport these services. It is desirable to find efficient routing strategies that can meet the strict routing requirements of these applications. QoS routing is considered as one of the major components of the QoS framework in communication networks. In QoS routing, paths are selected based upon the knowledge of resource availability at network nodes and the QoS requirements of traffic. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and the way they select paths based on this information. The biggest downside of current QoS routing schemes is the frequent maintenance and distribution of global state information across the network, which imposes huge communication and processing overheads. Consequently, scalability is a major issue in designing efficient QoS routing algorithms, due to the high costs of the associated overheads. Moreover, inaccuracy and staleness of global state information is another problem that is caused by relatively long update intervals, which can significantly deteriorate routing performance. Localized QoS routing, where source nodes take routing decisions based solely on statistics collected locally, was proposed relatively recently as a viable alternative to global QoS routing. It has shown promising results in achieving good routing performance, while at the same time eliminating many scalability related problems. In localized QoS routing each source-destination pair needs to determine a set of candidate paths from which a path will be selected to route incoming flows. The goal of this thesis is to enhance the scalability of QoS routing by investigating and developing new models and algorithms based on the localized QoS routing approach. For this thesis, we have extensively studied the localized QoS routing approach and demonstrated that it can achieve a higher routing performance with lower overheads than global QoS routing schemes. Existing localized routing algorithms, Proportional Sticky Routing (PSR) and Credit-Based Routing (CBR), use the blocking probability of candidate paths as the criterion for selecting routing paths based on either flow proportions or a crediting mechanism, respectively. Routing based on the blocking probability of candidate paths may not always reflect the most accurate state of the network. This has motivated the search for alternative localized routing algorithms and to this end we have made the following contributions. First, three localized bandwidth-constrained QoS routing algorithms have been proposed, two are based on a source routing strategy and the third is based on a distributed routing strategy. All algorithms utilize the quality of links rather than the quality of paths in order to make routing decisions. Second, a dynamic precautionary mechanism was used with the proposed algorithms to prevent candidate paths from reaching critical quality levels. Third, a localized delay-constrained QoS routing algorithm was proposed to provide routing with an end-to-end delay guarantee. We compared the performance of the proposed localized QoS routing algorithms with other localized and global QoS routing algorithms under different network topologies and different traffic conditions. Simulation results show that the proposed algorithms outperform the other algorithms in terms of routing performance, resource balancing and have superior computational complexity and scalability features.

The exponential growth of Internet applications has created new challenges for the control and administration of large-scale networks, which consist of heterogeneous elements under dynamically changing traffic conditions. These emerging applications need guaranteed service levels, beyond those supported by best-effort networks, to deliver the intended services to the end user. Several models have been proposed for a Quality of Service (QoS) framework that can provide the means to transport these services. It is desirable to find efficient routing strategies that can meet the strict routing requirements of these applications. QoS routing is considered as one of the major components of the QoS framework in communication networks. In QoS routing, paths are selected based upon the knowledge of resource availability at network nodes and the QoS requirements of traffic. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and the way they select paths based on this information. The biggest downside of current QoS routing schemes is the frequent maintenance and distribution of global state information across the network, which imposes huge communication and processing overheads. Consequently, scalability is a major issue in designing efficient QoS routing algorithms, due to the high costs of the associated overheads. Moreover, inaccuracy and staleness of global state information is another problem that is caused by relatively long update intervals, which can significantly deteriorate routing performance. Localized QoS routing, where source nodes take routing decisions based solely on statistics collected locally, was proposed relatively recently as a viable alternative to global QoS routing. It has shown promising results in achieving good routing performance, while at the same time eliminating many scalability related problems. In localized QoS routing each source¿destination pair needs to determine a set of candidate paths from which a path will be selected to route incoming flows. The goal of this thesis is to enhance the scalability of QoS routing by investigating and developing new models and algorithms based on the localized QoS routing approach. For this thesis, we have extensively studied the localized QoS routing approach and demonstrated that it can achieve a higher routing performance with lower overheads than global QoS routing schemes. Existing localized routing algorithms, Proportional Sticky Routing (PSR) and Credit-Based Routing (CBR), use the blocking probability of candidate paths as the criterion for selecting routing paths based on either flow proportions or a crediting mechanism, respectively. Routing based on the blocking probability of candidate paths may not always reflect the most accurate state of the network. This has motivated the search for alternative localized routing algorithms and to this end we have made the following contributions. First, three localized bandwidth-constrained QoS routing algorithms have been proposed, two are based on a source routing strategy and the third is based on a distributed routing strategy. All algorithms utilize the quality of links rather than the quality of paths in order to make routing decisions. Second, a dynamic precautionary mechanism was used with the proposed algorithms to prevent candidate paths from reaching critical quality levels. Third, a localized delay-constrained QoS routing algorithm was proposed to provide routing with an end-to-end delay guarantee. We compared the performance of the proposed localized QoS routing algorithms with other localized and global QoS routing algorithms under different network topologies and different traffic conditions. Simulation results show that the proposed algorithms outperform the other algorithms in terms of routing performance, resource balancing and have superior computational complexity and scalability features. / Umm AlQura University, Saudi Arabia

Given the current developments and advances in the scientific and technological aspects of human knowledge and introducing new approaches in various fields of telecommunication technologies and industries, there has been an increasing growth in its players' plans and a positive change in their outlooks in order to achieve the target of "anywhere and anytime access". Recent developments of WiMAX (Worldwide interoperability for Microwave Access) networks, as a sign of increasing needs and demands for new telecommunication services and capabilities, have led to revolutions in global telecommunication which should be perceived properly in terms of the commercial and technical aspects in order to enjoy the new opportunities. Most experts believe that WiMAX technology is a preliminary step to develop Fourth Generation networks known as 4G technologies. It has not only succeeded in the utilization of several of the latest telecommunication techniques in the form of unique practical standards, but also paved the way for the quantitative and qualitative developments of high-speed broadband access. IEEE 802.16 Standard introduces several advantages, and one of them is the support for Quality of Services (QoS) at the Media Access Control (MAC) level. For these purposes, the standard defines several scheduling classes at MAC layer to treat service flow in a different way, depending on QoS requirements. In this thesis, we have proposed a new QoS framework for Point-to-Multi Point (PMP) 802.16 systems operating in Time Division Duplexing (TDD) mode over a WirelessMAN-OFDM physical layer. The proposed framework consists of a Call Admission Control (CAC) module and a scheduling scheme for the uplink traffic as well as a simple frame allocation scheme. The proposed CAC module interacts with the uplink scheduler status and it makes its decision based on the scheduler queue status; on the other hand, the proposed scheduling scheme for the uplink traffic aims to support realtime flows and adapts the frame-by-frame allocations to the current needs of the connections, with respect to the grants boundaries fixed by the CAC module. Extensive OPNET simulation demonstrates the effectiveness of the proposed architecture.

Given the current developments and advances in the scientific and technological aspects of human knowledge and introducing new approaches in various fields of telecommunication technologies and industries, there has been an increasing growth in its players¿ plans and a positive change in their outlooks in order to achieve the target of "anywhere and anytime access". Recent developments of WiMAX (Worldwide interoperability for Microwave Access) networks, as a sign of increasing needs and demands for new telecommunication services and capabilities, have led to revolutions in global telecommunication which should be perceived properly in terms of the commercial and technical aspects in order to enjoy the new opportunities. Most experts believe that WiMAX technology is a preliminary step to develop Fourth Generation networks known as 4G technologies. It has not only succeeded in the utilization of several of the latest telecommunication techniques in the form of unique practical standards, but also paved the way for the quantitative and qualitative developments of high-speed broadband access. IEEE 802.16 Standard introduces several advantages, and one of them is the support for Quality of Services (QoS) at the Media Access Control (MAC) level. For these purposes, the standard defines several scheduling classes at MAC layer to treat service flow in a different way, depending on QoS requirements. In this thesis, we have proposed a new QoS framework for Point-to-Multi Point (PMP) 802.16 systems operating in Time Division Duplexing (TDD) mode over a WirelessMAN-OFDM physical layer. The proposed framework consists of a Call Admission Control (CAC) module and a scheduling scheme for the uplink traffic as well as a simple frame allocation scheme. The proposed CAC module interacts with the uplink scheduler status and it makes its decision based on the scheduler queue status; on the other hand, the proposed scheduling scheme for the uplink traffic aims to support realtime flows and adapts the frame-by-frame allocations to the current needs of the connections, with respect to the grants boundaries fixed by the CAC module. Extensive OPNET simulation demonstrates the effectiveness of the proposed architecture.