-
[show abstract]
[hide abstract]
ABSTRACT: Supporting the diverse QoS requirements of multimedia applications is an essential requirement for broadband wireless access (BWA) networks. Due to the projected dynamics in traffic patterns, more capable resource management functionalities are needed. We propose a game-theoretic, congestion-based pricing scheduler that incorporates two sub-schemes: a bandwidth provisioning sub-scheme to address the bandwidth scarcity to provision in fourth generation (4G) BWA technologies and an efficient packet scheduler sub-scheme. To the best of our knowledge, the proposed scheduler is the first one to simultaneously control congestion and fairness while providing differentiated QoS guarantees in BWA networks. Simulation results show that the proposed scheme realizes our objectives of controlling congestion, providing differentiated QoS guarantees, and catering to proportional fairness among the different network classes and among connections within the same class.
IEEE Transactions on Wireless Communications 09/2010; · 2.59 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: The IEEE 802.16 standard, also known as WiMAX, defines flexible frame structures to support applications classified into different WiMAX traffic classes. The standard defines two types of scheduling to guarantee the quality of service (QoS) requirements of these applications - centralized and distributed. However, the standard does not specify how the frame can be dynamically partitioned among its centralized and distributed schedulers or uplink and downlink schedulers. Through efficient partitioning that dynamically adapts the partitioning based on demand, network can support more user applications with different QoS requirements, and hence increase the revenues of service providers. In this paper, we propose a novel and general dynamic frame partitioning scheme for IEEE 802.16 mesh and IEEE 802.16j multi-hop relay networks. The scheme uses a dynamic Markov model that studies the frame utilization over current frames to predict efficient partitions for future frames. Simulation results show that the proposed scheme improves average frame utilization and decreases packet dropping.
Communications, 2009. ICC '09. IEEE International Conference on; 07/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Congestion based pricing algorithms are considered efficient approaches to control congestion and to distinguish services provided for users in computer networks. Game theory lends itself as a prevailing tool to design such algorithms. In this work, we propose a game theoretic congestion based bandwidth provisioning algorithm to address the scarcity for bandwidth provisioning scheme in IEEE 802.16 standard. To the best of our knowledge, the proposed algorithm is the first one to simultaneously control congestion and fairness while providing differentiated QoS guarantees. Simulation results reveal that the proposed scheme realizes our objective of controlling congestion, and provides differentiated QoS guarantees and proportional fairness among the different network classes.
Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: In order to support different types of user applications, the IEEE 802.16 standard defines different service classes together with their associated Quality of Service (QoS) parameters. However, the standard lacks a MAC scheduling architecture that guarantees these defined QoS requirements. The importance of efficient scheduling is crucial to QoS provisioning for multimedia flows. In this paper we propose an opportunistic and optimized downlink scheduler that pledges fairness among admitted connections. Our approach involves separating the scheduling problem into two sub-problems. In the first problem, the proposed scheduler calculates the number of time-slots in each time frame corresponding to the service classes with the objective minimizing the blocking probability of each class. In the second problem, time-slots for each class connection are allocated using an integrated cross-layer priority functions that guarantee proportional fairness. The simulation results reveal that the proposed scheduler realizes our objectives, and provides efficient QoS scheduling without starving the connections of the best effort class.
Communications, 2008. ICC '08. IEEE International Conference on; 06/2008
